oj.uz

Submission #547067

# Submission time Handle Problem Language Result Execution time Memory
547067 2022-04-09T11:39:13 Z leaked Food Court (JOI21_foodcourt) C++14
68 / 100
 1000 ms 64524 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_prep ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//#define int long long
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
const int N=250'000+1;
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
struct fenwick{
    ll fnw[N];
    fenwick(){
        fill(fnw,fnw+N,0);
    }
    void reset(){
        fill(fnw,fnw+N,0);
    }
    void upd(int i,int x){
        ++i;
        while(i<N){
            fnw[i]+=x;
            i+=i&-i;
        }
    }
    ll get(int i){
        ++i;
        ll ans=0;
        while(i>0){
            ans+=fnw[i];
            i-=i&-i;
        }
        return ans;
    }
    void add(int l,int r,ll x){
        upd(l,x);
        upd(r+1,-x);
    }
};

struct segtree{
    ll p1[4*N],p2[4*N];
    int p3[4*N];
    ll mx[4*N],mn[4*N];
    segtree(){
        fill(mx,mx+4*N,0);
        fill(mn,mn+4*N,0);
        fill(p1,p1+4*N,0);
        fill(p2,p2+4*N,0);
        fill(p3,p3+4*N,-1);
    }
    void push(int v,int tl,int tr){
        if(p2[v]!=-1){
//            assert(p1[v]==0);
            for(auto &u : {v<<1,v<<1|1}){
                p2[u]=p2[v];
                mx[u]=mn[u]=p2[v];
                umax(p3[u],p3[v]);
                p1[u]=0;
            }
            p2[v]=-1;
        }
        else{
            for(auto &u : {v<<1,v<<1|1}){
                if(p2[u]!=-1) p2[u]+=p1[v];
                else p1[u]+=p1[v];
                mx[u]+=p1[v];mn[u]+=p1[v];
            }
            p1[v]=0;
        }
    }
    void add(int l,int r,int x,int t,int v,int tl,int tr){
        if(tl>r||tr<l) return;
        if(tl>=l&&tr<=r&&((mx[v]+x)<=0)==((mn[v]+x)<=0)){
            if((mx[v]+x)<=0){
                p1[v]=0;
                umax(p3[v],t);
                p2[v]=mx[v]=mn[v]=0;
                return;
            }
            if((p2[v]!=-1)) p2[v]+=x;
            else p1[v]+=x;
            mx[v]+=x;mn[v]+=x;
            return;
        }
        int tm=(tl+tr)>>1;push(v,tl,tr);
        add(l,r,x,t,v<<1,tl,tm);add(l,r,x,t,v<<1|1,tm+1,tr);
        mx[v]=max(mx[v<<1],mx[v<<1|1]);
        mn[v]=min(mn[v<<1],mn[v<<1|1]);
    }
    int get(int i,int v,int tl,int tr){
        if(tl==tr)
            return p3[v];
        int tm=(tl+tr)>>1;push(v,tl,tr);
        if(tm>=i)
            return get(i,v<<1,tl,tm);
        else
            return get(i,v<<1|1,tm+1,tr);
    }
}sega;
signed main(){
    fast_prep;
    int n,m,q;
    cin>>n>>m>>q;
    fenwick fen;
    vec<int> tl(q),tr(q);
    vec<int> t(q),l(q),r(q),c(q);
    vec<ll> k(q);
    vec<int> ask;
    vec<ll> rl(q);

    vec<ll> toadd(q);
    vec<vec<int>> need(q,vec<int>());
    for(int i=0;i<q;i++){
        cin>>t[i];
        if(t[i]==1){
            cin>>l[i]>>r[i]>>c[i]>>k[i];
            --l[i];--r[i];
            sega.add(l[i],r[i],k[i],i,1,0,n-1);
        }
        else if(t[i]==2){
            cin>>l[i]>>r[i]>>k[i];
            --l[i];--r[i];
            fen.add(l[i],r[i],k[i]);
            sega.add(l[i],r[i],-k[i],i,1,0,n-1);
        }
        else{
            ask.pb(i);
            cin>>l[i]>>k[i];
            --l[i];
            rl[i]=fen.get(l[i])+k[i];
//            cerr<<"WO "<<sega.get(l[i],1,0,n-1);
            tl[i]=sega.get(l[i],1,0,n-1)+1;tr[i]=i;
            if(tl[i]!=0) need[tl[i]-1].pb(i);
        }
    }
    {
        fen.reset();
        for(int i=0;i<q;i++){
            if(t[i]==1) fen.add(l[i],r[i],k[i]);
            else if(t[i]==2) fen.add(l[i],r[i],-k[i]);
            for(auto &j : need[i]){
                toadd[j]=-fen.get(l[j]);
            }
        }
    }
    int ok=1;
    while(ok){
        ok=0;
        fen.reset();
        vec<vec<int>> toask(q,vec<int>());
        ///just an id
        for(auto &i : ask){
            if(tl[i]!=tr[i]){
                int tm=(tl[i]+tr[i])>>1;
//                cout<<"HEYASK "<<i<<' '<<tl[i]<<' '<<tr[i]<<' '<<tm<<endl;
                ok=1;
                toask[tm].pb(i);
            }
        }
        if(!ok) break;
        for(int i=0;i<q;i++){
            if(t[i]==1){
                fen.add(l[i],r[i],k[i]);
            }
//            cout<<"I "<<i<<endl;
            for(auto &j : toask[i]){
                ll have=fen.get(l[j])+toadd[j];
//                cout<<"YO "<<c[i]<<' '<<j<<' '<<have<<' '<<rl[j]<<endl;
                if(have>=rl[j]){
                    tr[j]=i;
                }
                else{
                    tl[j]=i+1;
                }
            }
        }
    }
    for(auto &i : ask){
        cout<<(tl[i]==i?0:c[tl[i]])<<'\n';
    }
    return 0;
}
/*
3 5 5
1 2 3 5 2
1 1 2 2 4
2 1 3 3
1 2 3 4 2
3 3 2

3 5 5
1 2 3 5 2
1 1 2 2 4
2 1 3 3
3 1 2
1 2 3 4 2

*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 37588 KB Output is correct
2 Correct 19 ms 37716 KB Output is correct
3 Correct 18 ms 37600 KB Output is correct
4 Correct 18 ms 37680 KB Output is correct
5 Correct 18 ms 37664 KB Output is correct
6 Correct 18 ms 37588 KB Output is correct
7 Correct 18 ms 37672 KB Output is correct
8 Correct 17 ms 37716 KB Output is correct
9 Correct 19 ms 37716 KB Output is correct
10 Correct 21 ms 37704 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 18 ms 37644 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 19 ms 37644 KB Output is correct
15 Correct 22 ms 37556 KB Output is correct
16 Correct 20 ms 37648 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 19 ms 37644 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 37588 KB Output is correct
2 Correct 19 ms 37716 KB Output is correct
3 Correct 18 ms 37600 KB Output is correct
4 Correct 18 ms 37680 KB Output is correct
5 Correct 18 ms 37664 KB Output is correct
6 Correct 18 ms 37588 KB Output is correct
7 Correct 18 ms 37672 KB Output is correct
8 Correct 17 ms 37716 KB Output is correct
9 Correct 19 ms 37716 KB Output is correct
10 Correct 21 ms 37704 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 18 ms 37644 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 19 ms 37644 KB Output is correct
15 Correct 22 ms 37556 KB Output is correct
16 Correct 20 ms 37648 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 19 ms 37644 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 18 ms 37588 KB Output is correct
22 Correct 20 ms 37656 KB Output is correct
23 Correct 20 ms 37624 KB Output is correct
24 Correct 20 ms 37680 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37576 KB Output is correct
27 Correct 19 ms 37640 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37676 KB Output is correct
30 Correct 18 ms 37588 KB Output is correct
31 Correct 18 ms 37644 KB Output is correct
32 Correct 21 ms 37608 KB Output is correct
33 Correct 18 ms 37656 KB Output is correct
34 Correct 17 ms 37716 KB Output is correct
35 Correct 18 ms 37580 KB Output is correct
36 Correct 18 ms 37588 KB Output is correct
37 Correct 19 ms 37564 KB Output is correct
38 Correct 21 ms 37636 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 44536 KB Output is correct
2 Correct 131 ms 44332 KB Output is correct
3 Correct 107 ms 44516 KB Output is correct
4 Correct 103 ms 44548 KB Output is correct
5 Correct 116 ms 44372 KB Output is correct
6 Correct 139 ms 44292 KB Output is correct
7 Correct 51 ms 43880 KB Output is correct
8 Correct 50 ms 44108 KB Output is correct
9 Correct 106 ms 44280 KB Output is correct
10 Correct 120 ms 44288 KB Output is correct
11 Correct 122 ms 44248 KB Output is correct
12 Correct 127 ms 44240 KB Output is correct
13 Correct 107 ms 43856 KB Output is correct
14 Correct 134 ms 44444 KB Output is correct
15 Correct 137 ms 43940 KB Output is correct
16 Correct 154 ms 44008 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 775 ms 61956 KB Output is correct
2 Correct 603 ms 57012 KB Output is correct
3 Correct 912 ms 64036 KB Output is correct
4 Correct 578 ms 56012 KB Output is correct
5 Correct 570 ms 56604 KB Output is correct
6 Correct 930 ms 63236 KB Output is correct
7 Correct 452 ms 64368 KB Output is correct
8 Correct 414 ms 64176 KB Output is correct
9 Execution timed out 1068 ms 64524 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 37588 KB Output is correct
2 Correct 19 ms 37716 KB Output is correct
3 Correct 18 ms 37600 KB Output is correct
4 Correct 18 ms 37680 KB Output is correct
5 Correct 18 ms 37664 KB Output is correct
6 Correct 18 ms 37588 KB Output is correct
7 Correct 18 ms 37672 KB Output is correct
8 Correct 17 ms 37716 KB Output is correct
9 Correct 19 ms 37716 KB Output is correct
10 Correct 21 ms 37704 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 18 ms 37644 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 19 ms 37644 KB Output is correct
15 Correct 22 ms 37556 KB Output is correct
16 Correct 20 ms 37648 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 19 ms 37644 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 118 ms 44536 KB Output is correct
22 Correct 131 ms 44332 KB Output is correct
23 Correct 107 ms 44516 KB Output is correct
24 Correct 103 ms 44548 KB Output is correct
25 Correct 116 ms 44372 KB Output is correct
26 Correct 139 ms 44292 KB Output is correct
27 Correct 51 ms 43880 KB Output is correct
28 Correct 50 ms 44108 KB Output is correct
29 Correct 106 ms 44280 KB Output is correct
30 Correct 120 ms 44288 KB Output is correct
31 Correct 122 ms 44248 KB Output is correct
32 Correct 127 ms 44240 KB Output is correct
33 Correct 107 ms 43856 KB Output is correct
34 Correct 134 ms 44444 KB Output is correct
35 Correct 137 ms 43940 KB Output is correct
36 Correct 154 ms 44008 KB Output is correct
37 Correct 186 ms 43716 KB Output is correct
38 Correct 162 ms 42780 KB Output is correct
39 Correct 91 ms 42988 KB Output is correct
40 Correct 109 ms 43756 KB Output is correct
41 Correct 167 ms 44132 KB Output is correct
42 Correct 171 ms 44180 KB Output is correct
43 Correct 179 ms 44216 KB Output is correct
44 Correct 183 ms 44184 KB Output is correct
45 Correct 183 ms 44224 KB Output is correct
46 Correct 173 ms 44304 KB Output is correct
47 Correct 115 ms 44620 KB Output is correct
48 Correct 155 ms 44500 KB Output is correct
49 Correct 139 ms 42172 KB Output is correct
50 Correct 171 ms 43160 KB Output is correct
51 Correct 200 ms 44200 KB Output is correct
52 Correct 204 ms 44184 KB Output is correct
53 Correct 120 ms 42560 KB Output is correct
54 Correct 138 ms 43988 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 43816 KB Output is correct
2 Correct 183 ms 44568 KB Output is correct
3 Correct 216 ms 44596 KB Output is correct
4 Correct 143 ms 42500 KB Output is correct
5 Correct 179 ms 43712 KB Output is correct
6 Correct 201 ms 44708 KB Output is correct
7 Correct 123 ms 43900 KB Output is correct
8 Correct 131 ms 43492 KB Output is correct
9 Correct 149 ms 44660 KB Output is correct
10 Correct 124 ms 42388 KB Output is correct
11 Correct 186 ms 44668 KB Output is correct
12 Correct 196 ms 44676 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 37588 KB Output is correct
2 Correct 19 ms 37716 KB Output is correct
3 Correct 18 ms 37600 KB Output is correct
4 Correct 18 ms 37680 KB Output is correct
5 Correct 18 ms 37664 KB Output is correct
6 Correct 18 ms 37588 KB Output is correct
7 Correct 18 ms 37672 KB Output is correct
8 Correct 17 ms 37716 KB Output is correct
9 Correct 19 ms 37716 KB Output is correct
10 Correct 21 ms 37704 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 18 ms 37644 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 19 ms 37644 KB Output is correct
15 Correct 22 ms 37556 KB Output is correct
16 Correct 20 ms 37648 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 19 ms 37644 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 18 ms 37588 KB Output is correct
22 Correct 20 ms 37656 KB Output is correct
23 Correct 20 ms 37624 KB Output is correct
24 Correct 20 ms 37680 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37576 KB Output is correct
27 Correct 19 ms 37640 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37676 KB Output is correct
30 Correct 18 ms 37588 KB Output is correct
31 Correct 18 ms 37644 KB Output is correct
32 Correct 21 ms 37608 KB Output is correct
33 Correct 18 ms 37656 KB Output is correct
34 Correct 17 ms 37716 KB Output is correct
35 Correct 18 ms 37580 KB Output is correct
36 Correct 18 ms 37588 KB Output is correct
37 Correct 19 ms 37564 KB Output is correct
38 Correct 21 ms 37636 KB Output is correct
39 Correct 118 ms 44536 KB Output is correct
40 Correct 131 ms 44332 KB Output is correct
41 Correct 107 ms 44516 KB Output is correct
42 Correct 103 ms 44548 KB Output is correct
43 Correct 116 ms 44372 KB Output is correct
44 Correct 139 ms 44292 KB Output is correct
45 Correct 51 ms 43880 KB Output is correct
46 Correct 50 ms 44108 KB Output is correct
47 Correct 106 ms 44280 KB Output is correct
48 Correct 120 ms 44288 KB Output is correct
49 Correct 122 ms 44248 KB Output is correct
50 Correct 127 ms 44240 KB Output is correct
51 Correct 107 ms 43856 KB Output is correct
52 Correct 134 ms 44444 KB Output is correct
53 Correct 137 ms 43940 KB Output is correct
54 Correct 154 ms 44008 KB Output is correct
55 Correct 186 ms 43716 KB Output is correct
56 Correct 162 ms 42780 KB Output is correct
57 Correct 91 ms 42988 KB Output is correct
58 Correct 109 ms 43756 KB Output is correct
59 Correct 167 ms 44132 KB Output is correct
60 Correct 171 ms 44180 KB Output is correct
61 Correct 179 ms 44216 KB Output is correct
62 Correct 183 ms 44184 KB Output is correct
63 Correct 183 ms 44224 KB Output is correct
64 Correct 173 ms 44304 KB Output is correct
65 Correct 115 ms 44620 KB Output is correct
66 Correct 155 ms 44500 KB Output is correct
67 Correct 139 ms 42172 KB Output is correct
68 Correct 171 ms 43160 KB Output is correct
69 Correct 200 ms 44200 KB Output is correct
70 Correct 204 ms 44184 KB Output is correct
71 Correct 120 ms 42560 KB Output is correct
72 Correct 138 ms 43988 KB Output is correct
73 Correct 171 ms 43816 KB Output is correct
74 Correct 183 ms 44568 KB Output is correct
75 Correct 216 ms 44596 KB Output is correct
76 Correct 143 ms 42500 KB Output is correct
77 Correct 179 ms 43712 KB Output is correct
78 Correct 201 ms 44708 KB Output is correct
79 Correct 123 ms 43900 KB Output is correct
80 Correct 131 ms 43492 KB Output is correct
81 Correct 149 ms 44660 KB Output is correct
82 Correct 124 ms 42388 KB Output is correct
83 Correct 186 ms 44668 KB Output is correct
84 Correct 196 ms 44676 KB Output is correct
85 Correct 154 ms 43780 KB Output is correct
86 Correct 165 ms 44544 KB Output is correct
87 Correct 146 ms 43280 KB Output is correct
88 Correct 184 ms 44172 KB Output is correct
89 Correct 113 ms 41980 KB Output is correct
90 Correct 175 ms 44276 KB Output is correct
91 Correct 133 ms 43100 KB Output is correct
92 Correct 137 ms 42768 KB Output is correct
93 Correct 196 ms 44320 KB Output is correct
94 Correct 182 ms 44220 KB Output is correct
95 Correct 162 ms 44136 KB Output is correct
96 Correct 157 ms 44228 KB Output is correct
97 Correct 185 ms 44224 KB Output is correct
98 Correct 151 ms 43352 KB Output is correct
99 Correct 116 ms 44572 KB Output is correct
100 Correct 129 ms 43440 KB Output is correct
101 Correct 144 ms 44548 KB Output is correct
102 Correct 567 ms 43988 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 37588 KB Output is correct
2 Correct 19 ms 37716 KB Output is correct
3 Correct 18 ms 37600 KB Output is correct
4 Correct 18 ms 37680 KB Output is correct
5 Correct 18 ms 37664 KB Output is correct
6 Correct 18 ms 37588 KB Output is correct
7 Correct 18 ms 37672 KB Output is correct
8 Correct 17 ms 37716 KB Output is correct
9 Correct 19 ms 37716 KB Output is correct
10 Correct 21 ms 37704 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 18 ms 37644 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 19 ms 37644 KB Output is correct
15 Correct 22 ms 37556 KB Output is correct
16 Correct 20 ms 37648 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 19 ms 37644 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 18 ms 37588 KB Output is correct
22 Correct 20 ms 37656 KB Output is correct
23 Correct 20 ms 37624 KB Output is correct
24 Correct 20 ms 37680 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37576 KB Output is correct
27 Correct 19 ms 37640 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37676 KB Output is correct
30 Correct 18 ms 37588 KB Output is correct
31 Correct 18 ms 37644 KB Output is correct
32 Correct 21 ms 37608 KB Output is correct
33 Correct 18 ms 37656 KB Output is correct
34 Correct 17 ms 37716 KB Output is correct
35 Correct 18 ms 37580 KB Output is correct
36 Correct 18 ms 37588 KB Output is correct
37 Correct 19 ms 37564 KB Output is correct
38 Correct 21 ms 37636 KB Output is correct
39 Correct 118 ms 44536 KB Output is correct
40 Correct 131 ms 44332 KB Output is correct
41 Correct 107 ms 44516 KB Output is correct
42 Correct 103 ms 44548 KB Output is correct
43 Correct 116 ms 44372 KB Output is correct
44 Correct 139 ms 44292 KB Output is correct
45 Correct 51 ms 43880 KB Output is correct
46 Correct 50 ms 44108 KB Output is correct
47 Correct 106 ms 44280 KB Output is correct
48 Correct 120 ms 44288 KB Output is correct
49 Correct 122 ms 44248 KB Output is correct
50 Correct 127 ms 44240 KB Output is correct
51 Correct 107 ms 43856 KB Output is correct
52 Correct 134 ms 44444 KB Output is correct
53 Correct 137 ms 43940 KB Output is correct
54 Correct 154 ms 44008 KB Output is correct
55 Correct 775 ms 61956 KB Output is correct
56 Correct 603 ms 57012 KB Output is correct
57 Correct 912 ms 64036 KB Output is correct
58 Correct 578 ms 56012 KB Output is correct
59 Correct 570 ms 56604 KB Output is correct
60 Correct 930 ms 63236 KB Output is correct
61 Correct 452 ms 64368 KB Output is correct
62 Correct 414 ms 64176 KB Output is correct
63 Execution timed out 1068 ms 64524 KB Time limit exceeded
64 Halted 0 ms 0 KB -