oj.uz

Submission #547072

# Submission time Handle Problem Language Result Execution time Memory
547072 2022-04-09T11:47:51 Z leaked Food Court (JOI21_foodcourt) C++14
68 / 100
 1000 ms 56196 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=250'000+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 17 ms 37588 KB Output is correct
2 Correct 17 ms 37664 KB Output is correct
3 Correct 17 ms 37548 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 18 ms 37648 KB Output is correct
6 Correct 17 ms 37600 KB Output is correct
7 Correct 22 ms 37588 KB Output is correct
8 Correct 20 ms 37716 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 19 ms 37628 KB Output is correct
11 Correct 18 ms 37644 KB Output is correct
12 Correct 18 ms 37588 KB Output is correct
13 Correct 17 ms 37624 KB Output is correct
14 Correct 18 ms 37720 KB Output is correct
15 Correct 19 ms 37600 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 19 ms 37556 KB Output is correct
18 Correct 22 ms 37592 KB Output is correct
19 Correct 19 ms 37588 KB Output is correct
20 Correct 19 ms 37588 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37588 KB Output is correct
2 Correct 17 ms 37664 KB Output is correct
3 Correct 17 ms 37548 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 18 ms 37648 KB Output is correct
6 Correct 17 ms 37600 KB Output is correct
7 Correct 22 ms 37588 KB Output is correct
8 Correct 20 ms 37716 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 19 ms 37628 KB Output is correct
11 Correct 18 ms 37644 KB Output is correct
12 Correct 18 ms 37588 KB Output is correct
13 Correct 17 ms 37624 KB Output is correct
14 Correct 18 ms 37720 KB Output is correct
15 Correct 19 ms 37600 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 19 ms 37556 KB Output is correct
18 Correct 22 ms 37592 KB Output is correct
19 Correct 19 ms 37588 KB Output is correct
20 Correct 19 ms 37588 KB Output is correct
21 Correct 19 ms 37680 KB Output is correct
22 Correct 18 ms 37716 KB Output is correct
23 Correct 19 ms 37588 KB Output is correct
24 Correct 19 ms 37588 KB Output is correct
25 Correct 17 ms 37588 KB Output is correct
26 Correct 17 ms 37568 KB Output is correct
27 Correct 19 ms 37588 KB Output is correct
28 Correct 21 ms 37700 KB Output is correct
29 Correct 19 ms 37640 KB Output is correct
30 Correct 18 ms 37596 KB Output is correct
31 Correct 19 ms 37588 KB Output is correct
32 Correct 18 ms 37716 KB Output is correct
33 Correct 18 ms 37588 KB Output is correct
34 Correct 19 ms 37724 KB Output is correct
35 Correct 18 ms 37636 KB Output is correct
36 Correct 19 ms 37640 KB Output is correct
37 Correct 17 ms 37588 KB Output is correct
38 Correct 19 ms 37588 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 44504 KB Output is correct
2 Correct 116 ms 44288 KB Output is correct
3 Correct 128 ms 44556 KB Output is correct
4 Correct 108 ms 44464 KB Output is correct
5 Correct 153 ms 44268 KB Output is correct
6 Correct 157 ms 44252 KB Output is correct
7 Correct 50 ms 43880 KB Output is correct
8 Correct 55 ms 44068 KB Output is correct
9 Correct 122 ms 44260 KB Output is correct
10 Correct 150 ms 44292 KB Output is correct
11 Correct 107 ms 44288 KB Output is correct
12 Correct 104 ms 44300 KB Output is correct
13 Correct 116 ms 43772 KB Output is correct
14 Correct 154 ms 44440 KB Output is correct
15 Correct 123 ms 43936 KB Output is correct
16 Correct 125 ms 43992 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 407 ms 54484 KB Output is correct
2 Correct 338 ms 51132 KB Output is correct
3 Correct 447 ms 55916 KB Output is correct
4 Correct 284 ms 50580 KB Output is correct
5 Correct 298 ms 51112 KB Output is correct
6 Correct 407 ms 56012 KB Output is correct
7 Correct 126 ms 56136 KB Output is correct
8 Correct 125 ms 56188 KB Output is correct
9 Correct 360 ms 56012 KB Output is correct
10 Correct 337 ms 55972 KB Output is correct
11 Correct 409 ms 55660 KB Output is correct
12 Correct 434 ms 55724 KB Output is correct
13 Correct 377 ms 55636 KB Output is correct
14 Correct 435 ms 55720 KB Output is correct
15 Correct 518 ms 56016 KB Output is correct
16 Correct 433 ms 55820 KB Output is correct
17 Correct 462 ms 55860 KB Output is correct
18 Correct 432 ms 55752 KB Output is correct
19 Correct 458 ms 55808 KB Output is correct
20 Correct 456 ms 55876 KB Output is correct
21 Correct 496 ms 55972 KB Output is correct
22 Correct 506 ms 55852 KB Output is correct
23 Correct 417 ms 55872 KB Output is correct
24 Correct 513 ms 55824 KB Output is correct
25 Correct 312 ms 56112 KB Output is correct
26 Correct 312 ms 56196 KB Output is correct
27 Execution timed out 1103 ms 55268 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37588 KB Output is correct
2 Correct 17 ms 37664 KB Output is correct
3 Correct 17 ms 37548 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 18 ms 37648 KB Output is correct
6 Correct 17 ms 37600 KB Output is correct
7 Correct 22 ms 37588 KB Output is correct
8 Correct 20 ms 37716 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 19 ms 37628 KB Output is correct
11 Correct 18 ms 37644 KB Output is correct
12 Correct 18 ms 37588 KB Output is correct
13 Correct 17 ms 37624 KB Output is correct
14 Correct 18 ms 37720 KB Output is correct
15 Correct 19 ms 37600 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 19 ms 37556 KB Output is correct
18 Correct 22 ms 37592 KB Output is correct
19 Correct 19 ms 37588 KB Output is correct
20 Correct 19 ms 37588 KB Output is correct
21 Correct 122 ms 44504 KB Output is correct
22 Correct 116 ms 44288 KB Output is correct
23 Correct 128 ms 44556 KB Output is correct
24 Correct 108 ms 44464 KB Output is correct
25 Correct 153 ms 44268 KB Output is correct
26 Correct 157 ms 44252 KB Output is correct
27 Correct 50 ms 43880 KB Output is correct
28 Correct 55 ms 44068 KB Output is correct
29 Correct 122 ms 44260 KB Output is correct
30 Correct 150 ms 44292 KB Output is correct
31 Correct 107 ms 44288 KB Output is correct
32 Correct 104 ms 44300 KB Output is correct
33 Correct 116 ms 43772 KB Output is correct
34 Correct 154 ms 44440 KB Output is correct
35 Correct 123 ms 43936 KB Output is correct
36 Correct 125 ms 43992 KB Output is correct
37 Correct 138 ms 43764 KB Output is correct
38 Correct 125 ms 42876 KB Output is correct
39 Correct 93 ms 43008 KB Output is correct
40 Correct 92 ms 43732 KB Output is correct
41 Correct 134 ms 44184 KB Output is correct
42 Correct 140 ms 44160 KB Output is correct
43 Correct 162 ms 44288 KB Output is correct
44 Correct 145 ms 44384 KB Output is correct
45 Correct 139 ms 44252 KB Output is correct
46 Correct 158 ms 44216 KB Output is correct
47 Correct 109 ms 44512 KB Output is correct
48 Correct 136 ms 44456 KB Output is correct
49 Correct 116 ms 42192 KB Output is correct
50 Correct 152 ms 43184 KB Output is correct
51 Correct 183 ms 44180 KB Output is correct
52 Correct 174 ms 44244 KB Output is correct
53 Correct 105 ms 42668 KB Output is correct
54 Correct 137 ms 43932 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 44032 KB Output is correct
2 Correct 185 ms 44520 KB Output is correct
3 Correct 180 ms 44668 KB Output is correct
4 Correct 116 ms 42464 KB Output is correct
5 Correct 143 ms 43716 KB Output is correct
6 Correct 191 ms 44692 KB Output is correct
7 Correct 117 ms 43896 KB Output is correct
8 Correct 111 ms 43468 KB Output is correct
9 Correct 142 ms 44764 KB Output is correct
10 Correct 118 ms 42412 KB Output is correct
11 Correct 161 ms 44720 KB Output is correct
12 Correct 157 ms 44612 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37588 KB Output is correct
2 Correct 17 ms 37664 KB Output is correct
3 Correct 17 ms 37548 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 18 ms 37648 KB Output is correct
6 Correct 17 ms 37600 KB Output is correct
7 Correct 22 ms 37588 KB Output is correct
8 Correct 20 ms 37716 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 19 ms 37628 KB Output is correct
11 Correct 18 ms 37644 KB Output is correct
12 Correct 18 ms 37588 KB Output is correct
13 Correct 17 ms 37624 KB Output is correct
14 Correct 18 ms 37720 KB Output is correct
15 Correct 19 ms 37600 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 19 ms 37556 KB Output is correct
18 Correct 22 ms 37592 KB Output is correct
19 Correct 19 ms 37588 KB Output is correct
20 Correct 19 ms 37588 KB Output is correct
21 Correct 19 ms 37680 KB Output is correct
22 Correct 18 ms 37716 KB Output is correct
23 Correct 19 ms 37588 KB Output is correct
24 Correct 19 ms 37588 KB Output is correct
25 Correct 17 ms 37588 KB Output is correct
26 Correct 17 ms 37568 KB Output is correct
27 Correct 19 ms 37588 KB Output is correct
28 Correct 21 ms 37700 KB Output is correct
29 Correct 19 ms 37640 KB Output is correct
30 Correct 18 ms 37596 KB Output is correct
31 Correct 19 ms 37588 KB Output is correct
32 Correct 18 ms 37716 KB Output is correct
33 Correct 18 ms 37588 KB Output is correct
34 Correct 19 ms 37724 KB Output is correct
35 Correct 18 ms 37636 KB Output is correct
36 Correct 19 ms 37640 KB Output is correct
37 Correct 17 ms 37588 KB Output is correct
38 Correct 19 ms 37588 KB Output is correct
39 Correct 122 ms 44504 KB Output is correct
40 Correct 116 ms 44288 KB Output is correct
41 Correct 128 ms 44556 KB Output is correct
42 Correct 108 ms 44464 KB Output is correct
43 Correct 153 ms 44268 KB Output is correct
44 Correct 157 ms 44252 KB Output is correct
45 Correct 50 ms 43880 KB Output is correct
46 Correct 55 ms 44068 KB Output is correct
47 Correct 122 ms 44260 KB Output is correct
48 Correct 150 ms 44292 KB Output is correct
49 Correct 107 ms 44288 KB Output is correct
50 Correct 104 ms 44300 KB Output is correct
51 Correct 116 ms 43772 KB Output is correct
52 Correct 154 ms 44440 KB Output is correct
53 Correct 123 ms 43936 KB Output is correct
54 Correct 125 ms 43992 KB Output is correct
55 Correct 138 ms 43764 KB Output is correct
56 Correct 125 ms 42876 KB Output is correct
57 Correct 93 ms 43008 KB Output is correct
58 Correct 92 ms 43732 KB Output is correct
59 Correct 134 ms 44184 KB Output is correct
60 Correct 140 ms 44160 KB Output is correct
61 Correct 162 ms 44288 KB Output is correct
62 Correct 145 ms 44384 KB Output is correct
63 Correct 139 ms 44252 KB Output is correct
64 Correct 158 ms 44216 KB Output is correct
65 Correct 109 ms 44512 KB Output is correct
66 Correct 136 ms 44456 KB Output is correct
67 Correct 116 ms 42192 KB Output is correct
68 Correct 152 ms 43184 KB Output is correct
69 Correct 183 ms 44180 KB Output is correct
70 Correct 174 ms 44244 KB Output is correct
71 Correct 105 ms 42668 KB Output is correct
72 Correct 137 ms 43932 KB Output is correct
73 Correct 153 ms 44032 KB Output is correct
74 Correct 185 ms 44520 KB Output is correct
75 Correct 180 ms 44668 KB Output is correct
76 Correct 116 ms 42464 KB Output is correct
77 Correct 143 ms 43716 KB Output is correct
78 Correct 191 ms 44692 KB Output is correct
79 Correct 117 ms 43896 KB Output is correct
80 Correct 111 ms 43468 KB Output is correct
81 Correct 142 ms 44764 KB Output is correct
82 Correct 118 ms 42412 KB Output is correct
83 Correct 161 ms 44720 KB Output is correct
84 Correct 157 ms 44612 KB Output is correct
85 Correct 154 ms 43920 KB Output is correct
86 Correct 150 ms 44484 KB Output is correct
87 Correct 131 ms 43424 KB Output is correct
88 Correct 160 ms 44172 KB Output is correct
89 Correct 123 ms 42024 KB Output is correct
90 Correct 140 ms 44236 KB Output is correct
91 Correct 123 ms 43068 KB Output is correct
92 Correct 146 ms 42792 KB Output is correct
93 Correct 149 ms 44200 KB Output is correct
94 Correct 145 ms 44244 KB Output is correct
95 Correct 141 ms 44144 KB Output is correct
96 Correct 144 ms 44232 KB Output is correct
97 Correct 163 ms 44244 KB Output is correct
98 Correct 135 ms 43312 KB Output is correct
99 Correct 103 ms 44608 KB Output is correct
100 Correct 123 ms 43512 KB Output is correct
101 Correct 153 ms 44636 KB Output is correct
102 Correct 518 ms 44000 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37588 KB Output is correct
2 Correct 17 ms 37664 KB Output is correct
3 Correct 17 ms 37548 KB Output is correct
4 Correct 18 ms 37716 KB Output is correct
5 Correct 18 ms 37648 KB Output is correct
6 Correct 17 ms 37600 KB Output is correct
7 Correct 22 ms 37588 KB Output is correct
8 Correct 20 ms 37716 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 19 ms 37628 KB Output is correct
11 Correct 18 ms 37644 KB Output is correct
12 Correct 18 ms 37588 KB Output is correct
13 Correct 17 ms 37624 KB Output is correct
14 Correct 18 ms 37720 KB Output is correct
15 Correct 19 ms 37600 KB Output is correct
16 Correct 18 ms 37716 KB Output is correct
17 Correct 19 ms 37556 KB Output is correct
18 Correct 22 ms 37592 KB Output is correct
19 Correct 19 ms 37588 KB Output is correct
20 Correct 19 ms 37588 KB Output is correct
21 Correct 19 ms 37680 KB Output is correct
22 Correct 18 ms 37716 KB Output is correct
23 Correct 19 ms 37588 KB Output is correct
24 Correct 19 ms 37588 KB Output is correct
25 Correct 17 ms 37588 KB Output is correct
26 Correct 17 ms 37568 KB Output is correct
27 Correct 19 ms 37588 KB Output is correct
28 Correct 21 ms 37700 KB Output is correct
29 Correct 19 ms 37640 KB Output is correct
30 Correct 18 ms 37596 KB Output is correct
31 Correct 19 ms 37588 KB Output is correct
32 Correct 18 ms 37716 KB Output is correct
33 Correct 18 ms 37588 KB Output is correct
34 Correct 19 ms 37724 KB Output is correct
35 Correct 18 ms 37636 KB Output is correct
36 Correct 19 ms 37640 KB Output is correct
37 Correct 17 ms 37588 KB Output is correct
38 Correct 19 ms 37588 KB Output is correct
39 Correct 122 ms 44504 KB Output is correct
40 Correct 116 ms 44288 KB Output is correct
41 Correct 128 ms 44556 KB Output is correct
42 Correct 108 ms 44464 KB Output is correct
43 Correct 153 ms 44268 KB Output is correct
44 Correct 157 ms 44252 KB Output is correct
45 Correct 50 ms 43880 KB Output is correct
46 Correct 55 ms 44068 KB Output is correct
47 Correct 122 ms 44260 KB Output is correct
48 Correct 150 ms 44292 KB Output is correct
49 Correct 107 ms 44288 KB Output is correct
50 Correct 104 ms 44300 KB Output is correct
51 Correct 116 ms 43772 KB Output is correct
52 Correct 154 ms 44440 KB Output is correct
53 Correct 123 ms 43936 KB Output is correct
54 Correct 125 ms 43992 KB Output is correct
55 Correct 407 ms 54484 KB Output is correct
56 Correct 338 ms 51132 KB Output is correct
57 Correct 447 ms 55916 KB Output is correct
58 Correct 284 ms 50580 KB Output is correct
59 Correct 298 ms 51112 KB Output is correct
60 Correct 407 ms 56012 KB Output is correct
61 Correct 126 ms 56136 KB Output is correct
62 Correct 125 ms 56188 KB Output is correct
63 Correct 360 ms 56012 KB Output is correct
64 Correct 337 ms 55972 KB Output is correct
65 Correct 409 ms 55660 KB Output is correct
66 Correct 434 ms 55724 KB Output is correct
67 Correct 377 ms 55636 KB Output is correct
68 Correct 435 ms 55720 KB Output is correct
69 Correct 518 ms 56016 KB Output is correct
70 Correct 433 ms 55820 KB Output is correct
71 Correct 462 ms 55860 KB Output is correct
72 Correct 432 ms 55752 KB Output is correct
73 Correct 458 ms 55808 KB Output is correct
74 Correct 456 ms 55876 KB Output is correct
75 Correct 496 ms 55972 KB Output is correct
76 Correct 506 ms 55852 KB Output is correct
77 Correct 417 ms 55872 KB Output is correct
78 Correct 513 ms 55824 KB Output is correct
79 Correct 312 ms 56112 KB Output is correct
80 Correct 312 ms 56196 KB Output is correct
81 Execution timed out 1103 ms 55268 KB Time limit exceeded
82 Halted 0 ms 0 KB -