#898484 (C++23) No.2404 Vertical Throw Up

• 問題: No.2404 Vertical Throw Up
• ユーザー: 👑 rin204
• 提出日時: 2023-08-04 22:14:16
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 11,464 bytes
• コンパイル時間: 3,340 ms
• コンパイル使用メモリ: 255,940 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-14 20:11:28
• 合計ジャッジ時間: 4,945 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,820 KB
testcase_03	AC	28 ms; 6,820 KB
testcase_04	AC	22 ms; 6,816 KB
testcase_05	AC	34 ms; 6,820 KB
testcase_06	AC	2 ms; 6,816 KB
testcase_07	AC	34 ms; 6,820 KB
testcase_08	AC	27 ms; 6,820 KB
testcase_09	AC	22 ms; 6,820 KB
testcase_10	AC	7 ms; 6,820 KB
testcase_11	AC	7 ms; 6,816 KB
testcase_12	AC	5 ms; 6,816 KB
testcase_13	AC	2 ms; 6,816 KB
testcase_14	AC	2 ms; 6,820 KB
testcase_15	AC	3 ms; 6,816 KB
testcase_16	AC	3 ms; 6,820 KB
testcase_17	AC	3 ms; 6,820 KB
testcase_18	AC	3 ms; 6,820 KB
testcase_19	AC	3 ms; 6,820 KB
testcase_20	AC	3 ms; 6,816 KB
testcase_21	AC	2 ms; 6,820 KB
testcase_22	AC	2 ms; 6,820 KB
testcase_23	AC	2 ms; 6,816 KB
testcase_24	AC	2 ms; 6,816 KB
testcase_25	AC	2 ms; 6,816 KB
testcase_26	AC	3 ms; 6,820 KB
testcase_27	AC	2 ms; 6,816 KB
testcase_28	AC	2 ms; 6,816 KB
testcase_29	AC	3 ms; 6,816 KB
testcase_30	AC	2 ms; 6,816 KB
testcase_31	AC	3 ms; 6,816 KB
testcase_32	AC	2 ms; 6,816 KB

ソースコード

// start A.cpp
// start A.cpp
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));

#ifndef RIN__LOCAL
#define endl "\n"
#endif
#define spa ' '
#define len(A) A.size()
#define all(A) begin(A), end(A)

#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}

#define INT(...)                                                                                                                                                                                       \
    int __VA_ARGS__;                                                                                                                                                                                   \
    inp(__VA_ARGS__);
#define LL(...)                                                                                                                                                                                        \
    ll __VA_ARGS__;                                                                                                                                                                                    \
    inp(__VA_ARGS__);
#define STRING(...)                                                                                                                                                                                    \
    string __VA_ARGS__;                                                                                                                                                                                \
    inp(__VA_ARGS__);
#define CHAR(...)                                                                                                                                                                                      \
    char __VA_ARGS__;                                                                                                                                                                                  \
    inp(__VA_ARGS__);
#define VEC(T, A, n)                                                                                                                                                                                   \
    vector<T> A(n);                                                                                                                                                                                    \
    inp(A);
#define VVEC(T, A, n, m)                                                                                                                                                                               \
    vector<vector<T>> A(n, vector<T>(m));                                                                                                                                                              \
    inp(A);

const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

void FLUSH() {
    cout << flush;
}
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(forward<Tail>(tail)...);
}
template <typename T>
void print(vector<T> &A) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << ' ';
    }
    cout << endl;
}
template <typename T>
void print(vector<vector<T>> &A) {
    for (auto &row : A) print(row);
}
template <typename T, typename S>
void print(pair<T, S> &A) {
    cout << A.first << spa << A.second << endl;
}
template <typename T, typename S>
void print(vector<pair<T, S>> &A) {
    for (auto &row : A) print(row);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void priend(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}
template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}
template <typename T>
void inp(vector<T> &A) {
    for (auto &a : A) cin >> a;
}
template <typename T>
void inp(vector<vector<T>> &A) {
    for (auto &row : A) inp(row);
}
template <typename T, typename S>
void inp(pair<T, S> &A) {
    inp(A.first, A.second);
}
template <typename T, typename S>
void inp(vector<pair<T, S>> &A) {
    for (auto &row : A) inp(row.first, row.second);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}
