oj.uz

답안 #905261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
905261 2024-01-12T21:37:47 Z alexander707070 푸드 코트 (JOI21_foodcourt) C++14
20 / 100
 1000 ms 127392 KB 
#include<bits/stdc++.h>
#define MAXN 500007
using namespace std;

struct event{
    int c,tim;
    long long k;
};

const long long inf=1e17;

int n,m,q,type,l,r;
long long s,t;

long long minsz[4*MAXN],lazy[4*MAXN],maxsz[4*MAXN];
int c[MAXN];

vector< event > tree[4*MAXN];
vector<long long> pref[4*MAXN];

void update(int v,int l,int r,int ll,int rr,event news){
    if(ll>rr)return;
    if(l==ll and r==rr){
        tree[v].push_back(news);

        if(pref[v].empty())pref[v].push_back(news.k);
        else pref[v].push_back(pref[v].back()+news.k);

        return;
    }else{
        int tt=(l+r)/2;
        update(2*v,l,tt,ll,min(tt,rr),news);
        update(2*v+1,tt+1,r,max(tt+1,ll),rr,news);
    }
}

void psh(int v){
    minsz[2*v]+=lazy[v];
    maxsz[2*v]+=lazy[v];

    minsz[2*v]=max(minsz[2*v],0LL);
    maxsz[2*v]=max(maxsz[2*v],0LL);

    minsz[2*v+1]+=lazy[v];
    maxsz[2*v+1]+=lazy[v];

    minsz[2*v+1]=max(minsz[2*v+1],0LL);
    maxsz[2*v+1]=max(maxsz[2*v+1],0LL);

    lazy[2*v]+=lazy[v];
    lazy[2*v+1]+=lazy[v];

    lazy[v]=0;
}

void add(int v,int l,int r,int ll,int rr,long long val){
    if(ll>rr)return;

    if(l==ll and r==rr){

        minsz[v]+=val;
        maxsz[v]+=val;

        lazy[v]+=val;
    }else{
        psh(v);
        int tt=(l+r)/2;
        add(2*v,l,tt,ll,min(tt,rr),val);
        add(2*v+1,tt+1,r,max(tt+1,ll),rr,val);

        minsz[v]=min(minsz[2*v],minsz[2*v+1]);
        maxsz[v]=max(maxsz[2*v],maxsz[2*v+1]);
    }
}

void rem(int v,int l,int r,int ll,int rr,long long val){
    if(ll>rr)return;

    if(l==ll and r==rr and minsz[v]>=val){
        maxsz[v]-=val;
        minsz[v]-=val;
        lazy[v]-=val;
        return;
    }

    if(l==r){
        minsz[v]=max(minsz[v]-val,0LL);
        maxsz[v]=max(maxsz[v]-val,0LL);     
    }else{

        psh(v);
        int tt=(l+r)/2;
        rem(2*v,l,tt,ll,min(tt,rr),val);
        rem(2*v+1,tt+1,r,max(tt+1,ll),rr,val);

        minsz[v]=min(minsz[2*v],minsz[2*v+1]);
        maxsz[v]=max(maxsz[2*v],maxsz[2*v+1]);
    }
}

long long getsz(int v,int l,int r,int pos){
    if(l==r)return minsz[v];

    psh(v);
    int tt=(l+r)/2;

    if(pos<=tt)return getsz(2*v,l,tt,pos);
    else return getsz(2*v+1,tt+1,r,pos);
}

long long calc(int v,int qr){
    if(tree[v].empty())return 0;

    int l=-1,r=tree[v].size(),tt;

    while(l+1<r){
        tt=(l+r)/2;
        if(tree[v][tt].tim>=qr){
            r=tt;
        }else{
            l=tt;
        }
    }

    if(r>0)return pref[v].back()-pref[v][r-1];
    return pref[v].back();
}

long long howmany(int v,int l,int r,int pos,int qr){
    if(l==r){
        return calc(v,qr);
    }else{
        int tt=(l+r)/2;
        if(pos<=tt)return howmany(2*v,l,tt,pos,qr) + calc(v,qr);
        else return howmany(2*v+1,tt+1,r,pos,qr) + calc(v,qr);
    }
}

int bin(int s,long long t){
    int l=0,r=q+1,tt;
    while(l+1<r){
        tt=(l+r)/2;
        if(howmany(1,1,n,s,tt)>=t){
            l=tt;
        }else{
            r=tt;
        }
    }

    return c[l];
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin>>n>>m>>q;
    
    for(int i=1;i<=q;i++){
        cin>>type;
        if(type==1){
            cin>>l>>r>>s>>t;
            c[i]=s;

            add(1,1,n,l,r,t);
            update(1,1,n,l,r,{s,i,t});
        }else if(type==2){
            cin>>l>>r>>s;
            rem(1,1,n,l,r,s);
        }else{
            cin>>s>>t;
            if(getsz(1,1,n,s)<t)cout<<"0\n";
            else cout<<bin(s,getsz(1,1,n,s)-t+1)<<"\n";
        }
    }

    return 0;
}

