oj.uz

답안 #547064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547064 2022-04-09T11:32:45 Z leaked 푸드 코트 (JOI21_foodcourt) C++14
24 / 100
 184 ms 62724 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);

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 : {2*v,2*v+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 : {2*v,2*v+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)){
//            cout<<"TL "<<tl<<' '<<tr<<' '<<mx[v]+x<<' '<<mn[v]+x<<endl;
            if((mx[v]+x)<=0){
                p1[v]=0;
                umax(p3[v],t);
                p2[v]=mx[v]=mn[v]=0;
//                cout<<"WAY "<<v<<' '<<tl<<' '<<tr<<endl;
                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,2*v,tl,tm);add(l,r,x,t,2*v+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),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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37588 KB Output is correct
2 Correct 19 ms 37608 KB Output is correct
3 Correct 18 ms 37616 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 16 ms 37648 KB Output is correct
6 Correct 18 ms 37604 KB Output is correct
7 Correct 19 ms 37612 KB Output is correct
8 Correct 18 ms 37672 KB Output is correct
9 Correct 17 ms 37692 KB Output is correct
10 Correct 18 ms 37668 KB Output is correct
11 Correct 18 ms 37736 KB Output is correct
12 Correct 19 ms 37668 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 17 ms 37716 KB Output is correct
15 Correct 19 ms 37580 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 18 ms 37640 KB Output is correct
18 Correct 18 ms 37704 KB Output is correct
19 Correct 17 ms 37660 KB Output is correct
20 Correct 19 ms 37720 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37588 KB Output is correct
2 Correct 19 ms 37608 KB Output is correct
3 Correct 18 ms 37616 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 16 ms 37648 KB Output is correct
6 Correct 18 ms 37604 KB Output is correct
7 Correct 19 ms 37612 KB Output is correct
8 Correct 18 ms 37672 KB Output is correct
9 Correct 17 ms 37692 KB Output is correct
10 Correct 18 ms 37668 KB Output is correct
11 Correct 18 ms 37736 KB Output is correct
12 Correct 19 ms 37668 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 17 ms 37716 KB Output is correct
15 Correct 19 ms 37580 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 18 ms 37640 KB Output is correct
18 Correct 18 ms 37704 KB Output is correct
19 Correct 17 ms 37660 KB Output is correct
20 Correct 19 ms 37720 KB Output is correct
21 Incorrect 17 ms 37716 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 45428 KB Output is correct
2 Correct 128 ms 45280 KB Output is correct
3 Correct 110 ms 45480 KB Output is correct
4 Correct 122 ms 45400 KB Output is correct
5 Correct 119 ms 45440 KB Output is correct
6 Correct 122 ms 45284 KB Output is correct
7 Correct 54 ms 44364 KB Output is correct
8 Correct 53 ms 44564 KB Output is correct
9 Correct 130 ms 45204 KB Output is correct
10 Correct 113 ms 45272 KB Output is correct
11 Correct 108 ms 45324 KB Output is correct
12 Correct 110 ms 45252 KB Output is correct
13 Correct 107 ms 44520 KB Output is correct
14 Correct 121 ms 45332 KB Output is correct
15 Correct 125 ms 45008 KB Output is correct
16 Correct 128 ms 45156 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 62724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37588 KB Output is correct
2 Correct 19 ms 37608 KB Output is correct
3 Correct 18 ms 37616 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 16 ms 37648 KB Output is correct
6 Correct 18 ms 37604 KB Output is correct
7 Correct 19 ms 37612 KB Output is correct
8 Correct 18 ms 37672 KB Output is correct
9 Correct 17 ms 37692 KB Output is correct
10 Correct 18 ms 37668 KB Output is correct
11 Correct 18 ms 37736 KB Output is correct
12 Correct 19 ms 37668 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 17 ms 37716 KB Output is correct
15 Correct 19 ms 37580 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 18 ms 37640 KB Output is correct
18 Correct 18 ms 37704 KB Output is correct
19 Correct 17 ms 37660 KB Output is correct
20 Correct 19 ms 37720 KB Output is correct
21 Correct 115 ms 45428 KB Output is correct
22 Correct 128 ms 45280 KB Output is correct
23 Correct 110 ms 45480 KB Output is correct
24 Correct 122 ms 45400 KB Output is correct
25 Correct 119 ms 45440 KB Output is correct
26 Correct 122 ms 45284 KB Output is correct
27 Correct 54 ms 44364 KB Output is correct
28 Correct 53 ms 44564 KB Output is correct
29 Correct 130 ms 45204 KB Output is correct
30 Correct 113 ms 45272 KB Output is correct
31 Correct 108 ms 45324 KB Output is correct
32 Correct 110 ms 45252 KB Output is correct
33 Correct 107 ms 44520 KB Output is correct
34 Correct 121 ms 45332 KB Output is correct
35 Correct 125 ms 45008 KB Output is correct
36 Correct 128 ms 45156 KB Output is correct
37 Correct 136 ms 44392 KB Output is correct
38 Correct 119 ms 43552 KB Output is correct
39 Correct 75 ms 43336 KB Output is correct
40 Correct 93 ms 44132 KB Output is correct
41 Correct 136 ms 44980 KB Output is correct
42 Correct 143 ms 45016 KB Output is correct
43 Correct 149 ms 45048 KB Output is correct
44 Correct 160 ms 45104 KB Output is correct
45 Correct 164 ms 45096 KB Output is correct
46 Correct 156 ms 45108 KB Output is correct
47 Correct 95 ms 45136 KB Output is correct
48 Correct 128 ms 45212 KB Output is correct
49 Correct 129 ms 42800 KB Output is correct
50 Correct 163 ms 43892 KB Output is correct
51 Correct 173 ms 44984 KB Output is correct
52 Correct 184 ms 45016 KB Output is correct
53 Correct 105 ms 43496 KB Output is correct
54 Correct 130 ms 44956 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 49 ms 43856 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37588 KB Output is correct
2 Correct 19 ms 37608 KB Output is correct
3 Correct 18 ms 37616 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 16 ms 37648 KB Output is correct
6 Correct 18 ms 37604 KB Output is correct
7 Correct 19 ms 37612 KB Output is correct
8 Correct 18 ms 37672 KB Output is correct
9 Correct 17 ms 37692 KB Output is correct
10 Correct 18 ms 37668 KB Output is correct
11 Correct 18 ms 37736 KB Output is correct
12 Correct 19 ms 37668 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 17 ms 37716 KB Output is correct
15 Correct 19 ms 37580 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 18 ms 37640 KB Output is correct
18 Correct 18 ms 37704 KB Output is correct
19 Correct 17 ms 37660 KB Output is correct
20 Correct 19 ms 37720 KB Output is correct
21 Incorrect 17 ms 37716 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37588 KB Output is correct
2 Correct 19 ms 37608 KB Output is correct
3 Correct 18 ms 37616 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 16 ms 37648 KB Output is correct
6 Correct 18 ms 37604 KB Output is correct
7 Correct 19 ms 37612 KB Output is correct
8 Correct 18 ms 37672 KB Output is correct
9 Correct 17 ms 37692 KB Output is correct
10 Correct 18 ms 37668 KB Output is correct
11 Correct 18 ms 37736 KB Output is correct
12 Correct 19 ms 37668 KB Output is correct
13 Correct 18 ms 37588 KB Output is correct
14 Correct 17 ms 37716 KB Output is correct
15 Correct 19 ms 37580 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 18 ms 37640 KB Output is correct
18 Correct 18 ms 37704 KB Output is correct
19 Correct 17 ms 37660 KB Output is correct
20 Correct 19 ms 37720 KB Output is correct
21 Incorrect 17 ms 37716 KB Output isn't correct
22 Halted 0 ms 0 KB -