oj.uz

Submission #421852

# Submission time Handle Problem Language Result Execution time Memory
421852 2021-06-09T12:59:50 Z tqbfjotld Food Court (JOI21_foodcourt) C++14
68 / 100
 1000 ms 97908 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define getchar getchar_unlocked


struct node{
    int s,e;
    int lazymin,lazych;
    int v;
    node *l,*r;
    node (int _s, int _e){
        s = _s; e = _e;
        lazymin = 0; lazych = 0;
        v = 0;
        if (s!=e){
            l = new node(s,(s+e)/2);
            r = new node((s+e)/2+1,e);
        }
    }
    void proc(){
        if (lazymin==0 && lazych==0) return;
        if (s!=e){
            l->lazymin = min(l->lazymin,l->lazych+lazymin);
            l->lazych += lazych;
            r->lazymin = min(r->lazymin,r->lazych+lazymin);
            r->lazych += lazych;
        }
        if (s==e){
            v += lazymin;
            v = max(v,0LL);
            v -= lazymin;
            v += lazych;
        }
        lazymin = 0;
        lazych = 0;
    }
    void inc(int a, int b, int val){
        proc();
        if (a<=s && e<=b){
            lazych += val;
            proc();
            return;
        }
        else if (b<=(s+e)/2){
            l->inc(a,b,val);
        }
        else if (a>(s+e)/2){
            r->inc(a,b,val);
        }
        else{
            l->inc(a,b,val);
            r->inc(a,b,val);
        }
        l->proc();
        r->proc();
    }
    void dec(int a, int b, int val){
        proc();
        if (a<=s && e<=b){
            lazych -= val;
            lazymin = min(lazymin,lazych);
            proc();
            return;
        }
        else if (b<=(s+e)/2){
            l->dec(a,b,val);
        }
        else if (a>(s+e)/2){
            r->dec(a,b,val);
        }
        else{
            l->dec(a,b,val);
            r->dec(a,b,val);
        }
        l->proc(); r->proc();
    }
    int qu(int pos){
        proc();
        if (s==e) return v;
        if (pos>(s+e)/2)return r->qu(pos);
        else return l->qu(pos);
    }
}*root;

struct q_dat{
    int l,r;
    int t,k;
    q_dat(){
        l = 0; r = 0; t = 0; k = 0;
    }
    q_dat(int _l, int _r, int _t, int _k){
        l = _l; r = _r; t = _t; k = _k;
    }
};
//vector<q_dat> query1;
int groupnum[250005];
//vector<q_dat> query2;
vector<pair<pair<int,int>,int> > query3;

int fw[250005];

void upd(int32_t pos, int val){
    while (pos<250005){
        fw[pos] += val;
        pos+=pos&-pos;
    }
}
int qu(int32_t pos){
    int ans = 0;
    while (pos>0){
        ans += fw[pos];
        pos -= pos&-pos;
    }
    return ans;
}

int numt[250005];
int32_t ans[250005];
vector<pair<pair<int32_t,int32_t>,int32_t> > bsvals[250005];
vector<pair<pair<int32_t,int32_t>,int32_t> > bsvals2[250005];

struct node2{
    int s, e;
    int lazyval;
    node2 *l,*r;
    node2 (int _s, int _e){
        s = _s; e = _e;
        lazyval = -1;
        if (s!=e){
            l = new node2(s,(s+e)/2);
            r = new node2((s+e)/2+1,e);
        }
    }
    void proc(){
        if (lazyval==-1) return;
        if (s!=e){
            l->lazyval = lazyval;
            r->lazyval = lazyval;
            lazyval = -1;
        }
    }
    int qu(int pos){
        proc();
        if (s==e) return lazyval;
        if (pos<=(s+e)/2) return l->qu(pos);
        return r->qu(pos);
    }
    void upd(int a, int b, int val){
        proc();
        if (a<=s && e<=b) {
            lazyval = val;
            proc();
            return;
        }
        if (b<=(s+e)/2){
            l->upd(a,b,val);
        }
        else if (a>(s+e)/2){
            r->upd(a,b,val);
        }
        else{
            l->upd(a,b,val);
            r->upd(a,b,val);
        }
    }
}*root2;