Compilation message

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:168:31: warning: narrowing conversion of 's' from 'long long int' to 'int' [-Wnarrowing]
  168 |             update(1,1,n,l,r,{s,i,t});
      |                               ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 95064 KB Output is correct
2 Correct 31 ms 95224 KB Output is correct
3 Correct 30 ms 95324 KB Output is correct
4 Correct 33 ms 95316 KB Output is correct
5 Correct 30 ms 97104 KB Output is correct
6 Correct 31 ms 95068 KB Output is correct
7 Correct 33 ms 95432 KB Output is correct
8 Correct 35 ms 95252 KB Output is correct
9 Correct 31 ms 95324 KB Output is correct
10 Correct 34 ms 95324 KB Output is correct
11 Correct 34 ms 95240 KB Output is correct
12 Correct 33 ms 95324 KB Output is correct
13 Correct 30 ms 95064 KB Output is correct
14 Correct 29 ms 95316 KB Output is correct
15 Correct 32 ms 95576 KB Output is correct
16 Correct 33 ms 95320 KB Output is correct
17 Correct 34 ms 95320 KB Output is correct
18 Correct 32 ms 95452 KB Output is correct
19 Correct 30 ms 95324 KB Output is correct
20 Correct 31 ms 95324 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 95064 KB Output is correct
2 Correct 31 ms 95224 KB Output is correct
3 Correct 30 ms 95324 KB Output is correct
4 Correct 33 ms 95316 KB Output is correct
5 Correct 30 ms 97104 KB Output is correct
6 Correct 31 ms 95068 KB Output is correct
7 Correct 33 ms 95432 KB Output is correct
8 Correct 35 ms 95252 KB Output is correct
9 Correct 31 ms 95324 KB Output is correct
10 Correct 34 ms 95324 KB Output is correct
11 Correct 34 ms 95240 KB Output is correct
12 Correct 33 ms 95324 KB Output is correct
13 Correct 30 ms 95064 KB Output is correct
14 Correct 29 ms 95316 KB Output is correct
15 Correct 32 ms 95576 KB Output is correct
16 Correct 33 ms 95320 KB Output is correct
17 Correct 34 ms 95320 KB Output is correct
18 Correct 32 ms 95452 KB Output is correct
19 Correct 30 ms 95324 KB Output is correct
20 Correct 31 ms 95324 KB Output is correct
21 Correct 31 ms 95360 KB Output is correct
22 Correct 34 ms 95196 KB Output is correct
23 Correct 32 ms 95388 KB Output is correct
24 Correct 31 ms 95324 KB Output is correct
25 Correct 30 ms 99164 KB Output is correct
26 Correct 31 ms 101104 KB Output is correct
27 Correct 32 ms 95324 KB Output is correct
28 Correct 35 ms 95452 KB Output is correct
29 Correct 33 ms 95224 KB Output is correct
30 Correct 32 ms 95216 KB Output is correct
31 Correct 34 ms 95312 KB Output is correct
32 Correct 34 ms 95320 KB Output is correct
33 Correct 32 ms 95152 KB Output is correct
34 Correct 33 ms 94980 KB Output is correct
35 Correct 32 ms 95504 KB Output is correct
36 Correct 36 ms 95440 KB Output is correct
37 Correct 30 ms 95060 KB Output is correct
38 Correct 31 ms 95320 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1012 ms 98892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1046 ms 127392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 95064 KB Output is correct
2 Correct 31 ms 95224 KB Output is correct
3 Correct 30 ms 95324 KB Output is correct
4 Correct 33 ms 95316 KB Output is correct
5 Correct 30 ms 97104 KB Output is correct
6 Correct 31 ms 95068 KB Output is correct
7 Correct 33 ms 95432 KB Output is correct
8 Correct 35 ms 95252 KB Output is correct
9 Correct 31 ms 95324 KB Output is correct
10 Correct 34 ms 95324 KB Output is correct
11 Correct 34 ms 95240 KB Output is correct
12 Correct 33 ms 95324 KB Output is correct
13 Correct 30 ms 95064 KB Output is correct
14 Correct 29 ms 95316 KB Output is correct
15 Correct 32 ms 95576 KB Output is correct
16 Correct 33 ms 95320 KB Output is correct
17 Correct 34 ms 95320 KB Output is correct
18 Correct 32 ms 95452 KB Output is correct
19 Correct 30 ms 95324 KB Output is correct
20 Correct 31 ms 95324 KB Output is correct
21 Execution timed out 1012 ms 98892 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 278 ms 112540 KB Output is correct
2 Correct 351 ms 113496 KB Output is correct
3 Correct 352 ms 114124 KB Output is correct
4 Correct 233 ms 110464 KB Output is correct
5 Correct 262 ms 112704 KB Output is correct
6 Correct 323 ms 115164 KB Output is correct
7 Correct 69 ms 102224 KB Output is correct
8 Correct 80 ms 96004 KB Output is correct
9 Correct 132 ms 103436 KB Output is correct
10 Correct 141 ms 110724 KB Output is correct
11 Correct 184 ms 116496 KB Output is correct
12 Correct 179 ms 116484 KB Output is correct

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 95064 KB Output is correct
2 Correct 31 ms 95224 KB Output is correct
3 Correct 30 ms 95324 KB Output is correct
4 Correct 33 ms 95316 KB Output is correct
5 Correct 30 ms 97104 KB Output is correct
6 Correct 31 ms 95068 KB Output is correct
7 Correct 33 ms 95432 KB Output is correct
8 Correct 35 ms 95252 KB Output is correct
9 Correct 31 ms 95324 KB Output is correct
10 Correct 34 ms 95324 KB Output is correct
11 Correct 34 ms 95240 KB Output is correct
12 Correct 33 ms 95324 KB Output is correct
13 Correct 30 ms 95064 KB Output is correct
14 Correct 29 ms 95316 KB Output is correct
15 Correct 32 ms 95576 KB Output is correct
16 Correct 33 ms 95320 KB Output is correct
17 Correct 34 ms 95320 KB Output is correct
18 Correct 32 ms 95452 KB Output is correct
19 Correct 30 ms 95324 KB Output is correct
20 Correct 31 ms 95324 KB Output is correct
21 Correct 31 ms 95360 KB Output is correct
22 Correct 34 ms 95196 KB Output is correct
23 Correct 32 ms 95388 KB Output is correct
24 Correct 31 ms 95324 KB Output is correct
25 Correct 30 ms 99164 KB Output is correct
26 Correct 31 ms 101104 KB Output is correct
27 Correct 32 ms 95324 KB Output is correct
28 Correct 35 ms 95452 KB Output is correct
29 Correct 33 ms 95224 KB Output is correct
30 Correct 32 ms 95216 KB Output is correct
31 Correct 34 ms 95312 KB Output is correct
32 Correct 34 ms 95320 KB Output is correct
33 Correct 32 ms 95152 KB Output is correct
34 Correct 33 ms 94980 KB Output is correct
35 Correct 32 ms 95504 KB Output is correct
36 Correct 36 ms 95440 KB Output is correct
37 Correct 30 ms 95060 KB Output is correct
38 Correct 31 ms 95320 KB Output is correct
39 Execution timed out 1012 ms 98892 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 95064 KB Output is correct
2 Correct 31 ms 95224 KB Output is correct
3 Correct 30 ms 95324 KB Output is correct
4 Correct 33 ms 95316 KB Output is correct
5 Correct 30 ms 97104 KB Output is correct
6 Correct 31 ms 95068 KB Output is correct
7 Correct 33 ms 95432 KB Output is correct
8 Correct 35 ms 95252 KB Output is correct
9 Correct 31 ms 95324 KB Output is correct
10 Correct 34 ms 95324 KB Output is correct
11 Correct 34 ms 95240 KB Output is correct
12 Correct 33 ms 95324 KB Output is correct
13 Correct 30 ms 95064 KB Output is correct
14 Correct 29 ms 95316 KB Output is correct
15 Correct 32 ms 95576 KB Output is correct
16 Correct 33 ms 95320 KB Output is correct
17 Correct 34 ms 95320 KB Output is correct
18 Correct 32 ms 95452 KB Output is correct
19 Correct 30 ms 95324 KB Output is correct
20 Correct 31 ms 95324 KB Output is correct
21 Correct 31 ms 95360 KB Output is correct
22 Correct 34 ms 95196 KB Output is correct
23 Correct 32 ms 95388 KB Output is correct
24 Correct 31 ms 95324 KB Output is correct
25 Correct 30 ms 99164 KB Output is correct
26 Correct 31 ms 101104 KB Output is correct
27 Correct 32 ms 95324 KB Output is correct
28 Correct 35 ms 95452 KB Output is correct
29 Correct 33 ms 95224 KB Output is correct
30 Correct 32 ms 95216 KB Output is correct
31 Correct 34 ms 95312 KB Output is correct
32 Correct 34 ms 95320 KB Output is correct
33 Correct 32 ms 95152 KB Output is correct
34 Correct 33 ms 94980 KB Output is correct
35 Correct 32 ms 95504 KB Output is correct
36 Correct 36 ms 95440 KB Output is correct
37 Correct 30 ms 95060 KB Output is correct
38 Correct 31 ms 95320 KB Output is correct
39 Execution timed out 1012 ms 98892 KB Time limit exceeded
40 Halted 0 ms 0 KB -