template <typename T>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// start data_structure/DynamicLiChaoTree.hpp

template <typename T, T low, T upp, T inf>
struct DynamicLiChaoTree {
    struct Line {
        T a, b;
        Line(T a, T b) : a(a), b(b) {}

        inline T get(T x) const {
            return a * x + b;
        }
    };

    struct Node {
        Line x;
        Node *l, *r;
        Node(const Line &x) : x{x}, l{nullptr}, r{nullptr} {}
    };

    Node *root;

    DynamicLiChaoTree() : root{nullptr} {}

    Node *add_line(Node *t, Line &x, const T &l, const T &r, const T &xl, const T &xr) {
        if (!t) return new Node(x);
        T tl = t->x.get(l);
        T tr = t->x.get(r);

        if (tl <= xl && tr <= xr)
            return t;
        else if (tl >= xl && tr >= xr) {
            t->x = x;
            return t;
        } else {
            T m = (l + r) / 2;
            if (m == r) m--;
            T tm = t->x.get(m);
            T xm = x.get(m);
            if (tm > xm) {
                swap(t->x, x);
                if (xl >= tl)
                    t->l = add_line(t->l, x, l, m, tl, tm);
                else
                    t->r = add_line(t->r, x, m + 1, r, tm + x.a, tr);
            } else {
                if (tl >= xl)
                    t->l = add_line(t->l, x, l, m, xl, xm);
                else
                    t->r = add_line(t->r, x, m + 1, r, xm + x.a, xr);
            }
            return t;
        }
    }

    void add_line(const T &a, const T &b) {
        Line x(a, b);
        root = add_line(root, x, low, upp, x.get(low), x.get(upp));
    }

    Node *add_segment(Node *t, Line &x, const T &a, const T &b, const T &l, const T &r, const T &xl, const T &xr) {
        if (r < a || b < l) return t;
        if (a <= l && r <= b) {
            Line y{x};
            return add_line(t, y, l, r, xl, xr);
        }
        if (t) {
            T tl = t->x.get(l);
            T tr = t->x.get(r);
            if (tl <= xl && tr <= xr) return t;
        } else {
            t = new Node(Line(0, inf));
        }
        T m = (l + r) / 2;
        if (m == r) m--;
        T xm = x.get(m);
        t->l = add_segment(t->l, x, a, b, l, m, xl, xm);
        t->r = add_segment(t->r, x, a, b, m + 1, r, xm + x.a, xr);
        return t;
    }

    void add_segment(const T &l, const T &r, const T &a, const T &b) {
        Line x(a, b);
        root = add_segment(root, x, l, r - 1, low, upp, x.get(low), x.get(upp));
    }

    T query(const Node *t, const T &l, const T &r, const T &x) const {
        if (!t) return inf;
        if (l == r) return t->x.get(x);
        T m = (l + r) / 2;
        if (m == r) m--;
        if (x <= m)
            return min(t->x.get(x), query(t->l, l, m, x));
        else
            return min(t->x.get(x), query(t->r, m + 1, r, x));
    }

    T query(const T &x) const {
        return query(root, low, upp, x);
    }
};

// end data_structure/DynamicLiChaoTree.hpp
// restart A.cpp

void solve() {
    LL(a);
    DynamicLiChaoTree<__int128_t, 0, 1LL << 30, __int128_t(1) << 100> tree;
    INT(Q);
    fori(Q) {
        LL(ty, s);
        if (ty == 1) {
            LL(t);
            ll b = a * (t + s);
            ll c = a * t * t - b * t;
            tree.add_line(-b, -c);
        } else {
            ll res = tree.query(s);
            ll ans = max(0LL, -res - a * s * s);
            print(ans);
        }
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}

// end A.cpp

// end A.cpp