int32_t incl[250005];
int32_t incr[250005];
int incamt[250005];
int finans[250005];

inline void scan(int &a){
    a = 0;
    char ch = ' ';
    while (ch<'0' || ch>'9') ch = getchar();
    while (ch>='0' && ch<='9'){
        a = (a<<3)+(a<<1)+ch-'0';
        ch = getchar();
    }
}

main(){
    int n,m,q;
    scan(n); scan(m); scan(q);
    root = new node(1,n);
    for (int x = 0; x<q; x++){
        int a;
        scan(a);
        if (a==1){
            int b,c,d,e;
            scan(b); scan(c); scan(d); scan(e);
            groupnum[x] = d;
           // query1.push_back(q_dat(b,c,x,e));
            root->inc(b,c,e);
            upd(b,e);
            upd(c+1,-e);
            incl[x] = b;
            incr[x] = c;
            incamt[x] = e;
        }
        else if (a==2){
            int b,c,d;
            scan(b); scan(c); scan(d);
           // query2.push_back(q_dat(b,c,x,d));
            root->dec(b,c,d);
        }
        else if (a==3){
            int b,c;
            scan(b); scan(c);
            query3.push_back({{b,c},x});
            int num = root->qu(b);
            numt[x] = qu(b)-num+c;
            incl[x] = b;
            if (num<c){
                ans[x] = -1;
            }
            //printf("%lld has %lld\n",b,numpopped[x]);
        }
    }
    for (auto x : query3){
        if (ans[x.second]==-1) continue;
        int a = -1;
        int b = x.second;
        int mid = (a+b)/2;
        bsvals[mid].push_back({{a,b},x.second});
    }
    bool found = true;
    while (found){
        found = false;
        for (int32_t k = 0; k<250005; k++){
            fw[k] = 0;
        }
        for (int32_t t = 0; t<q; t++){
            if (incamt[t]!=0){
                upd(incl[t],incamt[t]);
                upd(incr[t]+1,-incamt[t]);
            }
            for (auto x : bsvals[t]){
                if (x.first.first+1==x.first.second) {
                    ans[x.second] = x.first.second;
                    continue;
                }
                if (qu(incl[x.second])>=numt[x.second]){
                    bsvals2[(x.first.first+t)/2].push_back({{x.first.first,t},x.second});
                }
                else{
                    bsvals2[(x.first.second+t)/2].push_back({{t,x.first.second},x.second});
                }
                found = true;
            }
            bsvals[t].clear();
        }
        swap(bsvals2,bsvals);
    }
    root2 = new node2(1,n);
    vector<pair<pair<int,int>,int> > stuff;
    for (auto x : query3){
        if (ans[x.second]==-1) {
            continue;
        }
        stuff.push_back({{ans[x.second],incl[x.second]},x.second});
    }
    sort(stuff.begin(),stuff.end());
    int curt = 0;
    for (auto x : stuff){
        while (curt<=x.first.first){
            if (incamt[curt]!=0){
                root2->upd(incl[curt],incr[curt],curt);
                //printf("set %lld to %lld with %lld\n",incl[curt],incr[curt],curt);
            }
            curt++;
        }
        finans[x.second] = root2->qu(x.first.second);
        //printf("query %lld = %lld\n",x.first.second,finans[x.second]);
    }
    for (auto x : query3){
       // printf("ans = %lld\n",ans[x.second]);
        if (ans[x.second]==-1){
            printf("0\n");
        }
        else{
            assert(finans[x.second]!=-1);
            printf("%lld\n",groupnum[finans[x.second]]);
        }

    }
}

Compilation message

