結果

問題 No.2404 Vertical Throw Up
ユーザー noya2noya2
提出日時 2023-08-04 22:47:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 33 ms / 2,000 ms
コード長 6,843 bytes
コンパイル時間 3,037 ms
コンパイル使用メモリ 220,276 KB
実行使用メモリ 7,500 KB
最終ジャッジ日時 2024-10-14 20:53:29
合計ジャッジ時間 4,897 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 25 ms
5,932 KB
testcase_04 AC 22 ms
5,840 KB
testcase_05 AC 33 ms
7,500 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 33 ms
7,444 KB
testcase_08 AC 25 ms
6,076 KB
testcase_09 AC 20 ms
5,632 KB
testcase_10 AC 7 ms
5,248 KB
testcase_11 AC 6 ms
5,248 KB
testcase_12 AC 5 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 3 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 3 ms
5,248 KB
testcase_28 AC 3 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 AC 2 ms
5,248 KB
testcase_32 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "template/inout.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

namespace noya2{


template<typename T>
struct LiChaoTree {
    static const T ymax = 3e18;
    struct Line {
        T a, b;
        Line (T _a = 0, T _b = ymax) : a(_a), b(_b) {}
        T get(T x){return a * x + b;}
    };
    LiChaoTree (const vector<T> &_xs){
        xs = _xs;
        sort(xs.begin(),xs.end());
        xs.erase(unique(xs.begin(),xs.end()),xs.end());
        int _n = xs.size();
        n = 1;
        while (n < _n) n *= 2;
        xs.resize(n);
        for (int i = _n; i < n; i++) xs[i] = xs[_n-1];
        seg.resize(n*2-1);
    }
    void line_add(T a, T b){ inner_line_add(Line(a,b),0,0,n);}
    void segment_add(T a, T b, T l, T r){
        int sl = lower_bound(xs.begin(),xs.end(),l) - xs.begin();
        int sr = lower_bound(xs.begin(),xs.end(),r) - xs.begin();
        inner_segment_add(sl,sr,Line(a,b),0,0,n);
    }
    T get(T x){
        int s = lower_bound(xs.begin(),xs.end(),x) - xs.begin();
        s += n-1;
        T res = ymax;
        res = min(res,seg[s].get(x));
        while (s > 0){
            s = (s-1) / 2;
            res = min(res,seg[s].get(x));
        }
        return res;
    }
  private:
    int n;
    vector<T> xs;
    vector<Line> seg;
    void inner_line_add(Line L, int i, int l, int r){
        T la = L.get(xs[l]);
        T lb = seg[i].get(xs[l]);
        T ra = L.get(xs[r-1]);
        T rb = seg[i].get(xs[r-1]);
        if (la >= lb && ra >= rb) return ;
        if (la <= lb && ra <= rb) {
            seg[i] = L;
            return ;
        }
        int m = (l + r) / 2;
        T ma = L.get(xs[m]);
        T mb = seg[i].get(xs[m]);
        if (ma < mb){
            swap(L,seg[i]);
            swap(la,lb);
            swap(ra,rb);
        }
        if (la < lb) inner_line_add(L,2*i+1,l,m);
        if (ra < rb) inner_line_add(L,2*i+2,m,r);
    }
    void inner_segment_add(int L, int R, Line S, int i, int l, int r){
        if (r <= L || R <= l) return ;
        if (L <= l && r <= R) inner_line_add(S,i,l,r);
        else {
            int m = (l + r) / 2;
            inner_segment_add(L,R,S,2*i+1,l,m);
            inner_segment_add(L,R,S,2*i+2,m,r);
        }
    }
};

} // namespace noya2

void solve(){
    ll a; in(a);
    int q; in(q);
    vector<ll> ts;
    vector<pll> querys(q);
    rep(i,q){
        int t; in(t);
        if (t == 1){
            in(querys[i]);
        }
        if (t == 2){
            ll x; in(x);
            ts.emplace_back(x);
            querys[i] = pll(x,-1);
        }
    }
    LiChaoTree<ll> lct(ts);
    for (auto [s1, s2] : querys){
        if (s2 == -1){
            ll ans = -a*s1*s1 -a*lct.get(s1);
            out(max(0LL,ans));
            continue;
        }
        lct.line_add(-s1-s2,s1*s2);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0