oj.uz

답안 #421865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421865 2021-06-09T13:06:16 Z tqbfjotld 푸드 코트 (JOI21_foodcourt) C++14
68 / 100
 1000 ms 98124 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define getchar getchar_unlocked

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


//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{
    int32_t s, e,m;
    int lazyval;
    node2 *l,*r;
    node2 (int32_t _s, int32_t _e){
        s = _s; e = _e;m = (s+e)/2;
        lazyval = -1;
        if (s!=e){
            l = new node2(s,m);
            r = new node2(m+1,e);
        }
    }
    void proc(){
        if (lazyval==-1) return;
        if (s!=e){
            l->lazyval = lazyval;
            r->lazyval = lazyval;
            lazyval = -1;
        }
    }
    int qu(int32_t pos){
        proc();
        if (s==e) return lazyval;
        if (pos<=m) return l->qu(pos);
        return r->qu(pos);
    }
    void upd(int32_t a, int32_t b, int val){
        proc();
        if (a<=s && e<=b) {
            lazyval = val;
            proc();
            return;
        }
        if (b<=m){
            l->upd(a,b,val);
        }
        else if (a>m){
            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:171:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  171 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 14496 KB Output is correct
2 Correct 29 ms 14660 KB Output is correct
3 Correct 30 ms 14476 KB Output is correct
4 Correct 30 ms 14524 KB Output is correct
5 Correct 27 ms 14132 KB Output is correct
6 Correct 26 ms 14148 KB Output is correct
7 Correct 32 ms 14532 KB Output is correct
8 Correct 32 ms 14552 KB Output is correct
9 Correct 29 ms 14532 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 31 ms 14648 KB Output is correct
12 Correct 28 ms 14668 KB Output is correct
13 Correct 27 ms 14536 KB Output is correct
14 Correct 27 ms 14668 KB Output is correct
15 Correct 27 ms 14524 KB Output is correct
16 Correct 31 ms 14668 KB Output is correct
17 Correct 29 ms 14456 KB Output is correct
18 Correct 30 ms 14540 KB Output is correct
19 Correct 31 ms 14432 KB Output is correct
20 Correct 30 ms 14500 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 14496 KB Output is correct
2 Correct 29 ms 14660 KB Output is correct
3 Correct 30 ms 14476 KB Output is correct
4 Correct 30 ms 14524 KB Output is correct
5 Correct 27 ms 14132 KB Output is correct
6 Correct 26 ms 14148 KB Output is correct
7 Correct 32 ms 14532 KB Output is correct
8 Correct 32 ms 14552 KB Output is correct
9 Correct 29 ms 14532 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 31 ms 14648 KB Output is correct
12 Correct 28 ms 14668 KB Output is correct
13 Correct 27 ms 14536 KB Output is correct
14 Correct 27 ms 14668 KB Output is correct
15 Correct 27 ms 14524 KB Output is correct
16 Correct 31 ms 14668 KB Output is correct
17 Correct 29 ms 14456 KB Output is correct
18 Correct 30 ms 14540 KB Output is correct
19 Correct 31 ms 14432 KB Output is correct
20 Correct 30 ms 14500 KB Output is correct
21 Correct 32 ms 14520 KB Output is correct
22 Correct 33 ms 14568 KB Output is correct
23 Correct 28 ms 14404 KB Output is correct
24 Correct 30 ms 14568 KB Output is correct
25 Correct 28 ms 14160 KB Output is correct
26 Correct 27 ms 14164 KB Output is correct
27 Correct 30 ms 14516 KB Output is correct
28 Correct 29 ms 14536 KB Output is correct
29 Correct 28 ms 14528 KB Output is correct
30 Correct 31 ms 14544 KB Output is correct
31 Correct 33 ms 14540 KB Output is correct
32 Correct 33 ms 14552 KB Output is correct
33 Correct 29 ms 14532 KB Output is correct
34 Correct 27 ms 14644 KB Output is correct
35 Correct 27 ms 14464 KB Output is correct
36 Correct 29 ms 14576 KB Output is correct
37 Correct 29 ms 14424 KB Output is correct
38 Correct 28 ms 14508 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 31144 KB Output is correct
2 Correct 136 ms 30932 KB Output is correct
3 Correct 130 ms 31168 KB Output is correct
4 Correct 140 ms 31112 KB Output is correct
5 Correct 142 ms 31068 KB Output is correct
6 Correct 151 ms 31004 KB Output is correct
7 Correct 86 ms 19540 KB Output is correct
8 Correct 97 ms 19776 KB Output is correct
9 Correct 133 ms 30876 KB Output is correct
10 Correct 125 ms 30956 KB Output is correct
11 Correct 134 ms 30916 KB Output is correct
12 Correct 136 ms 30964 KB Output is correct
13 Correct 128 ms 28500 KB Output is correct
14 Correct 149 ms 33728 KB Output is correct
15 Correct 149 ms 26948 KB Output is correct
16 Correct 155 ms 31352 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 765 ms 90312 KB Output is correct
2 Correct 635 ms 77092 KB Output is correct
3 Correct 873 ms 98124 KB Output is correct
4 Correct 745 ms 86580 KB Output is correct
5 Correct 745 ms 73800 KB Output is correct
6 Execution timed out 1022 ms 93288 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 14496 KB Output is correct
2 Correct 29 ms 14660 KB Output is correct
3 Correct 30 ms 14476 KB Output is correct
4 Correct 30 ms 14524 KB Output is correct
5 Correct 27 ms 14132 KB Output is correct
6 Correct 26 ms 14148 KB Output is correct
7 Correct 32 ms 14532 KB Output is correct
8 Correct 32 ms 14552 KB Output is correct
9 Correct 29 ms 14532 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 31 ms 14648 KB Output is correct
12 Correct 28 ms 14668 KB Output is correct
13 Correct 27 ms 14536 KB Output is correct
14 Correct 27 ms 14668 KB Output is correct
15 Correct 27 ms 14524 KB Output is correct
16 Correct 31 ms 14668 KB Output is correct
17 Correct 29 ms 14456 KB Output is correct
18 Correct 30 ms 14540 KB Output is correct
19 Correct 31 ms 14432 KB Output is correct
20 Correct 30 ms 14500 KB Output is correct
21 Correct 138 ms 31144 KB Output is correct
22 Correct 136 ms 30932 KB Output is correct
23 Correct 130 ms 31168 KB Output is correct
24 Correct 140 ms 31112 KB Output is correct
25 Correct 142 ms 31068 KB Output is correct
26 Correct 151 ms 31004 KB Output is correct
27 Correct 86 ms 19540 KB Output is correct
28 Correct 97 ms 19776 KB Output is correct
29 Correct 133 ms 30876 KB Output is correct
30 Correct 125 ms 30956 KB Output is correct
31 Correct 134 ms 30916 KB Output is correct
32 Correct 136 ms 30964 KB Output is correct
33 Correct 128 ms 28500 KB Output is correct
34 Correct 149 ms 33728 KB Output is correct
35 Correct 149 ms 26948 KB Output is correct
36 Correct 155 ms 31352 KB Output is correct
37 Correct 174 ms 33688 KB Output is correct
38 Correct 182 ms 31888 KB Output is correct
39 Correct 89 ms 19292 KB Output is correct
40 Correct 99 ms 20096 KB Output is correct
41 Correct 198 ms 33548 KB Output is correct
42 Correct 206 ms 34632 KB Output is correct
43 Correct 199 ms 34864 KB Output is correct
44 Correct 201 ms 34072 KB Output is correct
45 Correct 209 ms 34716 KB Output is correct
46 Correct 224 ms 34880 KB Output is correct
47 Correct 121 ms 35748 KB Output is correct
48 Correct 164 ms 35776 KB Output is correct
49 Correct 137 ms 28248 KB Output is correct
50 Correct 186 ms 33248 KB Output is correct
51 Correct 217 ms 34452 KB Output is correct
52 Correct 187 ms 34372 KB Output is correct
53 Correct 143 ms 28920 KB Output is correct
54 Correct 165 ms 31364 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 34800 KB Output is correct
2 Correct 229 ms 33728 KB Output is correct
3 Correct 239 ms 36156 KB Output is correct
4 Correct 184 ms 33284 KB Output is correct
5 Correct 202 ms 34596 KB Output is correct
6 Correct 239 ms 36256 KB Output is correct
7 Correct 135 ms 21032 KB Output is correct
8 Correct 121 ms 20660 KB Output is correct
9 Correct 185 ms 36216 KB Output is correct
10 Correct 153 ms 32356 KB Output is correct
11 Correct 223 ms 36220 KB Output is correct
12 Correct 217 ms 36164 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 14496 KB Output is correct
2 Correct 29 ms 14660 KB Output is correct
3 Correct 30 ms 14476 KB Output is correct
4 Correct 30 ms 14524 KB Output is correct
5 Correct 27 ms 14132 KB Output is correct
6 Correct 26 ms 14148 KB Output is correct
7 Correct 32 ms 14532 KB Output is correct
8 Correct 32 ms 14552 KB Output is correct
9 Correct 29 ms 14532 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 31 ms 14648 KB Output is correct
12 Correct 28 ms 14668 KB Output is correct
13 Correct 27 ms 14536 KB Output is correct
14 Correct 27 ms 14668 KB Output is correct
15 Correct 27 ms 14524 KB Output is correct
16 Correct 31 ms 14668 KB Output is correct
17 Correct 29 ms 14456 KB Output is correct
18 Correct 30 ms 14540 KB Output is correct
19 Correct 31 ms 14432 KB Output is correct
20 Correct 30 ms 14500 KB Output is correct
21 Correct 32 ms 14520 KB Output is correct
22 Correct 33 ms 14568 KB Output is correct
23 Correct 28 ms 14404 KB Output is correct
24 Correct 30 ms 14568 KB Output is correct
25 Correct 28 ms 14160 KB Output is correct
26 Correct 27 ms 14164 KB Output is correct
27 Correct 30 ms 14516 KB Output is correct
28 Correct 29 ms 14536 KB Output is correct
29 Correct 28 ms 14528 KB Output is correct
30 Correct 31 ms 14544 KB Output is correct
31 Correct 33 ms 14540 KB Output is correct
32 Correct 33 ms 14552 KB Output is correct
33 Correct 29 ms 14532 KB Output is correct
34 Correct 27 ms 14644 KB Output is correct
35 Correct 27 ms 14464 KB Output is correct
36 Correct 29 ms 14576 KB Output is correct
37 Correct 29 ms 14424 KB Output is correct
38 Correct 28 ms 14508 KB Output is correct
39 Correct 138 ms 31144 KB Output is correct
40 Correct 136 ms 30932 KB Output is correct
41 Correct 130 ms 31168 KB Output is correct
42 Correct 140 ms 31112 KB Output is correct
43 Correct 142 ms 31068 KB Output is correct
44 Correct 151 ms 31004 KB Output is correct
45 Correct 86 ms 19540 KB Output is correct
46 Correct 97 ms 19776 KB Output is correct
47 Correct 133 ms 30876 KB Output is correct
48 Correct 125 ms 30956 KB Output is correct
49 Correct 134 ms 30916 KB Output is correct
50 Correct 136 ms 30964 KB Output is correct
51 Correct 128 ms 28500 KB Output is correct
52 Correct 149 ms 33728 KB Output is correct
53 Correct 149 ms 26948 KB Output is correct
54 Correct 155 ms 31352 KB Output is correct
55 Correct 174 ms 33688 KB Output is correct
56 Correct 182 ms 31888 KB Output is correct
57 Correct 89 ms 19292 KB Output is correct
58 Correct 99 ms 20096 KB Output is correct
59 Correct 198 ms 33548 KB Output is correct
60 Correct 206 ms 34632 KB Output is correct
61 Correct 199 ms 34864 KB Output is correct
62 Correct 201 ms 34072 KB Output is correct
63 Correct 209 ms 34716 KB Output is correct
64 Correct 224 ms 34880 KB Output is correct
65 Correct 121 ms 35748 KB Output is correct
66 Correct 164 ms 35776 KB Output is correct
67 Correct 137 ms 28248 KB Output is correct
68 Correct 186 ms 33248 KB Output is correct
69 Correct 217 ms 34452 KB Output is correct
70 Correct 187 ms 34372 KB Output is correct
71 Correct 143 ms 28920 KB Output is correct
72 Correct 165 ms 31364 KB Output is correct
73 Correct 209 ms 34800 KB Output is correct
74 Correct 229 ms 33728 KB Output is correct
75 Correct 239 ms 36156 KB Output is correct
76 Correct 184 ms 33284 KB Output is correct
77 Correct 202 ms 34596 KB Output is correct
78 Correct 239 ms 36256 KB Output is correct
79 Correct 135 ms 21032 KB Output is correct
80 Correct 121 ms 20660 KB Output is correct
81 Correct 185 ms 36216 KB Output is correct
82 Correct 153 ms 32356 KB Output is correct
83 Correct 223 ms 36220 KB Output is correct
84 Correct 217 ms 36164 KB Output is correct
85 Correct 207 ms 31984 KB Output is correct
86 Correct 194 ms 35776 KB Output is correct
87 Correct 191 ms 32792 KB Output is correct
88 Correct 231 ms 34720 KB Output is correct
89 Correct 140 ms 28744 KB Output is correct
90 Correct 201 ms 34608 KB Output is correct
91 Correct 148 ms 28900 KB Output is correct
92 Correct 151 ms 28868 KB Output is correct
93 Correct 195 ms 34900 KB Output is correct
94 Correct 195 ms 34472 KB Output is correct
95 Correct 202 ms 33260 KB Output is correct
96 Correct 192 ms 34768 KB Output is correct
97 Correct 190 ms 34900 KB Output is correct
98 Correct 154 ms 29812 KB Output is correct
99 Correct 126 ms 35784 KB Output is correct
100 Correct 143 ms 32640 KB Output is correct
101 Correct 171 ms 35768 KB Output is correct
102 Correct 160 ms 33432 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 14496 KB Output is correct
2 Correct 29 ms 14660 KB Output is correct
3 Correct 30 ms 14476 KB Output is correct
4 Correct 30 ms 14524 KB Output is correct
5 Correct 27 ms 14132 KB Output is correct
6 Correct 26 ms 14148 KB Output is correct
7 Correct 32 ms 14532 KB Output is correct
8 Correct 32 ms 14552 KB Output is correct
9 Correct 29 ms 14532 KB Output is correct
10 Correct 31 ms 14548 KB Output is correct
11 Correct 31 ms 14648 KB Output is correct
12 Correct 28 ms 14668 KB Output is correct
13 Correct 27 ms 14536 KB Output is correct
14 Correct 27 ms 14668 KB Output is correct
15 Correct 27 ms 14524 KB Output is correct
16 Correct 31 ms 14668 KB Output is correct
17 Correct 29 ms 14456 KB Output is correct
18 Correct 30 ms 14540 KB Output is correct
19 Correct 31 ms 14432 KB Output is correct
20 Correct 30 ms 14500 KB Output is correct
21 Correct 32 ms 14520 KB Output is correct
22 Correct 33 ms 14568 KB Output is correct
23 Correct 28 ms 14404 KB Output is correct
24 Correct 30 ms 14568 KB Output is correct
25 Correct 28 ms 14160 KB Output is correct
26 Correct 27 ms 14164 KB Output is correct
27 Correct 30 ms 14516 KB Output is correct
28 Correct 29 ms 14536 KB Output is correct
29 Correct 28 ms 14528 KB Output is correct
30 Correct 31 ms 14544 KB Output is correct
31 Correct 33 ms 14540 KB Output is correct
32 Correct 33 ms 14552 KB Output is correct
33 Correct 29 ms 14532 KB Output is correct
34 Correct 27 ms 14644 KB Output is correct
35 Correct 27 ms 14464 KB Output is correct
36 Correct 29 ms 14576 KB Output is correct
37 Correct 29 ms 14424 KB Output is correct
38 Correct 28 ms 14508 KB Output is correct
39 Correct 138 ms 31144 KB Output is correct
40 Correct 136 ms 30932 KB Output is correct
41 Correct 130 ms 31168 KB Output is correct
42 Correct 140 ms 31112 KB Output is correct
43 Correct 142 ms 31068 KB Output is correct
44 Correct 151 ms 31004 KB Output is correct
45 Correct 86 ms 19540 KB Output is correct
46 Correct 97 ms 19776 KB Output is correct
47 Correct 133 ms 30876 KB Output is correct
48 Correct 125 ms 30956 KB Output is correct
49 Correct 134 ms 30916 KB Output is correct
50 Correct 136 ms 30964 KB Output is correct
51 Correct 128 ms 28500 KB Output is correct
52 Correct 149 ms 33728 KB Output is correct
53 Correct 149 ms 26948 KB Output is correct
54 Correct 155 ms 31352 KB Output is correct
55 Correct 765 ms 90312 KB Output is correct
56 Correct 635 ms 77092 KB Output is correct
57 Correct 873 ms 98124 KB Output is correct
58 Correct 745 ms 86580 KB Output is correct
59 Correct 745 ms 73800 KB Output is correct
60 Execution timed out 1022 ms 93288 KB Time limit exceeded
61 Halted 0 ms 0 KB -