oj.uz

답안 #421858

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


struct node{
    int32_t s,e;
    int lazymin,lazych;
    int v;
    node *l,*r;
    node (int32_t _s, int32_t _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(int32_t a, int32_t 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);
        }
    }
    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<=(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);
        }
    }
    int qu(int32_t pos){
        proc();
        if (s==e) return v;
        if (pos>(s+e)/2)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{
    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:172:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  172 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14412 KB Output is correct
2 Correct 30 ms 14572 KB Output is correct
3 Correct 28 ms 14556 KB Output is correct
4 Correct 29 ms 14532 KB Output is correct
5 Correct 27 ms 14172 KB Output is correct
6 Correct 28 ms 14164 KB Output is correct
7 Correct 29 ms 14512 KB Output is correct
8 Correct 29 ms 14532 KB Output is correct
9 Correct 31 ms 14552 KB Output is correct
10 Correct 31 ms 14636 KB Output is correct
11 Correct 29 ms 14556 KB Output is correct
12 Correct 29 ms 14552 KB Output is correct
13 Correct 28 ms 14484 KB Output is correct
14 Correct 29 ms 14668 KB Output is correct
15 Correct 38 ms 14532 KB Output is correct
16 Correct 29 ms 14568 KB Output is correct
17 Correct 29 ms 14448 KB Output is correct
18 Correct 32 ms 14536 KB Output is correct
19 Correct 28 ms 14452 KB Output is correct
20 Correct 31 ms 14540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14412 KB Output is correct
2 Correct 30 ms 14572 KB Output is correct
3 Correct 28 ms 14556 KB Output is correct
4 Correct 29 ms 14532 KB Output is correct
5 Correct 27 ms 14172 KB Output is correct
6 Correct 28 ms 14164 KB Output is correct
7 Correct 29 ms 14512 KB Output is correct
8 Correct 29 ms 14532 KB Output is correct
9 Correct 31 ms 14552 KB Output is correct
10 Correct 31 ms 14636 KB Output is correct
11 Correct 29 ms 14556 KB Output is correct
12 Correct 29 ms 14552 KB Output is correct
13 Correct 28 ms 14484 KB Output is correct
14 Correct 29 ms 14668 KB Output is correct
15 Correct 38 ms 14532 KB Output is correct
16 Correct 29 ms 14568 KB Output is correct
17 Correct 29 ms 14448 KB Output is correct
18 Correct 32 ms 14536 KB Output is correct
19 Correct 28 ms 14452 KB Output is correct
20 Correct 31 ms 14540 KB Output is correct
21 Correct 29 ms 14644 KB Output is correct
22 Correct 29 ms 14572 KB Output is correct
23 Correct 30 ms 14504 KB Output is correct
24 Correct 29 ms 14548 KB Output is correct
25 Correct 31 ms 14116 KB Output is correct
26 Correct 28 ms 14156 KB Output is correct
27 Correct 30 ms 14512 KB Output is correct
28 Correct 29 ms 14556 KB Output is correct
29 Correct 28 ms 14568 KB Output is correct
30 Correct 27 ms 14640 KB Output is correct
31 Correct 29 ms 14540 KB Output is correct
32 Correct 30 ms 14532 KB Output is correct
33 Correct 29 ms 14488 KB Output is correct
34 Correct 29 ms 14556 KB Output is correct
35 Correct 29 ms 14488 KB Output is correct
36 Correct 29 ms 14572 KB Output is correct
37 Correct 27 ms 14428 KB Output is correct
38 Correct 28 ms 14524 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 31064 KB Output is correct
2 Correct 134 ms 30976 KB Output is correct
3 Correct 125 ms 31160 KB Output is correct
4 Correct 143 ms 31124 KB Output is correct
5 Correct 147 ms 31008 KB Output is correct
6 Correct 139 ms 31044 KB Output is correct
7 Correct 88 ms 19628 KB Output is correct
8 Correct 90 ms 19864 KB Output is correct
9 Correct 156 ms 30992 KB Output is correct
10 Correct 132 ms 30964 KB Output is correct
11 Correct 133 ms 30984 KB Output is correct
12 Correct 132 ms 30920 KB Output is correct
13 Correct 155 ms 28516 KB Output is correct
14 Correct 178 ms 33696 KB Output is correct
15 Correct 141 ms 26812 KB Output is correct
16 Correct 153 ms 31400 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 852 ms 90320 KB Output is correct
2 Correct 645 ms 77208 KB Output is correct
3 Correct 876 ms 98144 KB Output is correct
4 Correct 732 ms 86764 KB Output is correct
5 Correct 689 ms 73816 KB Output is correct
6 Correct 973 ms 93388 KB Output is correct
7 Correct 344 ms 43348 KB Output is correct
8 Correct 341 ms 43452 KB Output is correct
9 Execution timed out 1063 ms 99436 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14412 KB Output is correct
2 Correct 30 ms 14572 KB Output is correct
3 Correct 28 ms 14556 KB Output is correct
4 Correct 29 ms 14532 KB Output is correct
5 Correct 27 ms 14172 KB Output is correct
6 Correct 28 ms 14164 KB Output is correct
7 Correct 29 ms 14512 KB Output is correct
8 Correct 29 ms 14532 KB Output is correct
9 Correct 31 ms 14552 KB Output is correct
10 Correct 31 ms 14636 KB Output is correct
11 Correct 29 ms 14556 KB Output is correct
12 Correct 29 ms 14552 KB Output is correct
13 Correct 28 ms 14484 KB Output is correct
14 Correct 29 ms 14668 KB Output is correct
15 Correct 38 ms 14532 KB Output is correct
16 Correct 29 ms 14568 KB Output is correct
17 Correct 29 ms 14448 KB Output is correct
18 Correct 32 ms 14536 KB Output is correct
19 Correct 28 ms 14452 KB Output is correct
20 Correct 31 ms 14540 KB Output is correct
21 Correct 120 ms 31064 KB Output is correct
22 Correct 134 ms 30976 KB Output is correct
23 Correct 125 ms 31160 KB Output is correct
24 Correct 143 ms 31124 KB Output is correct
25 Correct 147 ms 31008 KB Output is correct
26 Correct 139 ms 31044 KB Output is correct
27 Correct 88 ms 19628 KB Output is correct
28 Correct 90 ms 19864 KB Output is correct
29 Correct 156 ms 30992 KB Output is correct
30 Correct 132 ms 30964 KB Output is correct
31 Correct 133 ms 30984 KB Output is correct
32 Correct 132 ms 30920 KB Output is correct
33 Correct 155 ms 28516 KB Output is correct
34 Correct 178 ms 33696 KB Output is correct
35 Correct 141 ms 26812 KB Output is correct
36 Correct 153 ms 31400 KB Output is correct
37 Correct 169 ms 33604 KB Output is correct
38 Correct 170 ms 31824 KB Output is correct
39 Correct 91 ms 19316 KB Output is correct
40 Correct 96 ms 20132 KB Output is correct
41 Correct 190 ms 33420 KB Output is correct
42 Correct 192 ms 34632 KB Output is correct
43 Correct 193 ms 34756 KB Output is correct
44 Correct 187 ms 34156 KB Output is correct
45 Correct 202 ms 34708 KB Output is correct
46 Correct 195 ms 34856 KB Output is correct
47 Correct 132 ms 35752 KB Output is correct
48 Correct 163 ms 35700 KB Output is correct
49 Correct 133 ms 28276 KB Output is correct
50 Correct 201 ms 33440 KB Output is correct
51 Correct 179 ms 34504 KB Output is correct
52 Correct 182 ms 34352 KB Output is correct
53 Correct 123 ms 28840 KB Output is correct
54 Correct 156 ms 31324 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 34844 KB Output is correct
2 Correct 226 ms 33772 KB Output is correct
3 Correct 257 ms 36228 KB Output is correct
4 Correct 187 ms 33384 KB Output is correct
5 Correct 216 ms 34592 KB Output is correct
6 Correct 251 ms 36260 KB Output is correct
7 Correct 137 ms 21040 KB Output is correct
8 Correct 132 ms 20616 KB Output is correct
9 Correct 179 ms 36180 KB Output is correct
10 Correct 163 ms 32368 KB Output is correct
11 Correct 201 ms 36164 KB Output is correct
12 Correct 222 ms 36228 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14412 KB Output is correct
2 Correct 30 ms 14572 KB Output is correct
3 Correct 28 ms 14556 KB Output is correct
4 Correct 29 ms 14532 KB Output is correct
5 Correct 27 ms 14172 KB Output is correct
6 Correct 28 ms 14164 KB Output is correct
7 Correct 29 ms 14512 KB Output is correct
8 Correct 29 ms 14532 KB Output is correct
9 Correct 31 ms 14552 KB Output is correct
10 Correct 31 ms 14636 KB Output is correct
11 Correct 29 ms 14556 KB Output is correct
12 Correct 29 ms 14552 KB Output is correct
13 Correct 28 ms 14484 KB Output is correct
14 Correct 29 ms 14668 KB Output is correct
15 Correct 38 ms 14532 KB Output is correct
16 Correct 29 ms 14568 KB Output is correct
17 Correct 29 ms 14448 KB Output is correct
18 Correct 32 ms 14536 KB Output is correct
19 Correct 28 ms 14452 KB Output is correct
20 Correct 31 ms 14540 KB Output is correct
21 Correct 29 ms 14644 KB Output is correct
22 Correct 29 ms 14572 KB Output is correct
23 Correct 30 ms 14504 KB Output is correct
24 Correct 29 ms 14548 KB Output is correct
25 Correct 31 ms 14116 KB Output is correct
26 Correct 28 ms 14156 KB Output is correct
27 Correct 30 ms 14512 KB Output is correct
28 Correct 29 ms 14556 KB Output is correct
29 Correct 28 ms 14568 KB Output is correct
30 Correct 27 ms 14640 KB Output is correct
31 Correct 29 ms 14540 KB Output is correct
32 Correct 30 ms 14532 KB Output is correct
33 Correct 29 ms 14488 KB Output is correct
34 Correct 29 ms 14556 KB Output is correct
35 Correct 29 ms 14488 KB Output is correct
36 Correct 29 ms 14572 KB Output is correct
37 Correct 27 ms 14428 KB Output is correct
38 Correct 28 ms 14524 KB Output is correct
39 Correct 120 ms 31064 KB Output is correct
40 Correct 134 ms 30976 KB Output is correct
41 Correct 125 ms 31160 KB Output is correct
42 Correct 143 ms 31124 KB Output is correct
43 Correct 147 ms 31008 KB Output is correct
44 Correct 139 ms 31044 KB Output is correct
45 Correct 88 ms 19628 KB Output is correct
46 Correct 90 ms 19864 KB Output is correct
47 Correct 156 ms 30992 KB Output is correct
48 Correct 132 ms 30964 KB Output is correct
49 Correct 133 ms 30984 KB Output is correct
50 Correct 132 ms 30920 KB Output is correct
51 Correct 155 ms 28516 KB Output is correct
52 Correct 178 ms 33696 KB Output is correct
53 Correct 141 ms 26812 KB Output is correct
54 Correct 153 ms 31400 KB Output is correct
55 Correct 169 ms 33604 KB Output is correct
56 Correct 170 ms 31824 KB Output is correct
57 Correct 91 ms 19316 KB Output is correct
58 Correct 96 ms 20132 KB Output is correct
59 Correct 190 ms 33420 KB Output is correct
60 Correct 192 ms 34632 KB Output is correct
61 Correct 193 ms 34756 KB Output is correct
62 Correct 187 ms 34156 KB Output is correct
63 Correct 202 ms 34708 KB Output is correct
64 Correct 195 ms 34856 KB Output is correct
65 Correct 132 ms 35752 KB Output is correct
66 Correct 163 ms 35700 KB Output is correct
67 Correct 133 ms 28276 KB Output is correct
68 Correct 201 ms 33440 KB Output is correct
69 Correct 179 ms 34504 KB Output is correct
70 Correct 182 ms 34352 KB Output is correct
71 Correct 123 ms 28840 KB Output is correct
72 Correct 156 ms 31324 KB Output is correct
73 Correct 212 ms 34844 KB Output is correct
74 Correct 226 ms 33772 KB Output is correct
75 Correct 257 ms 36228 KB Output is correct
76 Correct 187 ms 33384 KB Output is correct
77 Correct 216 ms 34592 KB Output is correct
78 Correct 251 ms 36260 KB Output is correct
79 Correct 137 ms 21040 KB Output is correct
80 Correct 132 ms 20616 KB Output is correct
81 Correct 179 ms 36180 KB Output is correct
82 Correct 163 ms 32368 KB Output is correct
83 Correct 201 ms 36164 KB Output is correct
84 Correct 222 ms 36228 KB Output is correct
85 Correct 194 ms 32100 KB Output is correct
86 Correct 198 ms 35776 KB Output is correct
87 Correct 219 ms 32808 KB Output is correct
88 Correct 235 ms 34600 KB Output is correct
89 Correct 143 ms 28860 KB Output is correct
90 Correct 252 ms 34644 KB Output is correct
91 Correct 170 ms 28940 KB Output is correct
92 Correct 149 ms 28876 KB Output is correct
93 Correct 197 ms 35000 KB Output is correct
94 Correct 203 ms 34340 KB Output is correct
95 Correct 200 ms 33200 KB Output is correct
96 Correct 183 ms 34780 KB Output is correct
97 Correct 207 ms 34796 KB Output is correct
98 Correct 169 ms 29760 KB Output is correct
99 Correct 133 ms 35780 KB Output is correct
100 Correct 145 ms 32616 KB Output is correct
101 Correct 182 ms 35804 KB Output is correct
102 Correct 167 ms 33420 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 14412 KB Output is correct
2 Correct 30 ms 14572 KB Output is correct
3 Correct 28 ms 14556 KB Output is correct
4 Correct 29 ms 14532 KB Output is correct
5 Correct 27 ms 14172 KB Output is correct
6 Correct 28 ms 14164 KB Output is correct
7 Correct 29 ms 14512 KB Output is correct
8 Correct 29 ms 14532 KB Output is correct
9 Correct 31 ms 14552 KB Output is correct
10 Correct 31 ms 14636 KB Output is correct
11 Correct 29 ms 14556 KB Output is correct
12 Correct 29 ms 14552 KB Output is correct
13 Correct 28 ms 14484 KB Output is correct
14 Correct 29 ms 14668 KB Output is correct
15 Correct 38 ms 14532 KB Output is correct
16 Correct 29 ms 14568 KB Output is correct
17 Correct 29 ms 14448 KB Output is correct
18 Correct 32 ms 14536 KB Output is correct
19 Correct 28 ms 14452 KB Output is correct
20 Correct 31 ms 14540 KB Output is correct
21 Correct 29 ms 14644 KB Output is correct
22 Correct 29 ms 14572 KB Output is correct
23 Correct 30 ms 14504 KB Output is correct
24 Correct 29 ms 14548 KB Output is correct
25 Correct 31 ms 14116 KB Output is correct
26 Correct 28 ms 14156 KB Output is correct
27 Correct 30 ms 14512 KB Output is correct
28 Correct 29 ms 14556 KB Output is correct
29 Correct 28 ms 14568 KB Output is correct
30 Correct 27 ms 14640 KB Output is correct
31 Correct 29 ms 14540 KB Output is correct
32 Correct 30 ms 14532 KB Output is correct
33 Correct 29 ms 14488 KB Output is correct
34 Correct 29 ms 14556 KB Output is correct
35 Correct 29 ms 14488 KB Output is correct
36 Correct 29 ms 14572 KB Output is correct
37 Correct 27 ms 14428 KB Output is correct
38 Correct 28 ms 14524 KB Output is correct
39 Correct 120 ms 31064 KB Output is correct
40 Correct 134 ms 30976 KB Output is correct
41 Correct 125 ms 31160 KB Output is correct
42 Correct 143 ms 31124 KB Output is correct
43 Correct 147 ms 31008 KB Output is correct
44 Correct 139 ms 31044 KB Output is correct
45 Correct 88 ms 19628 KB Output is correct
46 Correct 90 ms 19864 KB Output is correct
47 Correct 156 ms 30992 KB Output is correct
48 Correct 132 ms 30964 KB Output is correct
49 Correct 133 ms 30984 KB Output is correct
50 Correct 132 ms 30920 KB Output is correct
51 Correct 155 ms 28516 KB Output is correct
52 Correct 178 ms 33696 KB Output is correct
53 Correct 141 ms 26812 KB Output is correct
54 Correct 153 ms 31400 KB Output is correct
55 Correct 852 ms 90320 KB Output is correct
56 Correct 645 ms 77208 KB Output is correct
57 Correct 876 ms 98144 KB Output is correct
58 Correct 732 ms 86764 KB Output is correct
59 Correct 689 ms 73816 KB Output is correct
60 Correct 973 ms 93388 KB Output is correct
61 Correct 344 ms 43348 KB Output is correct
62 Correct 341 ms 43452 KB Output is correct
63 Execution timed out 1063 ms 99436 KB Time limit exceeded
64 Halted 0 ms 0 KB -