foodcourt.cpp:184:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  184 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 14404 KB Output is correct
2 Correct 29 ms 14548 KB Output is correct
3 Correct 28 ms 14540 KB Output is correct
4 Correct 30 ms 14572 KB Output is correct
5 Correct 28 ms 14172 KB Output is correct
6 Correct 27 ms 14160 KB Output is correct
7 Correct 29 ms 14532 KB Output is correct
8 Correct 30 ms 14532 KB Output is correct
9 Correct 29 ms 14528 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 30 ms 14640 KB Output is correct
12 Correct 33 ms 14520 KB Output is correct
13 Correct 32 ms 14528 KB Output is correct
14 Correct 31 ms 14568 KB Output is correct
15 Correct 28 ms 14528 KB Output is correct
16 Correct 28 ms 14556 KB Output is correct
17 Correct 29 ms 14464 KB Output is correct
18 Correct 30 ms 14544 KB Output is correct
19 Correct 35 ms 14428 KB Output is correct
20 Correct 29 ms 14520 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 14404 KB Output is correct
2 Correct 29 ms 14548 KB Output is correct
3 Correct 28 ms 14540 KB Output is correct
4 Correct 30 ms 14572 KB Output is correct
5 Correct 28 ms 14172 KB Output is correct
6 Correct 27 ms 14160 KB Output is correct
7 Correct 29 ms 14532 KB Output is correct
8 Correct 30 ms 14532 KB Output is correct
9 Correct 29 ms 14528 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 30 ms 14640 KB Output is correct
12 Correct 33 ms 14520 KB Output is correct
13 Correct 32 ms 14528 KB Output is correct
14 Correct 31 ms 14568 KB Output is correct
15 Correct 28 ms 14528 KB Output is correct
16 Correct 28 ms 14556 KB Output is correct
17 Correct 29 ms 14464 KB Output is correct
18 Correct 30 ms 14544 KB Output is correct
19 Correct 35 ms 14428 KB Output is correct
20 Correct 29 ms 14520 KB Output is correct
21 Correct 39 ms 14664 KB Output is correct
22 Correct 27 ms 14668 KB Output is correct
23 Correct 29 ms 14464 KB Output is correct
24 Correct 29 ms 14564 KB Output is correct
25 Correct 27 ms 14136 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 29 ms 14532 KB Output is correct
28 Correct 34 ms 14532 KB Output is correct
29 Correct 30 ms 14540 KB Output is correct
30 Correct 35 ms 14632 KB Output is correct
31 Correct 33 ms 14588 KB Output is correct
32 Correct 32 ms 14556 KB Output is correct
33 Correct 29 ms 14540 KB Output is correct
34 Correct 30 ms 14660 KB Output is correct
35 Correct 29 ms 14484 KB Output is correct
36 Correct 31 ms 14548 KB Output is correct
37 Correct 30 ms 14420 KB Output is correct
38 Correct 32 ms 14564 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 31108 KB Output is correct
2 Correct 151 ms 31036 KB Output is correct
3 Correct 143 ms 31160 KB Output is correct
4 Correct 149 ms 31208 KB Output is correct
5 Correct 164 ms 31072 KB Output is correct
6 Correct 151 ms 31044 KB Output is correct
7 Correct 90 ms 19644 KB Output is correct
8 Correct 90 ms 19908 KB Output is correct
9 Correct 162 ms 30972 KB Output is correct
10 Correct 156 ms 30916 KB Output is correct
11 Correct 147 ms 30956 KB Output is correct
12 Correct 145 ms 31112 KB Output is correct
13 Correct 137 ms 28524 KB Output is correct
14 Correct 188 ms 33636 KB Output is correct
15 Correct 194 ms 26816 KB Output is correct
16 Correct 175 ms 31288 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 961 ms 90400 KB Output is correct
2 Correct 745 ms 77300 KB Output is correct
3 Execution timed out 1103 ms 97908 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 14404 KB Output is correct
2 Correct 29 ms 14548 KB Output is correct
3 Correct 28 ms 14540 KB Output is correct
4 Correct 30 ms 14572 KB Output is correct
5 Correct 28 ms 14172 KB Output is correct
6 Correct 27 ms 14160 KB Output is correct
7 Correct 29 ms 14532 KB Output is correct
8 Correct 30 ms 14532 KB Output is correct
9 Correct 29 ms 14528 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 30 ms 14640 KB Output is correct
12 Correct 33 ms 14520 KB Output is correct
13 Correct 32 ms 14528 KB Output is correct
14 Correct 31 ms 14568 KB Output is correct
15 Correct 28 ms 14528 KB Output is correct
16 Correct 28 ms 14556 KB Output is correct
17 Correct 29 ms 14464 KB Output is correct
18 Correct 30 ms 14544 KB Output is correct
19 Correct 35 ms 14428 KB Output is correct
20 Correct 29 ms 14520 KB Output is correct
21 Correct 142 ms 31108 KB Output is correct
22 Correct 151 ms 31036 KB Output is correct
23 Correct 143 ms 31160 KB Output is correct
24 Correct 149 ms 31208 KB Output is correct
25 Correct 164 ms 31072 KB Output is correct
26 Correct 151 ms 31044 KB Output is correct
27 Correct 90 ms 19644 KB Output is correct
28 Correct 90 ms 19908 KB Output is correct
29 Correct 162 ms 30972 KB Output is correct
30 Correct 156 ms 30916 KB Output is correct
31 Correct 147 ms 30956 KB Output is correct
32 Correct 145 ms 31112 KB Output is correct
33 Correct 137 ms 28524 KB Output is correct
34 Correct 188 ms 33636 KB Output is correct
35 Correct 194 ms 26816 KB Output is correct
36 Correct 175 ms 31288 KB Output is correct
37 Correct 184 ms 33616 KB Output is correct
38 Correct 197 ms 31840 KB Output is correct
39 Correct 93 ms 19396 KB Output is correct
40 Correct 101 ms 20288 KB Output is correct
41 Correct 205 ms 33340 KB Output is correct
42 Correct 210 ms 34656 KB Output is correct
43 Correct 220 ms 35012 KB Output is correct
44 Correct 215 ms 34108 KB Output is correct
45 Correct 205 ms 34688 KB Output is correct
46 Correct 199 ms 34880 KB Output is correct
47 Correct 124 ms 35816 KB Output is correct
48 Correct 172 ms 35800 KB Output is correct
49 Correct 154 ms 28272 KB Output is correct
50 Correct 181 ms 33424 KB Output is correct
51 Correct 207 ms 34376 KB Output is correct
52 Correct 207 ms 34400 KB Output is correct
53 Correct 139 ms 28900 KB Output is correct
54 Correct 173 ms 31316 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 34888 KB Output is correct
2 Correct 234 ms 33812 KB Output is correct
3 Correct 250 ms 36240 KB Output is correct
4 Correct 184 ms 33476 KB Output is correct
5 Correct 214 ms 34616 KB Output is correct
6 Correct 267 ms 36260 KB Output is correct
7 Correct 146 ms 21056 KB Output is correct
8 Correct 130 ms 20668 KB Output is correct
9 Correct 191 ms 36240 KB Output is correct
10 Correct 164 ms 32264 KB Output is correct
11 Correct 214 ms 36212 KB Output is correct
12 Correct 209 ms 36240 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 14404 KB Output is correct
2 Correct 29 ms 14548 KB Output is correct
3 Correct 28 ms 14540 KB Output is correct
4 Correct 30 ms 14572 KB Output is correct
5 Correct 28 ms 14172 KB Output is correct
6 Correct 27 ms 14160 KB Output is correct
7 Correct 29 ms 14532 KB Output is correct
8 Correct 30 ms 14532 KB Output is correct
9 Correct 29 ms 14528 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 30 ms 14640 KB Output is correct
12 Correct 33 ms 14520 KB Output is correct
13 Correct 32 ms 14528 KB Output is correct
14 Correct 31 ms 14568 KB Output is correct
15 Correct 28 ms 14528 KB Output is correct
16 Correct 28 ms 14556 KB Output is correct
17 Correct 29 ms 14464 KB Output is correct
18 Correct 30 ms 14544 KB Output is correct
19 Correct 35 ms 14428 KB Output is correct
20 Correct 29 ms 14520 KB Output is correct
21 Correct 39 ms 14664 KB Output is correct
22 Correct 27 ms 14668 KB Output is correct
23 Correct 29 ms 14464 KB Output is correct
24 Correct 29 ms 14564 KB Output is correct
25 Correct 27 ms 14136 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 29 ms 14532 KB Output is correct
28 Correct 34 ms 14532 KB Output is correct
29 Correct 30 ms 14540 KB Output is correct
30 Correct 35 ms 14632 KB Output is correct
31 Correct 33 ms 14588 KB Output is correct
32 Correct 32 ms 14556 KB Output is correct
33 Correct 29 ms 14540 KB Output is correct
34 Correct 30 ms 14660 KB Output is correct
35 Correct 29 ms 14484 KB Output is correct
36 Correct 31 ms 14548 KB Output is correct
37 Correct 30 ms 14420 KB Output is correct
38 Correct 32 ms 14564 KB Output is correct
39 Correct 142 ms 31108 KB Output is correct
40 Correct 151 ms 31036 KB Output is correct
41 Correct 143 ms 31160 KB Output is correct
42 Correct 149 ms 31208 KB Output is correct
43 Correct 164 ms 31072 KB Output is correct
44 Correct 151 ms 31044 KB Output is correct
45 Correct 90 ms 19644 KB Output is correct
46 Correct 90 ms 19908 KB Output is correct
47 Correct 162 ms 30972 KB Output is correct
48 Correct 156 ms 30916 KB Output is correct
49 Correct 147 ms 30956 KB Output is correct
50 Correct 145 ms 31112 KB Output is correct
51 Correct 137 ms 28524 KB Output is correct
52 Correct 188 ms 33636 KB Output is correct
53 Correct 194 ms 26816 KB Output is correct
54 Correct 175 ms 31288 KB Output is correct
55 Correct 184 ms 33616 KB Output is correct
56 Correct 197 ms 31840 KB Output is correct
57 Correct 93 ms 19396 KB Output is correct
58 Correct 101 ms 20288 KB Output is correct
59 Correct 205 ms 33340 KB Output is correct
60 Correct 210 ms 34656 KB Output is correct
61 Correct 220 ms 35012 KB Output is correct
62 Correct 215 ms 34108 KB Output is correct
63 Correct 205 ms 34688 KB Output is correct
64 Correct 199 ms 34880 KB Output is correct
65 Correct 124 ms 35816 KB Output is correct
66 Correct 172 ms 35800 KB Output is correct
67 Correct 154 ms 28272 KB Output is correct
68 Correct 181 ms 33424 KB Output is correct
69 Correct 207 ms 34376 KB Output is correct
70 Correct 207 ms 34400 KB Output is correct
71 Correct 139 ms 28900 KB Output is correct
72 Correct 173 ms 31316 KB Output is correct
73 Correct 226 ms 34888 KB Output is correct
74 Correct 234 ms 33812 KB Output is correct
75 Correct 250 ms 36240 KB Output is correct
76 Correct 184 ms 33476 KB Output is correct
77 Correct 214 ms 34616 KB Output is correct
78 Correct 267 ms 36260 KB Output is correct
79 Correct 146 ms 21056 KB Output is correct
80 Correct 130 ms 20668 KB Output is correct
81 Correct 191 ms 36240 KB Output is correct
82 Correct 164 ms 32264 KB Output is correct
83 Correct 214 ms 36212 KB Output is correct
84 Correct 209 ms 36240 KB Output is correct
85 Correct 188 ms 32032 KB Output is correct
86 Correct 213 ms 35700 KB Output is correct
87 Correct 198 ms 32880 KB Output is correct
88 Correct 237 ms 34628 KB Output is correct
89 Correct 146 ms 28864 KB Output is correct
90 Correct 213 ms 34680 KB Output is correct
91 Correct 173 ms 28912 KB Output is correct
92 Correct 175 ms 28868 KB Output is correct
93 Correct 203 ms 34884 KB Output is correct
94 Correct 213 ms 34436 KB Output is correct
95 Correct 208 ms 33220 KB Output is correct
96 Correct 211 ms 34772 KB Output is correct
97 Correct 253 ms 34760 KB Output is correct
98 Correct 180 ms 29764 KB Output is correct
99 Correct 131 ms 35752 KB Output is correct
100 Correct 158 ms 32532 KB Output is correct
101 Correct 215 ms 35768 KB Output is correct
102 Correct 166 ms 33348 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 14404 KB Output is correct
2 Correct 29 ms 14548 KB Output is correct
3 Correct 28 ms 14540 KB Output is correct
4 Correct 30 ms 14572 KB Output is correct
5 Correct 28 ms 14172 KB Output is correct
6 Correct 27 ms 14160 KB Output is correct
7 Correct 29 ms 14532 KB Output is correct
8 Correct 30 ms 14532 KB Output is correct
9 Correct 29 ms 14528 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 30 ms 14640 KB Output is correct
12 Correct 33 ms 14520 KB Output is correct
13 Correct 32 ms 14528 KB Output is correct
14 Correct 31 ms 14568 KB Output is correct
15 Correct 28 ms 14528 KB Output is correct
16 Correct 28 ms 14556 KB Output is correct
17 Correct 29 ms 14464 KB Output is correct
18 Correct 30 ms 14544 KB Output is correct
19 Correct 35 ms 14428 KB Output is correct
20 Correct 29 ms 14520 KB Output is correct
21 Correct 39 ms 14664 KB Output is correct
22 Correct 27 ms 14668 KB Output is correct
23 Correct 29 ms 14464 KB Output is correct
24 Correct 29 ms 14564 KB Output is correct
25 Correct 27 ms 14136 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 29 ms 14532 KB Output is correct
28 Correct 34 ms 14532 KB Output is correct
29 Correct 30 ms 14540 KB Output is correct
30 Correct 35 ms 14632 KB Output is correct
31 Correct 33 ms 14588 KB Output is correct
32 Correct 32 ms 14556 KB Output is correct
33 Correct 29 ms 14540 KB Output is correct
34 Correct 30 ms 14660 KB Output is correct
35 Correct 29 ms 14484 KB Output is correct
36 Correct 31 ms 14548 KB Output is correct
37 Correct 30 ms 14420 KB Output is correct
38 Correct 32 ms 14564 KB Output is correct
39 Correct 142 ms 31108 KB Output is correct
40 Correct 151 ms 31036 KB Output is correct
41 Correct 143 ms 31160 KB Output is correct
42 Correct 149 ms 31208 KB Output is correct
43 Correct 164 ms 31072 KB Output is correct
44 Correct 151 ms 31044 KB Output is correct
45 Correct 90 ms 19644 KB Output is correct
46 Correct 90 ms 19908 KB Output is correct
47 Correct 162 ms 30972 KB Output is correct
48 Correct 156 ms 30916 KB Output is correct
49 Correct 147 ms 30956 KB Output is correct
50 Correct 145 ms 31112 KB Output is correct
51 Correct 137 ms 28524 KB Output is correct
52 Correct 188 ms 33636 KB Output is correct
53 Correct 194 ms 26816 KB Output is correct
54 Correct 175 ms 31288 KB Output is correct
55 Correct 961 ms 90400 KB Output is correct
56 Correct 745 ms 77300 KB Output is correct
57 Execution timed out 1103 ms 97908 KB Time limit exceeded
58 Halted 0 ms 0 KB -