oj.uz

답안 #421886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421886 2021-06-09T13:16:53 Z tqbfjotld 푸드 코트 (JOI21_foodcourt) C++14
89 / 100
 1000 ms 98508 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;
    node *l,*r;
    node (int32_t _s, int32_t _e){
        s = _s; e = _e; m = (s+e)/2;
        lazymin = 0; lazych = 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){
            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 -lazymin+lazych;
        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});
    }
    if (m==1){
        for (auto x : query3){
            if (ans[x.second]==-1) printf("0\n");
            else printf("1\n");
        }
        return 0;
    }
    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:166:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  166 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14436 KB Output is correct
2 Correct 27 ms 14576 KB Output is correct
3 Correct 29 ms 14500 KB Output is correct
4 Correct 29 ms 14544 KB Output is correct
5 Correct 26 ms 14172 KB Output is correct
6 Correct 26 ms 14156 KB Output is correct
7 Correct 30 ms 14500 KB Output is correct
8 Correct 29 ms 14572 KB Output is correct
9 Correct 29 ms 14612 KB Output is correct
10 Correct 30 ms 14524 KB Output is correct
11 Correct 29 ms 14656 KB Output is correct
12 Correct 31 ms 14600 KB Output is correct
13 Correct 27 ms 14504 KB Output is correct
14 Correct 26 ms 14668 KB Output is correct
15 Correct 27 ms 14516 KB Output is correct
16 Correct 30 ms 14656 KB Output is correct
17 Correct 28 ms 14448 KB Output is correct
18 Correct 30 ms 14556 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 28 ms 14528 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14436 KB Output is correct
2 Correct 27 ms 14576 KB Output is correct
3 Correct 29 ms 14500 KB Output is correct
4 Correct 29 ms 14544 KB Output is correct
5 Correct 26 ms 14172 KB Output is correct
6 Correct 26 ms 14156 KB Output is correct
7 Correct 30 ms 14500 KB Output is correct
8 Correct 29 ms 14572 KB Output is correct
9 Correct 29 ms 14612 KB Output is correct
10 Correct 30 ms 14524 KB Output is correct
11 Correct 29 ms 14656 KB Output is correct
12 Correct 31 ms 14600 KB Output is correct
13 Correct 27 ms 14504 KB Output is correct
14 Correct 26 ms 14668 KB Output is correct
15 Correct 27 ms 14516 KB Output is correct
16 Correct 30 ms 14656 KB Output is correct
17 Correct 28 ms 14448 KB Output is correct
18 Correct 30 ms 14556 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 28 ms 14528 KB Output is correct
21 Correct 30 ms 14548 KB Output is correct
22 Correct 29 ms 14556 KB Output is correct
23 Correct 32 ms 14412 KB Output is correct
24 Correct 31 ms 14568 KB Output is correct
25 Correct 26 ms 14132 KB Output is correct
26 Correct 27 ms 14156 KB Output is correct
27 Correct 29 ms 14524 KB Output is correct
28 Correct 29 ms 14652 KB Output is correct
29 Correct 29 ms 14548 KB Output is correct
30 Correct 28 ms 14652 KB Output is correct
31 Correct 29 ms 14528 KB Output is correct
32 Correct 31 ms 14544 KB Output is correct
33 Correct 27 ms 14580 KB Output is correct
34 Correct 31 ms 14668 KB Output is correct
35 Correct 28 ms 14504 KB Output is correct
36 Correct 28 ms 14768 KB Output is correct
37 Correct 28 ms 14436 KB Output is correct
38 Correct 29 ms 14540 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 31036 KB Output is correct
2 Correct 136 ms 30960 KB Output is correct
3 Correct 132 ms 31104 KB Output is correct
4 Correct 127 ms 31164 KB Output is correct
5 Correct 171 ms 31056 KB Output is correct
6 Correct 141 ms 31084 KB Output is correct
7 Correct 90 ms 19516 KB Output is correct
8 Correct 92 ms 19788 KB Output is correct
9 Correct 137 ms 30864 KB Output is correct
10 Correct 135 ms 31060 KB Output is correct
11 Correct 153 ms 30896 KB Output is correct
12 Correct 123 ms 30920 KB Output is correct
13 Correct 129 ms 28508 KB Output is correct
14 Correct 142 ms 33688 KB Output is correct
15 Correct 139 ms 26776 KB Output is correct
16 Correct 147 ms 31340 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 53384 KB Output is correct
2 Correct 290 ms 47208 KB Output is correct
3 Correct 384 ms 57672 KB Output is correct
4 Correct 336 ms 53324 KB Output is correct
5 Correct 285 ms 45592 KB Output is correct
6 Correct 429 ms 56876 KB Output is correct
7 Correct 44 ms 24500 KB Output is correct
8 Correct 45 ms 24636 KB Output is correct
9 Correct 377 ms 59400 KB Output is correct
10 Correct 361 ms 59364 KB Output is correct
11 Correct 433 ms 54544 KB Output is correct
12 Correct 398 ms 56944 KB Output is correct
13 Correct 438 ms 54604 KB Output is correct
14 Correct 455 ms 56900 KB Output is correct
15 Correct 412 ms 56884 KB Output is correct
16 Correct 406 ms 56892 KB Output is correct
17 Correct 397 ms 56920 KB Output is correct
18 Correct 406 ms 55780 KB Output is correct
19 Correct 421 ms 57004 KB Output is correct
20 Correct 441 ms 55796 KB Output is correct
21 Correct 414 ms 56892 KB Output is correct
22 Correct 438 ms 56824 KB Output is correct
23 Correct 438 ms 56888 KB Output is correct
24 Correct 435 ms 56884 KB Output is correct
25 Correct 243 ms 48552 KB Output is correct
26 Correct 268 ms 55896 KB Output is correct
27 Correct 260 ms 54360 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14436 KB Output is correct
2 Correct 27 ms 14576 KB Output is correct
3 Correct 29 ms 14500 KB Output is correct
4 Correct 29 ms 14544 KB Output is correct
5 Correct 26 ms 14172 KB Output is correct
6 Correct 26 ms 14156 KB Output is correct
7 Correct 30 ms 14500 KB Output is correct
8 Correct 29 ms 14572 KB Output is correct
9 Correct 29 ms 14612 KB Output is correct
10 Correct 30 ms 14524 KB Output is correct
11 Correct 29 ms 14656 KB Output is correct
12 Correct 31 ms 14600 KB Output is correct
13 Correct 27 ms 14504 KB Output is correct
14 Correct 26 ms 14668 KB Output is correct
15 Correct 27 ms 14516 KB Output is correct
16 Correct 30 ms 14656 KB Output is correct
17 Correct 28 ms 14448 KB Output is correct
18 Correct 30 ms 14556 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 28 ms 14528 KB Output is correct
21 Correct 138 ms 31036 KB Output is correct
22 Correct 136 ms 30960 KB Output is correct
23 Correct 132 ms 31104 KB Output is correct
24 Correct 127 ms 31164 KB Output is correct
25 Correct 171 ms 31056 KB Output is correct
26 Correct 141 ms 31084 KB Output is correct
27 Correct 90 ms 19516 KB Output is correct
28 Correct 92 ms 19788 KB Output is correct
29 Correct 137 ms 30864 KB Output is correct
30 Correct 135 ms 31060 KB Output is correct
31 Correct 153 ms 30896 KB Output is correct
32 Correct 123 ms 30920 KB Output is correct
33 Correct 129 ms 28508 KB Output is correct
34 Correct 142 ms 33688 KB Output is correct
35 Correct 139 ms 26776 KB Output is correct
36 Correct 147 ms 31340 KB Output is correct
37 Correct 172 ms 33580 KB Output is correct
38 Correct 204 ms 31856 KB Output is correct
39 Correct 121 ms 19392 KB Output is correct
40 Correct 100 ms 20180 KB Output is correct
41 Correct 191 ms 33440 KB Output is correct
42 Correct 236 ms 34696 KB Output is correct
43 Correct 218 ms 34752 KB Output is correct
44 Correct 214 ms 34120 KB Output is correct
45 Correct 204 ms 34740 KB Output is correct
46 Correct 204 ms 34944 KB Output is correct
47 Correct 143 ms 35780 KB Output is correct
48 Correct 165 ms 35708 KB Output is correct
49 Correct 139 ms 28300 KB Output is correct
50 Correct 219 ms 33296 KB Output is correct
51 Correct 202 ms 34332 KB Output is correct
52 Correct 199 ms 34388 KB Output is correct
53 Correct 129 ms 28868 KB Output is correct
54 Correct 191 ms 31408 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 34804 KB Output is correct
2 Correct 211 ms 33848 KB Output is correct
3 Correct 271 ms 36152 KB Output is correct
4 Correct 186 ms 33348 KB Output is correct
5 Correct 210 ms 34680 KB Output is correct
6 Correct 247 ms 36268 KB Output is correct
7 Correct 133 ms 21000 KB Output is correct
8 Correct 127 ms 20624 KB Output is correct
9 Correct 165 ms 36216 KB Output is correct
10 Correct 161 ms 32300 KB Output is correct
11 Correct 219 ms 36240 KB Output is correct
12 Correct 208 ms 36244 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14436 KB Output is correct
2 Correct 27 ms 14576 KB Output is correct
3 Correct 29 ms 14500 KB Output is correct
4 Correct 29 ms 14544 KB Output is correct
5 Correct 26 ms 14172 KB Output is correct
6 Correct 26 ms 14156 KB Output is correct
7 Correct 30 ms 14500 KB Output is correct
8 Correct 29 ms 14572 KB Output is correct
9 Correct 29 ms 14612 KB Output is correct
10 Correct 30 ms 14524 KB Output is correct
11 Correct 29 ms 14656 KB Output is correct
12 Correct 31 ms 14600 KB Output is correct
13 Correct 27 ms 14504 KB Output is correct
14 Correct 26 ms 14668 KB Output is correct
15 Correct 27 ms 14516 KB Output is correct
16 Correct 30 ms 14656 KB Output is correct
17 Correct 28 ms 14448 KB Output is correct
18 Correct 30 ms 14556 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 28 ms 14528 KB Output is correct
21 Correct 30 ms 14548 KB Output is correct
22 Correct 29 ms 14556 KB Output is correct
23 Correct 32 ms 14412 KB Output is correct
24 Correct 31 ms 14568 KB Output is correct
25 Correct 26 ms 14132 KB Output is correct
26 Correct 27 ms 14156 KB Output is correct
27 Correct 29 ms 14524 KB Output is correct
28 Correct 29 ms 14652 KB Output is correct
29 Correct 29 ms 14548 KB Output is correct
30 Correct 28 ms 14652 KB Output is correct
31 Correct 29 ms 14528 KB Output is correct
32 Correct 31 ms 14544 KB Output is correct
33 Correct 27 ms 14580 KB Output is correct
34 Correct 31 ms 14668 KB Output is correct
35 Correct 28 ms 14504 KB Output is correct
36 Correct 28 ms 14768 KB Output is correct
37 Correct 28 ms 14436 KB Output is correct
38 Correct 29 ms 14540 KB Output is correct
39 Correct 138 ms 31036 KB Output is correct
40 Correct 136 ms 30960 KB Output is correct
41 Correct 132 ms 31104 KB Output is correct
42 Correct 127 ms 31164 KB Output is correct
43 Correct 171 ms 31056 KB Output is correct
44 Correct 141 ms 31084 KB Output is correct
45 Correct 90 ms 19516 KB Output is correct
46 Correct 92 ms 19788 KB Output is correct
47 Correct 137 ms 30864 KB Output is correct
48 Correct 135 ms 31060 KB Output is correct
49 Correct 153 ms 30896 KB Output is correct
50 Correct 123 ms 30920 KB Output is correct
51 Correct 129 ms 28508 KB Output is correct
52 Correct 142 ms 33688 KB Output is correct
53 Correct 139 ms 26776 KB Output is correct
54 Correct 147 ms 31340 KB Output is correct
55 Correct 172 ms 33580 KB Output is correct
56 Correct 204 ms 31856 KB Output is correct
57 Correct 121 ms 19392 KB Output is correct
58 Correct 100 ms 20180 KB Output is correct
59 Correct 191 ms 33440 KB Output is correct
60 Correct 236 ms 34696 KB Output is correct
61 Correct 218 ms 34752 KB Output is correct
62 Correct 214 ms 34120 KB Output is correct
63 Correct 204 ms 34740 KB Output is correct
64 Correct 204 ms 34944 KB Output is correct
65 Correct 143 ms 35780 KB Output is correct
66 Correct 165 ms 35708 KB Output is correct
67 Correct 139 ms 28300 KB Output is correct
68 Correct 219 ms 33296 KB Output is correct
69 Correct 202 ms 34332 KB Output is correct
70 Correct 199 ms 34388 KB Output is correct
71 Correct 129 ms 28868 KB Output is correct
72 Correct 191 ms 31408 KB Output is correct
73 Correct 220 ms 34804 KB Output is correct
74 Correct 211 ms 33848 KB Output is correct
75 Correct 271 ms 36152 KB Output is correct
76 Correct 186 ms 33348 KB Output is correct
77 Correct 210 ms 34680 KB Output is correct
78 Correct 247 ms 36268 KB Output is correct
79 Correct 133 ms 21000 KB Output is correct
80 Correct 127 ms 20624 KB Output is correct
81 Correct 165 ms 36216 KB Output is correct
82 Correct 161 ms 32300 KB Output is correct
83 Correct 219 ms 36240 KB Output is correct
84 Correct 208 ms 36244 KB Output is correct
85 Correct 179 ms 31952 KB Output is correct
86 Correct 200 ms 35724 KB Output is correct
87 Correct 229 ms 32840 KB Output is correct
88 Correct 219 ms 34568 KB Output is correct
89 Correct 146 ms 28752 KB Output is correct
90 Correct 210 ms 34652 KB Output is correct
91 Correct 186 ms 28940 KB Output is correct
92 Correct 151 ms 28816 KB Output is correct
93 Correct 223 ms 34864 KB Output is correct
94 Correct 190 ms 34368 KB Output is correct
95 Correct 189 ms 33300 KB Output is correct
96 Correct 209 ms 34864 KB Output is correct
97 Correct 187 ms 34904 KB Output is correct
98 Correct 165 ms 29788 KB Output is correct
99 Correct 129 ms 35740 KB Output is correct
100 Correct 148 ms 32584 KB Output is correct
101 Correct 172 ms 35872 KB Output is correct
102 Correct 165 ms 33348 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14436 KB Output is correct
2 Correct 27 ms 14576 KB Output is correct
3 Correct 29 ms 14500 KB Output is correct
4 Correct 29 ms 14544 KB Output is correct
5 Correct 26 ms 14172 KB Output is correct
6 Correct 26 ms 14156 KB Output is correct
7 Correct 30 ms 14500 KB Output is correct
8 Correct 29 ms 14572 KB Output is correct
9 Correct 29 ms 14612 KB Output is correct
10 Correct 30 ms 14524 KB Output is correct
11 Correct 29 ms 14656 KB Output is correct
12 Correct 31 ms 14600 KB Output is correct
13 Correct 27 ms 14504 KB Output is correct
14 Correct 26 ms 14668 KB Output is correct
15 Correct 27 ms 14516 KB Output is correct
16 Correct 30 ms 14656 KB Output is correct
17 Correct 28 ms 14448 KB Output is correct
18 Correct 30 ms 14556 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 28 ms 14528 KB Output is correct
21 Correct 30 ms 14548 KB Output is correct
22 Correct 29 ms 14556 KB Output is correct
23 Correct 32 ms 14412 KB Output is correct
24 Correct 31 ms 14568 KB Output is correct
25 Correct 26 ms 14132 KB Output is correct
26 Correct 27 ms 14156 KB Output is correct
27 Correct 29 ms 14524 KB Output is correct
28 Correct 29 ms 14652 KB Output is correct
29 Correct 29 ms 14548 KB Output is correct
30 Correct 28 ms 14652 KB Output is correct
31 Correct 29 ms 14528 KB Output is correct
32 Correct 31 ms 14544 KB Output is correct
33 Correct 27 ms 14580 KB Output is correct
34 Correct 31 ms 14668 KB Output is correct
35 Correct 28 ms 14504 KB Output is correct
36 Correct 28 ms 14768 KB Output is correct
37 Correct 28 ms 14436 KB Output is correct
38 Correct 29 ms 14540 KB Output is correct
39 Correct 138 ms 31036 KB Output is correct
40 Correct 136 ms 30960 KB Output is correct
41 Correct 132 ms 31104 KB Output is correct
42 Correct 127 ms 31164 KB Output is correct
43 Correct 171 ms 31056 KB Output is correct
44 Correct 141 ms 31084 KB Output is correct
45 Correct 90 ms 19516 KB Output is correct
46 Correct 92 ms 19788 KB Output is correct
47 Correct 137 ms 30864 KB Output is correct
48 Correct 135 ms 31060 KB Output is correct
49 Correct 153 ms 30896 KB Output is correct
50 Correct 123 ms 30920 KB Output is correct
51 Correct 129 ms 28508 KB Output is correct
52 Correct 142 ms 33688 KB Output is correct
53 Correct 139 ms 26776 KB Output is correct
54 Correct 147 ms 31340 KB Output is correct
55 Correct 343 ms 53384 KB Output is correct
56 Correct 290 ms 47208 KB Output is correct
57 Correct 384 ms 57672 KB Output is correct
58 Correct 336 ms 53324 KB Output is correct
59 Correct 285 ms 45592 KB Output is correct
60 Correct 429 ms 56876 KB Output is correct
61 Correct 44 ms 24500 KB Output is correct
62 Correct 45 ms 24636 KB Output is correct
63 Correct 377 ms 59400 KB Output is correct
64 Correct 361 ms 59364 KB Output is correct
65 Correct 433 ms 54544 KB Output is correct
66 Correct 398 ms 56944 KB Output is correct
67 Correct 438 ms 54604 KB Output is correct
68 Correct 455 ms 56900 KB Output is correct
69 Correct 412 ms 56884 KB Output is correct
70 Correct 406 ms 56892 KB Output is correct
71 Correct 397 ms 56920 KB Output is correct
72 Correct 406 ms 55780 KB Output is correct
73 Correct 421 ms 57004 KB Output is correct
74 Correct 441 ms 55796 KB Output is correct
75 Correct 414 ms 56892 KB Output is correct
76 Correct 438 ms 56824 KB Output is correct
77 Correct 438 ms 56888 KB Output is correct
78 Correct 435 ms 56884 KB Output is correct
79 Correct 243 ms 48552 KB Output is correct
80 Correct 268 ms 55896 KB Output is correct
81 Correct 260 ms 54360 KB Output is correct
82 Correct 172 ms 33580 KB Output is correct
83 Correct 204 ms 31856 KB Output is correct
84 Correct 121 ms 19392 KB Output is correct
85 Correct 100 ms 20180 KB Output is correct
86 Correct 191 ms 33440 KB Output is correct
87 Correct 236 ms 34696 KB Output is correct
88 Correct 218 ms 34752 KB Output is correct
89 Correct 214 ms 34120 KB Output is correct
90 Correct 204 ms 34740 KB Output is correct
91 Correct 204 ms 34944 KB Output is correct
92 Correct 143 ms 35780 KB Output is correct
93 Correct 165 ms 35708 KB Output is correct
94 Correct 139 ms 28300 KB Output is correct
95 Correct 219 ms 33296 KB Output is correct
96 Correct 202 ms 34332 KB Output is correct
97 Correct 199 ms 34388 KB Output is correct
98 Correct 129 ms 28868 KB Output is correct
99 Correct 191 ms 31408 KB Output is correct
100 Correct 220 ms 34804 KB Output is correct
101 Correct 211 ms 33848 KB Output is correct
102 Correct 271 ms 36152 KB Output is correct
103 Correct 186 ms 33348 KB Output is correct
104 Correct 210 ms 34680 KB Output is correct
105 Correct 247 ms 36268 KB Output is correct
106 Correct 133 ms 21000 KB Output is correct
107 Correct 127 ms 20624 KB Output is correct
108 Correct 165 ms 36216 KB Output is correct
109 Correct 161 ms 32300 KB Output is correct
110 Correct 219 ms 36240 KB Output is correct
111 Correct 208 ms 36244 KB Output is correct
112 Correct 179 ms 31952 KB Output is correct
113 Correct 200 ms 35724 KB Output is correct
114 Correct 229 ms 32840 KB Output is correct
115 Correct 219 ms 34568 KB Output is correct
116 Correct 146 ms 28752 KB Output is correct
117 Correct 210 ms 34652 KB Output is correct
118 Correct 186 ms 28940 KB Output is correct
119 Correct 151 ms 28816 KB Output is correct
120 Correct 223 ms 34864 KB Output is correct
121 Correct 190 ms 34368 KB Output is correct
122 Correct 189 ms 33300 KB Output is correct
123 Correct 209 ms 34864 KB Output is correct
124 Correct 187 ms 34904 KB Output is correct
125 Correct 165 ms 29788 KB Output is correct
126 Correct 129 ms 35740 KB Output is correct
127 Correct 148 ms 32584 KB Output is correct
128 Correct 172 ms 35872 KB Output is correct
129 Correct 165 ms 33348 KB Output is correct
130 Correct 872 ms 97032 KB Output is correct
131 Correct 631 ms 75432 KB Output is correct
132 Correct 845 ms 98508 KB Output is correct
133 Correct 949 ms 90296 KB Output is correct
134 Correct 834 ms 87728 KB Output is correct
135 Execution timed out 1008 ms 93628 KB Time limit exceeded
136 Halted 0 ms 0 KB -