oj.uz

Submission #547073

# Submission time Handle Problem Language Result Execution time Memory
547073 2022-04-09T11:48:37 Z leaked Food Court (JOI21_foodcourt) C++14
68 / 100
 1000 ms 63688 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_prep ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
////#define int long long
//#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
const int N=3e5+1;
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
struct fenwick{
    ll fnw[N];
    fenwick(){
        fill(fnw,fnw+N,0);
    }
    void reset(){
        fill(fnw,fnw+N,0);
    }
    void upd(int i,int x){
        ++i;
        while(i<N){
            fnw[i]+=x;
            i+=i&-i;
        }
    }
    ll get(int i){
        ++i;
        ll ans=0;
        while(i>0){
            ans+=fnw[i];
            i-=i&-i;
        }
        return ans;
    }
    void add(int l,int r,ll x){
        upd(l,x);
        upd(r+1,-x);
    }
};

struct segtree{
    ll p1[4*N],p2[4*N];
    int p3[4*N];
    ll mx[4*N],mn[4*N];
    segtree(){
        fill(mx,mx+4*N,0);
        fill(mn,mn+4*N,0);
        fill(p1,p1+4*N,0);
        fill(p2,p2+4*N,0);
        fill(p3,p3+4*N,-1);
    }
    void push(int v,int tl,int tr){
        if(p2[v]!=-1){
//            assert(p1[v]==0);
            for(auto &u : {v<<1,v<<1|1}){
                p2[u]=p2[v];
                mx[u]=mn[u]=p2[v];
                umax(p3[u],p3[v]);
                p1[u]=0;
            }
            p2[v]=-1;
        }
        else{
            for(auto &u : {v<<1,v<<1|1}){
                if(p2[u]!=-1) p2[u]+=p1[v];
                else p1[u]+=p1[v];
                mx[u]+=p1[v];mn[u]+=p1[v];
            }
            p1[v]=0;
        }
    }
    bool check(ll a,ll b,ll c){
        if((a+c)<=0){
            if((b+c)<=0)
                return 1;
            return 0;
        }else return 1;
    }
    void add(int l,int r,int x,int t,int v,int tl,int tr){
        if(tl>r||tr<l) return;
        if(tl>=l&&tr<=r&&check(mn[v],mx[v],x)){
            if((mx[v]+x)<=0){
                p1[v]=0;
                umax(p3[v],t);
                p2[v]=mx[v]=mn[v]=0;
                return;
            }
            if((p2[v]!=-1)) p2[v]+=x;
            else p1[v]+=x;
            mx[v]+=x;mn[v]+=x;
            return;
        }
        int tm=(tl+tr)>>1;push(v,tl,tr);
        add(l,r,x,t,v<<1,tl,tm);add(l,r,x,t,v<<1|1,tm+1,tr);
        mx[v]=max(mx[v<<1],mx[v<<1|1]);
        mn[v]=min(mn[v<<1],mn[v<<1|1]);
    }
    int get(int i,int v,int tl,int tr){
        if(tl==tr)
            return p3[v];
        int tm=(tl+tr)>>1;push(v,tl,tr);
        if(tm>=i)
            return get(i,v<<1,tl,tm);
        else
            return get(i,v<<1|1,tm+1,tr);
    }
}sega;
signed main(){
    fast_prep;
    int n,m,q;
    cin>>n>>m>>q;
    fenwick fen;
    vec<int> tl(q),tr(q);
    vec<int> t(q),l(q),r(q),c(q);
    vec<ll> k(q);
    vec<int> ask;
    vec<ll> rl(q);

    vec<ll> toadd(q);
    vec<vec<int>> need(q,vec<int>());
    for(int i=0;i<q;i++){
        cin>>t[i];
        if(t[i]==1){
            cin>>l[i]>>r[i]>>c[i]>>k[i];
            --l[i];--r[i];
            sega.add(l[i],r[i],k[i],i,1,0,n-1);
        }
        else if(t[i]==2){
            cin>>l[i]>>r[i]>>k[i];
            --l[i];--r[i];
            fen.add(l[i],r[i],k[i]);
            sega.add(l[i],r[i],-k[i],i,1,0,n-1);
        }
        else{
            ask.pb(i);
            cin>>l[i]>>k[i];
            --l[i];
            rl[i]=fen.get(l[i])+k[i];
//            cerr<<"WO "<<sega.get(l[i],1,0,n-1);
            tl[i]=sega.get(l[i],1,0,n-1)+1;tr[i]=i;
            if(tl[i]!=0) need[tl[i]-1].pb(i);
        }
    }
    {
        fen.reset();
        for(int i=0;i<q;i++){
            if(t[i]==1) fen.add(l[i],r[i],k[i]);
            else if(t[i]==2) fen.add(l[i],r[i],-k[i]);
            for(auto &j : need[i]){
                toadd[j]=-fen.get(l[j]);
            }
        }
    }
    if(m==1){
        fen.reset();
        for(int i=0;i<q;i++){
            if(t[i]==1) fen.add(l[i],r[i],k[i]);
            else if(t[i]==3){
                if((fen.get(l[i])+toadd[i])>=rl[i]){
                    cout<<1<<'\n';
                }
                else{
                    cout<<0<<'\n';
                }
            }
        }
        return 0;
    }
    int ok=1;
    while(ok){
        ok=0;
        fen.reset();
        vec<vec<int>> toask(q,vec<int>());
        ///just an id
        for(auto &i : ask){
            if(tl[i]!=tr[i]){
                int tm=(tl[i]+tr[i])>>1;
//                cout<<"HEYASK "<<i<<' '<<tl[i]<<' '<<tr[i]<<' '<<tm<<endl;
                ok=1;
                toask[tm].pb(i);
            }
        }
        if(!ok) break;
        for(int i=0;i<q;i++){
            if(t[i]==1){
                fen.add(l[i],r[i],k[i]);
            }
//            cout<<"I "<<i<<endl;
            for(auto &j : toask[i]){
                ll have=fen.get(l[j])+toadd[j];
//                cout<<"YO "<<c[i]<<' '<<j<<' '<<have<<' '<<rl[j]<<endl;
                if(have>=rl[j]){
                    tr[j]=i;
                }
                else{
                    tl[j]=i+1;
                }
            }
        }
    }
    for(auto &i : ask){
        cout<<(tl[i]==i?0:c[tl[i]])<<'\n';
    }
    return 0;
}
/*
3 5 5
1 2 3 5 2
1 1 2 2 4
2 1 3 3
1 2 3 4 2
3 3 2

3 5 5
1 2 3 5 2
1 1 2 2 4
2 1 3 3
3 1 2
1 2 3 4 2

*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45012 KB Output is correct
2 Correct 23 ms 45100 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 23 ms 45140 KB Output is correct
5 Correct 22 ms 45048 KB Output is correct
6 Correct 22 ms 45012 KB Output is correct
7 Correct 21 ms 45140 KB Output is correct
8 Correct 23 ms 45032 KB Output is correct
9 Correct 22 ms 45084 KB Output is correct
10 Correct 22 ms 45100 KB Output is correct
11 Correct 22 ms 45028 KB Output is correct
12 Correct 21 ms 45108 KB Output is correct
13 Correct 20 ms 45000 KB Output is correct
14 Correct 21 ms 45076 KB Output is correct
15 Correct 22 ms 45056 KB Output is correct
16 Correct 21 ms 45148 KB Output is correct
17 Correct 29 ms 45012 KB Output is correct
18 Correct 24 ms 45136 KB Output is correct
19 Correct 22 ms 45124 KB Output is correct
20 Correct 23 ms 45140 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45012 KB Output is correct
2 Correct 23 ms 45100 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 23 ms 45140 KB Output is correct
5 Correct 22 ms 45048 KB Output is correct
6 Correct 22 ms 45012 KB Output is correct
7 Correct 21 ms 45140 KB Output is correct
8 Correct 23 ms 45032 KB Output is correct
9 Correct 22 ms 45084 KB Output is correct
10 Correct 22 ms 45100 KB Output is correct
11 Correct 22 ms 45028 KB Output is correct
12 Correct 21 ms 45108 KB Output is correct
13 Correct 20 ms 45000 KB Output is correct
14 Correct 21 ms 45076 KB Output is correct
15 Correct 22 ms 45056 KB Output is correct
16 Correct 21 ms 45148 KB Output is correct
17 Correct 29 ms 45012 KB Output is correct
18 Correct 24 ms 45136 KB Output is correct
19 Correct 22 ms 45124 KB Output is correct
20 Correct 23 ms 45140 KB Output is correct
21 Correct 27 ms 45080 KB Output is correct
22 Correct 25 ms 45140 KB Output is correct
23 Correct 22 ms 45012 KB Output is correct
24 Correct 22 ms 45092 KB Output is correct
25 Correct 20 ms 45088 KB Output is correct
26 Correct 21 ms 45068 KB Output is correct
27 Correct 23 ms 45052 KB Output is correct
28 Correct 22 ms 45136 KB Output is correct
29 Correct 22 ms 45140 KB Output is correct
30 Correct 22 ms 45116 KB Output is correct
31 Correct 23 ms 45140 KB Output is correct
32 Correct 23 ms 45140 KB Output is correct
33 Correct 21 ms 45080 KB Output is correct
34 Correct 25 ms 45160 KB Output is correct
35 Correct 20 ms 45128 KB Output is correct
36 Correct 22 ms 45124 KB Output is correct
37 Correct 20 ms 45012 KB Output is correct
38 Correct 22 ms 45140 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 51932 KB Output is correct
2 Correct 133 ms 51732 KB Output is correct
3 Correct 126 ms 52036 KB Output is correct
4 Correct 111 ms 51944 KB Output is correct
5 Correct 134 ms 51784 KB Output is correct
6 Correct 127 ms 51812 KB Output is correct
7 Correct 57 ms 51420 KB Output is correct
8 Correct 59 ms 51600 KB Output is correct
9 Correct 120 ms 51788 KB Output is correct
10 Correct 151 ms 51760 KB Output is correct
11 Correct 111 ms 51656 KB Output is correct
12 Correct 114 ms 51668 KB Output is correct
13 Correct 118 ms 51152 KB Output is correct
14 Correct 151 ms 51908 KB Output is correct
15 Correct 150 ms 51472 KB Output is correct
16 Correct 146 ms 51536 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 62052 KB Output is correct
2 Correct 417 ms 58736 KB Output is correct
3 Correct 432 ms 63460 KB Output is correct
4 Correct 291 ms 58028 KB Output is correct
5 Correct 316 ms 58484 KB Output is correct
6 Correct 403 ms 63336 KB Output is correct
7 Correct 137 ms 63560 KB Output is correct
8 Correct 133 ms 63688 KB Output is correct
9 Correct 356 ms 63352 KB Output is correct
10 Correct 343 ms 63400 KB Output is correct
11 Correct 422 ms 63080 KB Output is correct
12 Correct 420 ms 63024 KB Output is correct
13 Correct 398 ms 63052 KB Output is correct
14 Correct 465 ms 63176 KB Output is correct
15 Correct 513 ms 63304 KB Output is correct
16 Correct 465 ms 63348 KB Output is correct
17 Correct 465 ms 63244 KB Output is correct
18 Correct 440 ms 63252 KB Output is correct
19 Correct 452 ms 63236 KB Output is correct
20 Correct 439 ms 63268 KB Output is correct
21 Correct 472 ms 63372 KB Output is correct
22 Correct 467 ms 63336 KB Output is correct
23 Correct 472 ms 63488 KB Output is correct
24 Correct 450 ms 63292 KB Output is correct
25 Correct 374 ms 63404 KB Output is correct
26 Correct 312 ms 63532 KB Output is correct
27 Execution timed out 1095 ms 62748 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45012 KB Output is correct
2 Correct 23 ms 45100 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 23 ms 45140 KB Output is correct
5 Correct 22 ms 45048 KB Output is correct
6 Correct 22 ms 45012 KB Output is correct
7 Correct 21 ms 45140 KB Output is correct
8 Correct 23 ms 45032 KB Output is correct
9 Correct 22 ms 45084 KB Output is correct
10 Correct 22 ms 45100 KB Output is correct
11 Correct 22 ms 45028 KB Output is correct
12 Correct 21 ms 45108 KB Output is correct
13 Correct 20 ms 45000 KB Output is correct
14 Correct 21 ms 45076 KB Output is correct
15 Correct 22 ms 45056 KB Output is correct
16 Correct 21 ms 45148 KB Output is correct
17 Correct 29 ms 45012 KB Output is correct
18 Correct 24 ms 45136 KB Output is correct
19 Correct 22 ms 45124 KB Output is correct
20 Correct 23 ms 45140 KB Output is correct
21 Correct 132 ms 51932 KB Output is correct
22 Correct 133 ms 51732 KB Output is correct
23 Correct 126 ms 52036 KB Output is correct
24 Correct 111 ms 51944 KB Output is correct
25 Correct 134 ms 51784 KB Output is correct
26 Correct 127 ms 51812 KB Output is correct
27 Correct 57 ms 51420 KB Output is correct
28 Correct 59 ms 51600 KB Output is correct
29 Correct 120 ms 51788 KB Output is correct
30 Correct 151 ms 51760 KB Output is correct
31 Correct 111 ms 51656 KB Output is correct
32 Correct 114 ms 51668 KB Output is correct
33 Correct 118 ms 51152 KB Output is correct
34 Correct 151 ms 51908 KB Output is correct
35 Correct 150 ms 51472 KB Output is correct
36 Correct 146 ms 51536 KB Output is correct
37 Correct 142 ms 51184 KB Output is correct
38 Correct 157 ms 50288 KB Output is correct
39 Correct 93 ms 50428 KB Output is correct
40 Correct 101 ms 51176 KB Output is correct
41 Correct 160 ms 51576 KB Output is correct
42 Correct 162 ms 51668 KB Output is correct
43 Correct 159 ms 51708 KB Output is correct
44 Correct 162 ms 51656 KB Output is correct
45 Correct 166 ms 51664 KB Output is correct
46 Correct 163 ms 51728 KB Output is correct
47 Correct 103 ms 52032 KB Output is correct
48 Correct 141 ms 51896 KB Output is correct
49 Correct 129 ms 49648 KB Output is correct
50 Correct 147 ms 50632 KB Output is correct
51 Correct 188 ms 51632 KB Output is correct
52 Correct 201 ms 51672 KB Output is correct
53 Correct 108 ms 50036 KB Output is correct
54 Correct 162 ms 51440 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 51364 KB Output is correct
2 Correct 171 ms 51944 KB Output is correct
3 Correct 194 ms 52052 KB Output is correct
4 Correct 130 ms 49984 KB Output is correct
5 Correct 157 ms 51156 KB Output is correct
6 Correct 169 ms 52156 KB Output is correct
7 Correct 134 ms 51328 KB Output is correct
8 Correct 124 ms 50924 KB Output is correct
9 Correct 138 ms 52128 KB Output is correct
10 Correct 126 ms 49816 KB Output is correct
11 Correct 177 ms 52112 KB Output is correct
12 Correct 164 ms 52052 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45012 KB Output is correct
2 Correct 23 ms 45100 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 23 ms 45140 KB Output is correct
5 Correct 22 ms 45048 KB Output is correct
6 Correct 22 ms 45012 KB Output is correct
7 Correct 21 ms 45140 KB Output is correct
8 Correct 23 ms 45032 KB Output is correct
9 Correct 22 ms 45084 KB Output is correct
10 Correct 22 ms 45100 KB Output is correct
11 Correct 22 ms 45028 KB Output is correct
12 Correct 21 ms 45108 KB Output is correct
13 Correct 20 ms 45000 KB Output is correct
14 Correct 21 ms 45076 KB Output is correct
15 Correct 22 ms 45056 KB Output is correct
16 Correct 21 ms 45148 KB Output is correct
17 Correct 29 ms 45012 KB Output is correct
18 Correct 24 ms 45136 KB Output is correct
19 Correct 22 ms 45124 KB Output is correct
20 Correct 23 ms 45140 KB Output is correct
21 Correct 27 ms 45080 KB Output is correct
22 Correct 25 ms 45140 KB Output is correct
23 Correct 22 ms 45012 KB Output is correct
24 Correct 22 ms 45092 KB Output is correct
25 Correct 20 ms 45088 KB Output is correct
26 Correct 21 ms 45068 KB Output is correct
27 Correct 23 ms 45052 KB Output is correct
28 Correct 22 ms 45136 KB Output is correct
29 Correct 22 ms 45140 KB Output is correct
30 Correct 22 ms 45116 KB Output is correct
31 Correct 23 ms 45140 KB Output is correct
32 Correct 23 ms 45140 KB Output is correct
33 Correct 21 ms 45080 KB Output is correct
34 Correct 25 ms 45160 KB Output is correct
35 Correct 20 ms 45128 KB Output is correct
36 Correct 22 ms 45124 KB Output is correct
37 Correct 20 ms 45012 KB Output is correct
38 Correct 22 ms 45140 KB Output is correct
39 Correct 132 ms 51932 KB Output is correct
40 Correct 133 ms 51732 KB Output is correct
41 Correct 126 ms 52036 KB Output is correct
42 Correct 111 ms 51944 KB Output is correct
43 Correct 134 ms 51784 KB Output is correct
44 Correct 127 ms 51812 KB Output is correct
45 Correct 57 ms 51420 KB Output is correct
46 Correct 59 ms 51600 KB Output is correct
47 Correct 120 ms 51788 KB Output is correct
48 Correct 151 ms 51760 KB Output is correct
49 Correct 111 ms 51656 KB Output is correct
50 Correct 114 ms 51668 KB Output is correct
51 Correct 118 ms 51152 KB Output is correct
52 Correct 151 ms 51908 KB Output is correct
53 Correct 150 ms 51472 KB Output is correct
54 Correct 146 ms 51536 KB Output is correct
55 Correct 142 ms 51184 KB Output is correct
56 Correct 157 ms 50288 KB Output is correct
57 Correct 93 ms 50428 KB Output is correct
58 Correct 101 ms 51176 KB Output is correct
59 Correct 160 ms 51576 KB Output is correct
60 Correct 162 ms 51668 KB Output is correct
61 Correct 159 ms 51708 KB Output is correct
62 Correct 162 ms 51656 KB Output is correct
63 Correct 166 ms 51664 KB Output is correct
64 Correct 163 ms 51728 KB Output is correct
65 Correct 103 ms 52032 KB Output is correct
66 Correct 141 ms 51896 KB Output is correct
67 Correct 129 ms 49648 KB Output is correct
68 Correct 147 ms 50632 KB Output is correct
69 Correct 188 ms 51632 KB Output is correct
70 Correct 201 ms 51672 KB Output is correct
71 Correct 108 ms 50036 KB Output is correct
72 Correct 162 ms 51440 KB Output is correct
73 Correct 165 ms 51364 KB Output is correct
74 Correct 171 ms 51944 KB Output is correct
75 Correct 194 ms 52052 KB Output is correct
76 Correct 130 ms 49984 KB Output is correct
77 Correct 157 ms 51156 KB Output is correct
78 Correct 169 ms 52156 KB Output is correct
79 Correct 134 ms 51328 KB Output is correct
80 Correct 124 ms 50924 KB Output is correct
81 Correct 138 ms 52128 KB Output is correct
82 Correct 126 ms 49816 KB Output is correct
83 Correct 177 ms 52112 KB Output is correct
84 Correct 164 ms 52052 KB Output is correct
85 Correct 154 ms 51308 KB Output is correct
86 Correct 162 ms 51840 KB Output is correct
87 Correct 135 ms 50908 KB Output is correct
88 Correct 165 ms 51628 KB Output is correct
89 Correct 119 ms 49456 KB Output is correct
90 Correct 150 ms 51624 KB Output is correct
91 Correct 124 ms 50484 KB Output is correct
92 Correct 136 ms 50244 KB Output is correct
93 Correct 153 ms 51728 KB Output is correct
94 Correct 155 ms 51648 KB Output is correct
95 Correct 156 ms 51536 KB Output is correct
96 Correct 150 ms 51708 KB Output is correct
97 Correct 161 ms 51780 KB Output is correct
98 Correct 145 ms 50736 KB Output is correct
99 Correct 124 ms 52004 KB Output is correct
100 Correct 118 ms 50844 KB Output is correct
101 Correct 167 ms 52024 KB Output is correct
102 Correct 538 ms 51396 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45012 KB Output is correct
2 Correct 23 ms 45100 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 23 ms 45140 KB Output is correct
5 Correct 22 ms 45048 KB Output is correct
6 Correct 22 ms 45012 KB Output is correct
7 Correct 21 ms 45140 KB Output is correct
8 Correct 23 ms 45032 KB Output is correct
9 Correct 22 ms 45084 KB Output is correct
10 Correct 22 ms 45100 KB Output is correct
11 Correct 22 ms 45028 KB Output is correct
12 Correct 21 ms 45108 KB Output is correct
13 Correct 20 ms 45000 KB Output is correct
14 Correct 21 ms 45076 KB Output is correct
15 Correct 22 ms 45056 KB Output is correct
16 Correct 21 ms 45148 KB Output is correct
17 Correct 29 ms 45012 KB Output is correct
18 Correct 24 ms 45136 KB Output is correct
19 Correct 22 ms 45124 KB Output is correct
20 Correct 23 ms 45140 KB Output is correct
21 Correct 27 ms 45080 KB Output is correct
22 Correct 25 ms 45140 KB Output is correct
23 Correct 22 ms 45012 KB Output is correct
24 Correct 22 ms 45092 KB Output is correct
25 Correct 20 ms 45088 KB Output is correct
26 Correct 21 ms 45068 KB Output is correct
27 Correct 23 ms 45052 KB Output is correct
28 Correct 22 ms 45136 KB Output is correct
29 Correct 22 ms 45140 KB Output is correct
30 Correct 22 ms 45116 KB Output is correct
31 Correct 23 ms 45140 KB Output is correct
32 Correct 23 ms 45140 KB Output is correct
33 Correct 21 ms 45080 KB Output is correct
34 Correct 25 ms 45160 KB Output is correct
35 Correct 20 ms 45128 KB Output is correct
36 Correct 22 ms 45124 KB Output is correct
37 Correct 20 ms 45012 KB Output is correct
38 Correct 22 ms 45140 KB Output is correct
39 Correct 132 ms 51932 KB Output is correct
40 Correct 133 ms 51732 KB Output is correct
41 Correct 126 ms 52036 KB Output is correct
42 Correct 111 ms 51944 KB Output is correct
43 Correct 134 ms 51784 KB Output is correct
44 Correct 127 ms 51812 KB Output is correct
45 Correct 57 ms 51420 KB Output is correct
46 Correct 59 ms 51600 KB Output is correct
47 Correct 120 ms 51788 KB Output is correct
48 Correct 151 ms 51760 KB Output is correct
49 Correct 111 ms 51656 KB Output is correct
50 Correct 114 ms 51668 KB Output is correct
51 Correct 118 ms 51152 KB Output is correct
52 Correct 151 ms 51908 KB Output is correct
53 Correct 150 ms 51472 KB Output is correct
54 Correct 146 ms 51536 KB Output is correct
55 Correct 409 ms 62052 KB Output is correct
56 Correct 417 ms 58736 KB Output is correct
57 Correct 432 ms 63460 KB Output is correct
58 Correct 291 ms 58028 KB Output is correct
59 Correct 316 ms 58484 KB Output is correct
60 Correct 403 ms 63336 KB Output is correct
61 Correct 137 ms 63560 KB Output is correct
62 Correct 133 ms 63688 KB Output is correct
63 Correct 356 ms 63352 KB Output is correct
64 Correct 343 ms 63400 KB Output is correct
65 Correct 422 ms 63080 KB Output is correct
66 Correct 420 ms 63024 KB Output is correct
67 Correct 398 ms 63052 KB Output is correct
68 Correct 465 ms 63176 KB Output is correct
69 Correct 513 ms 63304 KB Output is correct
70 Correct 465 ms 63348 KB Output is correct
71 Correct 465 ms 63244 KB Output is correct
72 Correct 440 ms 63252 KB Output is correct
73 Correct 452 ms 63236 KB Output is correct
74 Correct 439 ms 63268 KB Output is correct
75 Correct 472 ms 63372 KB Output is correct
76 Correct 467 ms 63336 KB Output is correct
77 Correct 472 ms 63488 KB Output is correct
78 Correct 450 ms 63292 KB Output is correct
79 Correct 374 ms 63404 KB Output is correct
80 Correct 312 ms 63532 KB Output is correct
81 Execution timed out 1095 ms 62748 KB Time limit exceeded
82 Halted 0 ms 0 KB -