oj.uz

답안 #985849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
985849 2024-05-19T06:24:28 Z GrindMachine Fish 2 (JOI22_fish2) C++17
48 / 100
 4000 ms 30668 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/101003?#comment-898608

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct lazysegtree {
    /*=======================================================*/

    struct data {
        ll mn,cnt;
    };

    struct lazy {
        ll a;
    };

    data d_neutral = {inf2,0};
    lazy l_neutral = {0};

    void merge(data &curr, data &left, data &right) {
        curr.mn = min(left.mn,right.mn);
        curr.cnt = 0;
        if(left.mn == curr.mn) curr.cnt += left.cnt;
        if(right.mn == curr.mn) curr.cnt += right.cnt;
    }

    void create(int x, int lx, int rx, T v) {
        tr[x] = {v,1};
    }

    void modify(int x, int lx, int rx, T v) {
        lz[x].a = v;
    }

    void propagate(int x, int lx, int rx) {
        ll v = lz[x].a;
        if(!v) return;

        tr[x].mn += v;

        if(rx-lx > 1){
            lz[2*x+1].a += v;
            lz[2*x+2].a += v;
        }

        lz[x] = l_neutral;
    }

    /*=======================================================*/

    int siz = 1;
    vector<data> tr;
    vector<lazy> lz;

    lazysegtree() {

    }

    lazysegtree(int n) {
        while (siz < n) siz *= 2;
        tr.assign(2 * siz, d_neutral);
        lz.assign(2 * siz, l_neutral);
    }

    void build(int n, int x, int lx, int rx) {
        if (rx - lx == 1) {
            if (lx < n) {
                create(x, lx, rx, 0);
            }

            return;
        }

        int mid = (lx + rx) / 2;

        build(n, 2 * x + 1, lx, mid);
        build(n, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void build(int n) {
        build(n, 0, 0, siz);
    }

    void rupd(int l, int r, T v, int x, int lx, int rx) {
        propagate(x, lx, rx);

        if (lx >= r or rx <= l) return;
        if (lx >= l and rx <= r) {
            modify(x, lx, rx, v);
            propagate(x, lx, rx);
            return;
        }

        int mid = (lx + rx) / 2;

        rupd(l, r, v, 2 * x + 1, lx, mid);
        rupd(l, r, v, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void rupd(int l, int r, T v) {
        rupd(l, r + 1, v, 0, 0, siz);
    }

    data query(int l, int r, int x, int lx, int rx) {
        propagate(x, lx, rx);

        if (lx >= r or rx <= l) return d_neutral;
        if (lx >= l and rx <= r) return tr[x];

        int mid = (lx + rx) / 2;

        data curr;
        data left = query(l, r, 2 * x + 1, lx, mid);
        data right = query(l, r, 2 * x + 2, mid, rx);

        merge(curr, left, right);
        return curr;
    }

    data query(int l, int r) {
        return query(l, r + 1, 0, 0, siz);
    }
};

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        ll sum,mnp,mns,val1,val2;
    };

    data neutral = {0,0,0,inf2,inf2};

    data merge(data &left, data &right) {
        data curr;

        curr.sum = left.sum+right.sum;
        curr.mnp = min({left.mnp,left.sum+right.mnp});
        curr.mns = min({right.mns,right.sum+left.mns});
        curr.val1 = min({left.val1,curr.mnp});
        curr.val2 = min({right.val2,curr.mns});

        return curr;
    }

    void create(int i, T v) {

    }

    void modify(int i, T v) {
        tr[i] = {v,-v,-v};
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

ll msb(ll x){
    return 63-__builtin_clzll(x);
}

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];
    a[0] = a[n+1] = inf2;
    vector<ll> p(n+5);
    rep1(i,n) p[i] = p[i-1]+a[i];

    vector<ll> ngel(n+5), nger(n+5,n+1);

    {
        stack<ll> stk;

        rep1(i,n){
            while(!stk.empty() and a[i] >= a[stk.top()]){
                nger[stk.top()] = i;
                stk.pop();
            }
            stk.push(i);
        }
    }

    {
        stack<ll> stk;

        rev(i,n,1){
            while(!stk.empty() and a[i] >= a[stk.top()]){
                ngel[stk.top()] = i;
                stk.pop();
            }
            stk.push(i);
        }
    }

    set<pll> pairs;

    auto add_pair = [&](ll l, ll r){
        if(l > r) swap(l,r);
        if(r-l-1 <= 0) return;

        ll sum = p[r-1]-p[l];
        if(min(a[l],a[r]) > sum){
            pairs.insert({l+1,r-1});
        }
    };

    rep1(i,n){
        add_pair(i,ngel[i]);
        add_pair(i,nger[i]);
    }

    lazysegtree<ll> st(n+5);
    st.build(n+1);
    for(auto [l,r] : pairs){
        st.rupd(l,r,1);
    }

    segtree<ll> seg(n+5);
    rep1(i,n) seg.pupd(i,a[i]);

    set<ll> pos[30];
    rep1(i,n) pos[msb(a[i])].insert(i);

    auto get = [&](ll i){
        // sum[l..i] < a[l-1]
        vector<ll> points_left;
        rep(bit,30){
            auto it = pos[bit].upper_bound(i);
            if(it != pos[bit].begin()){
                it--;
                points_left.pb(*it);
                if(it != pos[bit].begin()){
                    it--;
                    points_left.pb(*it);
                }
            }
        }

        vector<pll> ok_left;
        
        trav(l,points_left){
            if(i == l) conts;
            ll sum = seg.query(l+1,i).sum;
            if(sum < a[l]){
                ok_left.pb({l+1,sum});
            }
        }

        ok_left.pb({1,seg.query(1,i).sum});

        // sum[i..r] < a[r+1]
        vector<ll> points_right;
        rep(bit,30){
            auto it = pos[bit].lower_bound(i);
            if(it != pos[bit].end()){
                points_right.pb(*it);
                if(next(it) != pos[bit].end()){
                    points_right.pb(*next(it));
                }
            }
        }

        vector<pll> ok_right;

        trav(r,points_right){
            if(i == r) conts;
            ll sum = seg.query(i,r-1).sum;
            if(sum < a[r]){
                ok_right.pb({r-1,sum});
            }
        }

        ok_right.pb({n,seg.query(i,n).sum});

        // merge ok_left, ok_right
        vector<pll> segs;

        for(auto [l,sum1] : ok_left){
            for(auto [r,sum2] : ok_right){
                ll sum = sum1+sum2-a[i];
                if(sum < min(a[l-1],a[r+1])){
                    segs.pb({l,r});
                }
            }
        }

        return segs;
    };

    ll q; cin >> q;
    while(q--){
        ll t; cin >> t;
        if(t == 1){
            ll i,v; cin >> i >> v;
            set<pll> del,ins;

            for(int j = i-1; j <= i+1; ++j){
                if(j >= 1 and j <= n){
                    auto segs = get(j);
                    trav(p,segs){
                        del.insert(p);
                    }
                }
            }

            pos[msb(a[i])].erase(i);
            a[i] = v;
            seg.pupd(i,v);
            pos[msb(v)].insert(i);

            for(int j = i-1; j <= i+1; ++j){
                if(j >= 1 and j <= n){
                    auto segs = get(j);
                    trav(p,segs){
                        ins.insert(p);
                    }
                }
            }

            for(auto [l,r] : del){
                st.rupd(l,r,-1);
            }
            for(auto [l,r] : ins){
                st.rupd(l,r,1);
            }
        }
        else{
            ll l,r; cin >> l >> r;
            ll pos1 = l, pos2 = r;

            {
                ll lo = l, hi = r;
                while(lo <= hi){
                    ll mid = (lo+hi) >> 1;
                    if(seg.query(l,mid-1).sum+seg.query(mid,r).val1 < 0){
                        pos1 = mid;
                        lo = mid+1;
                    }
                    else{
                        hi = mid-1;
                    }
                }
            }

            {
                ll lo = l, hi = r;
                while(lo <= hi){
                    ll mid = (lo+hi) >> 1;
                    if(seg.query(mid+1,r).sum+seg.query(l,mid).val2 < 0){
                        pos2 = mid;
                        hi = mid-1;
                    }
                    else{
                        lo = mid+1;
                    }
                }
            }

            ll ans = st.query(pos1,pos2).cnt;
            cout << ans << endl;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 5 ms 584 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 7 ms 388 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 28100 KB Output is correct
3 Correct 69 ms 27208 KB Output is correct
4 Correct 78 ms 27984 KB Output is correct
5 Correct 71 ms 27204 KB Output is correct
6 Correct 54 ms 25936 KB Output is correct
7 Correct 46 ms 23892 KB Output is correct
8 Correct 54 ms 25900 KB Output is correct
9 Correct 45 ms 24028 KB Output is correct
10 Correct 60 ms 25172 KB Output is correct
11 Correct 58 ms 24804 KB Output is correct
12 Correct 50 ms 24884 KB Output is correct
13 Correct 51 ms 24884 KB Output is correct
14 Correct 72 ms 26960 KB Output is correct
15 Correct 66 ms 27004 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 5 ms 584 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 7 ms 388 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 78 ms 28100 KB Output is correct
23 Correct 69 ms 27208 KB Output is correct
24 Correct 78 ms 27984 KB Output is correct
25 Correct 71 ms 27204 KB Output is correct
26 Correct 54 ms 25936 KB Output is correct
27 Correct 46 ms 23892 KB Output is correct
28 Correct 54 ms 25900 KB Output is correct
29 Correct 45 ms 24028 KB Output is correct
30 Correct 60 ms 25172 KB Output is correct
31 Correct 58 ms 24804 KB Output is correct
32 Correct 50 ms 24884 KB Output is correct
33 Correct 51 ms 24884 KB Output is correct
34 Correct 72 ms 26960 KB Output is correct
35 Correct 66 ms 27004 KB Output is correct
36 Correct 110 ms 28768 KB Output is correct
37 Correct 94 ms 27312 KB Output is correct
38 Correct 75 ms 26676 KB Output is correct
39 Correct 128 ms 28700 KB Output is correct
40 Correct 75 ms 26800 KB Output is correct
41 Correct 74 ms 25940 KB Output is correct
42 Correct 65 ms 26008 KB Output is correct
43 Correct 70 ms 24116 KB Output is correct
44 Correct 61 ms 23968 KB Output is correct
45 Correct 106 ms 25428 KB Output is correct
46 Correct 85 ms 25184 KB Output is correct
47 Correct 53 ms 23796 KB Output is correct
48 Correct 83 ms 24976 KB Output is correct
49 Correct 60 ms 24916 KB Output is correct
50 Correct 90 ms 26892 KB Output is correct
51 Correct 76 ms 26816 KB Output is correct
52 Correct 70 ms 26908 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 28100 KB Output is correct
3 Correct 69 ms 27208 KB Output is correct
4 Correct 78 ms 27984 KB Output is correct
5 Correct 71 ms 27204 KB Output is correct
6 Correct 54 ms 25936 KB Output is correct
7 Correct 46 ms 23892 KB Output is correct
8 Correct 54 ms 25900 KB Output is correct
9 Correct 45 ms 24028 KB Output is correct
10 Correct 60 ms 25172 KB Output is correct
11 Correct 58 ms 24804 KB Output is correct
12 Correct 50 ms 24884 KB Output is correct
13 Correct 51 ms 24884 KB Output is correct
14 Correct 72 ms 26960 KB Output is correct
15 Correct 66 ms 27004 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 717 ms 29232 KB Output is correct
18 Correct 781 ms 30668 KB Output is correct
19 Correct 732 ms 29292 KB Output is correct
20 Correct 751 ms 29164 KB Output is correct
21 Correct 750 ms 29076 KB Output is correct
22 Correct 720 ms 30632 KB Output is correct
23 Correct 740 ms 29124 KB Output is correct
24 Correct 757 ms 29684 KB Output is correct
25 Correct 752 ms 29228 KB Output is correct
26 Correct 763 ms 29516 KB Output is correct
27 Correct 723 ms 27728 KB Output is correct
28 Correct 683 ms 27864 KB Output is correct
29 Correct 673 ms 27784 KB Output is correct
30 Correct 691 ms 26108 KB Output is correct
31 Correct 722 ms 25556 KB Output is correct
32 Correct 737 ms 26672 KB Output is correct
33 Correct 712 ms 27080 KB Output is correct
34 Correct 733 ms 26192 KB Output is correct
35 Correct 738 ms 25884 KB Output is correct
36 Correct 723 ms 27200 KB Output is correct
37 Correct 662 ms 26536 KB Output is correct
38 Correct 637 ms 26324 KB Output is correct
39 Correct 702 ms 28968 KB Output is correct
40 Correct 780 ms 28756 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 28100 KB Output is correct
3 Correct 69 ms 27208 KB Output is correct
4 Correct 78 ms 27984 KB Output is correct
5 Correct 71 ms 27204 KB Output is correct
6 Correct 54 ms 25936 KB Output is correct
7 Correct 46 ms 23892 KB Output is correct
8 Correct 54 ms 25900 KB Output is correct
9 Correct 45 ms 24028 KB Output is correct
10 Correct 60 ms 25172 KB Output is correct
11 Correct 58 ms 24804 KB Output is correct
12 Correct 50 ms 24884 KB Output is correct
13 Correct 51 ms 24884 KB Output is correct
14 Correct 72 ms 26960 KB Output is correct
15 Correct 66 ms 27004 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Execution timed out 4058 ms 29060 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 5 ms 584 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 7 ms 388 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 78 ms 28100 KB Output is correct
23 Correct 69 ms 27208 KB Output is correct
24 Correct 78 ms 27984 KB Output is correct
25 Correct 71 ms 27204 KB Output is correct
26 Correct 54 ms 25936 KB Output is correct
27 Correct 46 ms 23892 KB Output is correct
28 Correct 54 ms 25900 KB Output is correct
29 Correct 45 ms 24028 KB Output is correct
30 Correct 60 ms 25172 KB Output is correct
31 Correct 58 ms 24804 KB Output is correct
32 Correct 50 ms 24884 KB Output is correct
33 Correct 51 ms 24884 KB Output is correct
34 Correct 72 ms 26960 KB Output is correct
35 Correct 66 ms 27004 KB Output is correct
36 Correct 110 ms 28768 KB Output is correct
37 Correct 94 ms 27312 KB Output is correct
38 Correct 75 ms 26676 KB Output is correct
39 Correct 128 ms 28700 KB Output is correct
40 Correct 75 ms 26800 KB Output is correct
41 Correct 74 ms 25940 KB Output is correct
42 Correct 65 ms 26008 KB Output is correct
43 Correct 70 ms 24116 KB Output is correct
44 Correct 61 ms 23968 KB Output is correct
45 Correct 106 ms 25428 KB Output is correct
46 Correct 85 ms 25184 KB Output is correct
47 Correct 53 ms 23796 KB Output is correct
48 Correct 83 ms 24976 KB Output is correct
49 Correct 60 ms 24916 KB Output is correct
50 Correct 90 ms 26892 KB Output is correct
51 Correct 76 ms 26816 KB Output is correct
52 Correct 70 ms 26908 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 717 ms 29232 KB Output is correct
55 Correct 781 ms 30668 KB Output is correct
56 Correct 732 ms 29292 KB Output is correct
57 Correct 751 ms 29164 KB Output is correct
58 Correct 750 ms 29076 KB Output is correct
59 Correct 720 ms 30632 KB Output is correct
60 Correct 740 ms 29124 KB Output is correct
61 Correct 757 ms 29684 KB Output is correct
62 Correct 752 ms 29228 KB Output is correct
63 Correct 763 ms 29516 KB Output is correct
64 Correct 723 ms 27728 KB Output is correct
65 Correct 683 ms 27864 KB Output is correct
66 Correct 673 ms 27784 KB Output is correct
67 Correct 691 ms 26108 KB Output is correct
68 Correct 722 ms 25556 KB Output is correct
69 Correct 737 ms 26672 KB Output is correct
70 Correct 712 ms 27080 KB Output is correct
71 Correct 733 ms 26192 KB Output is correct
72 Correct 738 ms 25884 KB Output is correct
73 Correct 723 ms 27200 KB Output is correct
74 Correct 662 ms 26536 KB Output is correct
75 Correct 637 ms 26324 KB Output is correct
76 Correct 702 ms 28968 KB Output is correct
77 Correct 780 ms 28756 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Execution timed out 4058 ms 29060 KB Time limit exceeded
80 Halted 0 ms 0 KB -