oj.uz

답안 #421839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421839 2021-06-09T12:53:08 Z tqbfjotld 푸드 코트 (JOI21_foodcourt) C++14
68 / 100
 1000 ms 103924 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(int pos, int val){
    while (pos<250005){
        fw[pos] += val;
        pos+=pos&-pos;
    }
}
int qu(int pos){
    int ans = 0;
    while (pos>0){
        ans += fw[pos];
        pos -= pos&-pos;
    }
    return ans;
}

int numt[250005];
int ans[250005];
vector<pair<pair<int,int>,int> > bsvals[250005];
vector<pair<pair<int,int>,int> > 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;

int incl[250005];
int 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 (int k = 0; k<250005; k++){
            fw[k] = 0;
        }
        for (int 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;
                    assert(ans[x.second]<x.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

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 14476 KB Output is correct
2 Correct 27 ms 14684 KB Output is correct
3 Correct 27 ms 14520 KB Output is correct
4 Correct 30 ms 14668 KB Output is correct
5 Correct 25 ms 14156 KB Output is correct
6 Correct 25 ms 14192 KB Output is correct
7 Correct 28 ms 14668 KB Output is correct
8 Correct 28 ms 14660 KB Output is correct
9 Correct 29 ms 14560 KB Output is correct
10 Correct 28 ms 14584 KB Output is correct
11 Correct 28 ms 14668 KB Output is correct
12 Correct 28 ms 14568 KB Output is correct
13 Correct 26 ms 14568 KB Output is correct
14 Correct 27 ms 14720 KB Output is correct
15 Correct 27 ms 14532 KB Output is correct
16 Correct 28 ms 14696 KB Output is correct
17 Correct 27 ms 14488 KB Output is correct
18 Correct 28 ms 14668 KB Output is correct
19 Correct 28 ms 14472 KB Output is correct
20 Correct 29 ms 14540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 14476 KB Output is correct
2 Correct 27 ms 14684 KB Output is correct
3 Correct 27 ms 14520 KB Output is correct
4 Correct 30 ms 14668 KB Output is correct
5 Correct 25 ms 14156 KB Output is correct
6 Correct 25 ms 14192 KB Output is correct
7 Correct 28 ms 14668 KB Output is correct
8 Correct 28 ms 14660 KB Output is correct
9 Correct 29 ms 14560 KB Output is correct
10 Correct 28 ms 14584 KB Output is correct
11 Correct 28 ms 14668 KB Output is correct
12 Correct 28 ms 14568 KB Output is correct
13 Correct 26 ms 14568 KB Output is correct
14 Correct 27 ms 14720 KB Output is correct
15 Correct 27 ms 14532 KB Output is correct
16 Correct 28 ms 14696 KB Output is correct
17 Correct 27 ms 14488 KB Output is correct
18 Correct 28 ms 14668 KB Output is correct
19 Correct 28 ms 14472 KB Output is correct
20 Correct 29 ms 14540 KB Output is correct
21 Correct 28 ms 14668 KB Output is correct
22 Correct 28 ms 14612 KB Output is correct
23 Correct 30 ms 14508 KB Output is correct
24 Correct 29 ms 14576 KB Output is correct
25 Correct 28 ms 14152 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 30 ms 14668 KB Output is correct
28 Correct 30 ms 14592 KB Output is correct
29 Correct 28 ms 14612 KB Output is correct
30 Correct 29 ms 14680 KB Output is correct
31 Correct 29 ms 14688 KB Output is correct
32 Correct 33 ms 14660 KB Output is correct
33 Correct 28 ms 14544 KB Output is correct
34 Correct 28 ms 14708 KB Output is correct
35 Correct 29 ms 14508 KB Output is correct
36 Correct 29 ms 14700 KB Output is correct
37 Correct 29 ms 14444 KB Output is correct
38 Correct 28 ms 14560 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 31840 KB Output is correct
2 Correct 157 ms 31812 KB Output is correct
3 Correct 147 ms 31888 KB Output is correct
4 Correct 155 ms 32028 KB Output is correct
5 Correct 161 ms 31776 KB Output is correct
6 Correct 147 ms 31792 KB Output is correct
7 Correct 87 ms 20344 KB Output is correct
8 Correct 92 ms 20724 KB Output is correct
9 Correct 165 ms 31616 KB Output is correct
10 Correct 155 ms 31800 KB Output is correct
11 Correct 176 ms 31668 KB Output is correct
12 Correct 141 ms 31824 KB Output is correct
13 Correct 138 ms 29208 KB Output is correct
14 Correct 184 ms 34452 KB Output is correct
15 Correct 169 ms 27584 KB Output is correct
16 Correct 180 ms 32116 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 982 ms 95532 KB Output is correct
2 Correct 678 ms 81304 KB Output is correct
3 Correct 977 ms 103924 KB Output is correct
4 Correct 860 ms 90232 KB Output is correct
5 Correct 824 ms 77404 KB Output is correct
6 Execution timed out 1096 ms 98356 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 14476 KB Output is correct
2 Correct 27 ms 14684 KB Output is correct
3 Correct 27 ms 14520 KB Output is correct
4 Correct 30 ms 14668 KB Output is correct
5 Correct 25 ms 14156 KB Output is correct
6 Correct 25 ms 14192 KB Output is correct
7 Correct 28 ms 14668 KB Output is correct
8 Correct 28 ms 14660 KB Output is correct
9 Correct 29 ms 14560 KB Output is correct
10 Correct 28 ms 14584 KB Output is correct
11 Correct 28 ms 14668 KB Output is correct
12 Correct 28 ms 14568 KB Output is correct
13 Correct 26 ms 14568 KB Output is correct
14 Correct 27 ms 14720 KB Output is correct
15 Correct 27 ms 14532 KB Output is correct
16 Correct 28 ms 14696 KB Output is correct
17 Correct 27 ms 14488 KB Output is correct
18 Correct 28 ms 14668 KB Output is correct
19 Correct 28 ms 14472 KB Output is correct
20 Correct 29 ms 14540 KB Output is correct
21 Correct 143 ms 31840 KB Output is correct
22 Correct 157 ms 31812 KB Output is correct
23 Correct 147 ms 31888 KB Output is correct
24 Correct 155 ms 32028 KB Output is correct
25 Correct 161 ms 31776 KB Output is correct
26 Correct 147 ms 31792 KB Output is correct
27 Correct 87 ms 20344 KB Output is correct
28 Correct 92 ms 20724 KB Output is correct
29 Correct 165 ms 31616 KB Output is correct
30 Correct 155 ms 31800 KB Output is correct
31 Correct 176 ms 31668 KB Output is correct
32 Correct 141 ms 31824 KB Output is correct
33 Correct 138 ms 29208 KB Output is correct
34 Correct 184 ms 34452 KB Output is correct
35 Correct 169 ms 27584 KB Output is correct
36 Correct 180 ms 32116 KB Output is correct
37 Correct 176 ms 34836 KB Output is correct
38 Correct 182 ms 32808 KB Output is correct
39 Correct 109 ms 20228 KB Output is correct
40 Correct 103 ms 21228 KB Output is correct
41 Correct 214 ms 34752 KB Output is correct
42 Correct 223 ms 35860 KB Output is correct
43 Correct 244 ms 35884 KB Output is correct
44 Correct 206 ms 35512 KB Output is correct
45 Correct 206 ms 36164 KB Output is correct
46 Correct 214 ms 35940 KB Output is correct
47 Correct 119 ms 36996 KB Output is correct
48 Correct 170 ms 37044 KB Output is correct
49 Correct 142 ms 29064 KB Output is correct
50 Correct 182 ms 34144 KB Output is correct
51 Correct 201 ms 35324 KB Output is correct
52 Correct 211 ms 35372 KB Output is correct
53 Correct 143 ms 29584 KB Output is correct
54 Correct 173 ms 32200 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 36792 KB Output is correct
2 Correct 232 ms 35984 KB Output is correct
3 Correct 238 ms 38336 KB Output is correct
4 Correct 187 ms 34840 KB Output is correct
5 Correct 200 ms 36556 KB Output is correct
6 Correct 245 ms 38508 KB Output is correct
7 Correct 138 ms 22972 KB Output is correct
8 Correct 126 ms 22456 KB Output is correct
9 Correct 166 ms 38372 KB Output is correct
10 Correct 160 ms 33724 KB Output is correct
11 Correct 215 ms 38396 KB Output is correct
12 Correct 211 ms 38380 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 14476 KB Output is correct
2 Correct 27 ms 14684 KB Output is correct
3 Correct 27 ms 14520 KB Output is correct
4 Correct 30 ms 14668 KB Output is correct
5 Correct 25 ms 14156 KB Output is correct
6 Correct 25 ms 14192 KB Output is correct
7 Correct 28 ms 14668 KB Output is correct
8 Correct 28 ms 14660 KB Output is correct
9 Correct 29 ms 14560 KB Output is correct
10 Correct 28 ms 14584 KB Output is correct
11 Correct 28 ms 14668 KB Output is correct
12 Correct 28 ms 14568 KB Output is correct
13 Correct 26 ms 14568 KB Output is correct
14 Correct 27 ms 14720 KB Output is correct
15 Correct 27 ms 14532 KB Output is correct
16 Correct 28 ms 14696 KB Output is correct
17 Correct 27 ms 14488 KB Output is correct
18 Correct 28 ms 14668 KB Output is correct
19 Correct 28 ms 14472 KB Output is correct
20 Correct 29 ms 14540 KB Output is correct
21 Correct 28 ms 14668 KB Output is correct
22 Correct 28 ms 14612 KB Output is correct
23 Correct 30 ms 14508 KB Output is correct
24 Correct 29 ms 14576 KB Output is correct
25 Correct 28 ms 14152 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 30 ms 14668 KB Output is correct
28 Correct 30 ms 14592 KB Output is correct
29 Correct 28 ms 14612 KB Output is correct
30 Correct 29 ms 14680 KB Output is correct
31 Correct 29 ms 14688 KB Output is correct
32 Correct 33 ms 14660 KB Output is correct
33 Correct 28 ms 14544 KB Output is correct
34 Correct 28 ms 14708 KB Output is correct
35 Correct 29 ms 14508 KB Output is correct
36 Correct 29 ms 14700 KB Output is correct
37 Correct 29 ms 14444 KB Output is correct
38 Correct 28 ms 14560 KB Output is correct
39 Correct 143 ms 31840 KB Output is correct
40 Correct 157 ms 31812 KB Output is correct
41 Correct 147 ms 31888 KB Output is correct
42 Correct 155 ms 32028 KB Output is correct
43 Correct 161 ms 31776 KB Output is correct
44 Correct 147 ms 31792 KB Output is correct
45 Correct 87 ms 20344 KB Output is correct
46 Correct 92 ms 20724 KB Output is correct
47 Correct 165 ms 31616 KB Output is correct
48 Correct 155 ms 31800 KB Output is correct
49 Correct 176 ms 31668 KB Output is correct
50 Correct 141 ms 31824 KB Output is correct
51 Correct 138 ms 29208 KB Output is correct
52 Correct 184 ms 34452 KB Output is correct
53 Correct 169 ms 27584 KB Output is correct
54 Correct 180 ms 32116 KB Output is correct
55 Correct 176 ms 34836 KB Output is correct
56 Correct 182 ms 32808 KB Output is correct
57 Correct 109 ms 20228 KB Output is correct
58 Correct 103 ms 21228 KB Output is correct
59 Correct 214 ms 34752 KB Output is correct
60 Correct 223 ms 35860 KB Output is correct
61 Correct 244 ms 35884 KB Output is correct
62 Correct 206 ms 35512 KB Output is correct
63 Correct 206 ms 36164 KB Output is correct
64 Correct 214 ms 35940 KB Output is correct
65 Correct 119 ms 36996 KB Output is correct
66 Correct 170 ms 37044 KB Output is correct
67 Correct 142 ms 29064 KB Output is correct
68 Correct 182 ms 34144 KB Output is correct
69 Correct 201 ms 35324 KB Output is correct
70 Correct 211 ms 35372 KB Output is correct
71 Correct 143 ms 29584 KB Output is correct
72 Correct 173 ms 32200 KB Output is correct
73 Correct 224 ms 36792 KB Output is correct
74 Correct 232 ms 35984 KB Output is correct
75 Correct 238 ms 38336 KB Output is correct
76 Correct 187 ms 34840 KB Output is correct
77 Correct 200 ms 36556 KB Output is correct
78 Correct 245 ms 38508 KB Output is correct
79 Correct 138 ms 22972 KB Output is correct
80 Correct 126 ms 22456 KB Output is correct
81 Correct 166 ms 38372 KB Output is correct
82 Correct 160 ms 33724 KB Output is correct
83 Correct 215 ms 38396 KB Output is correct
84 Correct 211 ms 38380 KB Output is correct
85 Correct 189 ms 33276 KB Output is correct
86 Correct 200 ms 37184 KB Output is correct
87 Correct 217 ms 33920 KB Output is correct
88 Correct 233 ms 36064 KB Output is correct
89 Correct 141 ms 29644 KB Output is correct
90 Correct 220 ms 35852 KB Output is correct
91 Correct 167 ms 29880 KB Output is correct
92 Correct 158 ms 29760 KB Output is correct
93 Correct 202 ms 36036 KB Output is correct
94 Correct 199 ms 35648 KB Output is correct
95 Correct 201 ms 34468 KB Output is correct
96 Correct 200 ms 35956 KB Output is correct
97 Correct 250 ms 35888 KB Output is correct
98 Correct 167 ms 30788 KB Output is correct
99 Correct 130 ms 37188 KB Output is correct
100 Correct 145 ms 33636 KB Output is correct
101 Correct 172 ms 37080 KB Output is correct
102 Correct 168 ms 34300 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 14476 KB Output is correct
2 Correct 27 ms 14684 KB Output is correct
3 Correct 27 ms 14520 KB Output is correct
4 Correct 30 ms 14668 KB Output is correct
5 Correct 25 ms 14156 KB Output is correct
6 Correct 25 ms 14192 KB Output is correct
7 Correct 28 ms 14668 KB Output is correct
8 Correct 28 ms 14660 KB Output is correct
9 Correct 29 ms 14560 KB Output is correct
10 Correct 28 ms 14584 KB Output is correct
11 Correct 28 ms 14668 KB Output is correct
12 Correct 28 ms 14568 KB Output is correct
13 Correct 26 ms 14568 KB Output is correct
14 Correct 27 ms 14720 KB Output is correct
15 Correct 27 ms 14532 KB Output is correct
16 Correct 28 ms 14696 KB Output is correct
17 Correct 27 ms 14488 KB Output is correct
18 Correct 28 ms 14668 KB Output is correct
19 Correct 28 ms 14472 KB Output is correct
20 Correct 29 ms 14540 KB Output is correct
21 Correct 28 ms 14668 KB Output is correct
22 Correct 28 ms 14612 KB Output is correct
23 Correct 30 ms 14508 KB Output is correct
24 Correct 29 ms 14576 KB Output is correct
25 Correct 28 ms 14152 KB Output is correct
26 Correct 27 ms 14160 KB Output is correct
27 Correct 30 ms 14668 KB Output is correct
28 Correct 30 ms 14592 KB Output is correct
29 Correct 28 ms 14612 KB Output is correct
30 Correct 29 ms 14680 KB Output is correct
31 Correct 29 ms 14688 KB Output is correct
32 Correct 33 ms 14660 KB Output is correct
33 Correct 28 ms 14544 KB Output is correct
34 Correct 28 ms 14708 KB Output is correct
35 Correct 29 ms 14508 KB Output is correct
36 Correct 29 ms 14700 KB Output is correct
37 Correct 29 ms 14444 KB Output is correct
38 Correct 28 ms 14560 KB Output is correct
39 Correct 143 ms 31840 KB Output is correct
40 Correct 157 ms 31812 KB Output is correct
41 Correct 147 ms 31888 KB Output is correct
42 Correct 155 ms 32028 KB Output is correct
43 Correct 161 ms 31776 KB Output is correct
44 Correct 147 ms 31792 KB Output is correct
45 Correct 87 ms 20344 KB Output is correct
46 Correct 92 ms 20724 KB Output is correct
47 Correct 165 ms 31616 KB Output is correct
48 Correct 155 ms 31800 KB Output is correct
49 Correct 176 ms 31668 KB Output is correct
50 Correct 141 ms 31824 KB Output is correct
51 Correct 138 ms 29208 KB Output is correct
52 Correct 184 ms 34452 KB Output is correct
53 Correct 169 ms 27584 KB Output is correct
54 Correct 180 ms 32116 KB Output is correct
55 Correct 982 ms 95532 KB Output is correct
56 Correct 678 ms 81304 KB Output is correct
57 Correct 977 ms 103924 KB Output is correct
58 Correct 860 ms 90232 KB Output is correct
59 Correct 824 ms 77404 KB Output is correct
60 Execution timed out 1096 ms 98356 KB Time limit exceeded
61 Halted 0 ms 0 KB -