oj.uz

Submission #547071

# Submission time Handle Problem Language Result Execution time Memory
547071 2022-04-09T11:45:39 Z leaked Food Court (JOI21_foodcourt) C++14
68 / 100
 1000 ms 56304 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;
        }
    }
    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&&((mx[v]+x)<=0)==((mn[v]+x)<=0)){
            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 19 ms 37588 KB Output is correct
2 Correct 19 ms 37720 KB Output is correct
3 Correct 17 ms 37568 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37588 KB Output is correct
6 Correct 19 ms 37624 KB Output is correct
7 Correct 18 ms 37596 KB Output is correct
8 Correct 18 ms 37716 KB Output is correct
9 Correct 20 ms 37716 KB Output is correct
10 Correct 18 ms 37604 KB Output is correct
11 Correct 18 ms 37716 KB Output is correct
12 Correct 18 ms 37716 KB Output is correct
13 Correct 17 ms 37592 KB Output is correct
14 Correct 18 ms 37716 KB Output is correct
15 Correct 18 ms 37588 KB Output is correct
16 Correct 18 ms 37644 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 18 ms 37656 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 44560 KB Output is correct
2 Correct 129 ms 44388 KB Output is correct
3 Correct 116 ms 44544 KB Output is correct
4 Correct 131 ms 44452 KB Output is correct
5 Correct 118 ms 44340 KB Output is correct
6 Correct 120 ms 44392 KB Output is correct
7 Correct 52 ms 44016 KB Output is correct
8 Correct 49 ms 44108 KB Output is correct
9 Correct 109 ms 44248 KB Output is correct
10 Correct 110 ms 44268 KB Output is correct
11 Correct 104 ms 44260 KB Output is correct
12 Correct 110 ms 44356 KB Output is correct
13 Correct 104 ms 43716 KB Output is correct
14 Correct 121 ms 44384 KB Output is correct
15 Correct 125 ms 43936 KB Output is correct
16 Correct 128 ms 43940 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 54504 KB Output is correct
2 Correct 336 ms 51136 KB Output is correct
3 Correct 398 ms 55928 KB Output is correct
4 Correct 277 ms 50744 KB Output is correct
5 Correct 278 ms 50976 KB Output is correct
6 Correct 380 ms 55892 KB Output is correct
7 Correct 119 ms 56208 KB Output is correct
8 Correct 120 ms 56136 KB Output is correct
9 Correct 325 ms 56028 KB Output is correct
10 Correct 332 ms 55888 KB Output is correct
11 Correct 381 ms 55628 KB Output is correct
12 Correct 389 ms 55784 KB Output is correct
13 Correct 371 ms 55556 KB Output is correct
14 Correct 420 ms 55708 KB Output is correct
15 Correct 502 ms 55764 KB Output is correct
16 Correct 445 ms 55752 KB Output is correct
17 Correct 437 ms 55908 KB Output is correct
18 Correct 409 ms 55784 KB Output is correct
19 Correct 422 ms 55880 KB Output is correct
20 Correct 476 ms 55880 KB Output is correct
21 Correct 449 ms 55792 KB Output is correct
22 Correct 476 ms 55928 KB Output is correct
23 Correct 414 ms 55932 KB Output is correct
24 Correct 432 ms 55788 KB Output is correct
25 Correct 303 ms 55880 KB Output is correct
26 Correct 289 ms 56304 KB Output is correct
27 Execution timed out 1088 ms 55452 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 19 ms 37720 KB Output is correct
3 Correct 17 ms 37568 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37588 KB Output is correct
6 Correct 19 ms 37624 KB Output is correct
7 Correct 18 ms 37596 KB Output is correct
8 Correct 18 ms 37716 KB Output is correct
9 Correct 20 ms 37716 KB Output is correct
10 Correct 18 ms 37604 KB Output is correct
11 Correct 18 ms 37716 KB Output is correct
12 Correct 18 ms 37716 KB Output is correct
13 Correct 17 ms 37592 KB Output is correct
14 Correct 18 ms 37716 KB Output is correct
15 Correct 18 ms 37588 KB Output is correct
16 Correct 18 ms 37644 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 18 ms 37656 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 109 ms 44560 KB Output is correct
22 Correct 129 ms 44388 KB Output is correct
23 Correct 116 ms 44544 KB Output is correct
24 Correct 131 ms 44452 KB Output is correct
25 Correct 118 ms 44340 KB Output is correct
26 Correct 120 ms 44392 KB Output is correct
27 Correct 52 ms 44016 KB Output is correct
28 Correct 49 ms 44108 KB Output is correct
29 Correct 109 ms 44248 KB Output is correct
30 Correct 110 ms 44268 KB Output is correct
31 Correct 104 ms 44260 KB Output is correct
32 Correct 110 ms 44356 KB Output is correct
33 Correct 104 ms 43716 KB Output is correct
34 Correct 121 ms 44384 KB Output is correct
35 Correct 125 ms 43936 KB Output is correct
36 Correct 128 ms 43940 KB Output is correct
37 Correct 138 ms 43764 KB Output is correct
38 Correct 117 ms 42812 KB Output is correct
39 Correct 73 ms 42992 KB Output is correct
40 Correct 87 ms 43836 KB Output is correct
41 Correct 136 ms 44136 KB Output is correct
42 Correct 136 ms 44184 KB Output is correct
43 Correct 157 ms 44224 KB Output is correct
44 Correct 145 ms 44296 KB Output is correct
45 Correct 140 ms 44228 KB Output is correct
46 Correct 151 ms 44228 KB Output is correct
47 Correct 98 ms 44500 KB Output is correct
48 Correct 129 ms 44552 KB Output is correct
49 Correct 116 ms 42260 KB Output is correct
50 Correct 143 ms 43184 KB Output is correct
51 Correct 173 ms 44184 KB Output is correct
52 Correct 168 ms 44240 KB Output is correct
53 Correct 104 ms 42580 KB Output is correct
54 Correct 126 ms 43900 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 43852 KB Output is correct
2 Correct 175 ms 44596 KB Output is correct
3 Correct 177 ms 44756 KB Output is correct
4 Correct 116 ms 42500 KB Output is correct
5 Correct 139 ms 43688 KB Output is correct
6 Correct 163 ms 44628 KB Output is correct
7 Correct 116 ms 43900 KB Output is correct
8 Correct 109 ms 43496 KB Output is correct
9 Correct 132 ms 44668 KB Output is correct
10 Correct 128 ms 42468 KB Output is correct
11 Correct 159 ms 44652 KB Output is correct
12 Correct 158 ms 44768 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 19 ms 37720 KB Output is correct
3 Correct 17 ms 37568 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37588 KB Output is correct
6 Correct 19 ms 37624 KB Output is correct
7 Correct 18 ms 37596 KB Output is correct
8 Correct 18 ms 37716 KB Output is correct
9 Correct 20 ms 37716 KB Output is correct
10 Correct 18 ms 37604 KB Output is correct
11 Correct 18 ms 37716 KB Output is correct
12 Correct 18 ms 37716 KB Output is correct
13 Correct 17 ms 37592 KB Output is correct
14 Correct 18 ms 37716 KB Output is correct
15 Correct 18 ms 37588 KB Output is correct
16 Correct 18 ms 37644 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 18 ms 37656 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 18 ms 37648 KB Output is correct
22 Correct 19 ms 37664 KB Output is correct
23 Correct 18 ms 37592 KB Output is correct
24 Correct 18 ms 37588 KB Output is correct
25 Correct 17 ms 37588 KB Output is correct
26 Correct 20 ms 37588 KB Output is correct
27 Correct 18 ms 37720 KB Output is correct
28 Correct 19 ms 37588 KB Output is correct
29 Correct 18 ms 37716 KB Output is correct
30 Correct 19 ms 37608 KB Output is correct
31 Correct 18 ms 37680 KB Output is correct
32 Correct 18 ms 37716 KB Output is correct
33 Correct 19 ms 37700 KB Output is correct
34 Correct 18 ms 37712 KB Output is correct
35 Correct 17 ms 37676 KB Output is correct
36 Correct 18 ms 37720 KB Output is correct
37 Correct 17 ms 37588 KB Output is correct
38 Correct 21 ms 37588 KB Output is correct
39 Correct 109 ms 44560 KB Output is correct
40 Correct 129 ms 44388 KB Output is correct
41 Correct 116 ms 44544 KB Output is correct
42 Correct 131 ms 44452 KB Output is correct
43 Correct 118 ms 44340 KB Output is correct
44 Correct 120 ms 44392 KB Output is correct
45 Correct 52 ms 44016 KB Output is correct
46 Correct 49 ms 44108 KB Output is correct
47 Correct 109 ms 44248 KB Output is correct
48 Correct 110 ms 44268 KB Output is correct
49 Correct 104 ms 44260 KB Output is correct
50 Correct 110 ms 44356 KB Output is correct
51 Correct 104 ms 43716 KB Output is correct
52 Correct 121 ms 44384 KB Output is correct
53 Correct 125 ms 43936 KB Output is correct
54 Correct 128 ms 43940 KB Output is correct
55 Correct 138 ms 43764 KB Output is correct
56 Correct 117 ms 42812 KB Output is correct
57 Correct 73 ms 42992 KB Output is correct
58 Correct 87 ms 43836 KB Output is correct
59 Correct 136 ms 44136 KB Output is correct
60 Correct 136 ms 44184 KB Output is correct
61 Correct 157 ms 44224 KB Output is correct
62 Correct 145 ms 44296 KB Output is correct
63 Correct 140 ms 44228 KB Output is correct
64 Correct 151 ms 44228 KB Output is correct
65 Correct 98 ms 44500 KB Output is correct
66 Correct 129 ms 44552 KB Output is correct
67 Correct 116 ms 42260 KB Output is correct
68 Correct 143 ms 43184 KB Output is correct
69 Correct 173 ms 44184 KB Output is correct
70 Correct 168 ms 44240 KB Output is correct
71 Correct 104 ms 42580 KB Output is correct
72 Correct 126 ms 43900 KB Output is correct
73 Correct 144 ms 43852 KB Output is correct
74 Correct 175 ms 44596 KB Output is correct
75 Correct 177 ms 44756 KB Output is correct
76 Correct 116 ms 42500 KB Output is correct
77 Correct 139 ms 43688 KB Output is correct
78 Correct 163 ms 44628 KB Output is correct
79 Correct 116 ms 43900 KB Output is correct
80 Correct 109 ms 43496 KB Output is correct
81 Correct 132 ms 44668 KB Output is correct
82 Correct 128 ms 42468 KB Output is correct
83 Correct 159 ms 44652 KB Output is correct
84 Correct 158 ms 44768 KB Output is correct
85 Correct 135 ms 43808 KB Output is correct
86 Correct 148 ms 44488 KB Output is correct
87 Correct 128 ms 43392 KB Output is correct
88 Correct 149 ms 44252 KB Output is correct
89 Correct 100 ms 41988 KB Output is correct
90 Correct 147 ms 44188 KB Output is correct
91 Correct 120 ms 43104 KB Output is correct
92 Correct 119 ms 42804 KB Output is correct
93 Correct 141 ms 44200 KB Output is correct
94 Correct 139 ms 44296 KB Output is correct
95 Correct 143 ms 44152 KB Output is correct
96 Correct 142 ms 44232 KB Output is correct
97 Correct 150 ms 44244 KB Output is correct
98 Correct 124 ms 43340 KB Output is correct
99 Correct 101 ms 44492 KB Output is correct
100 Correct 115 ms 43448 KB Output is correct
101 Correct 135 ms 44464 KB Output is correct
102 Correct 505 ms 43992 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 19 ms 37720 KB Output is correct
3 Correct 17 ms 37568 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37588 KB Output is correct
6 Correct 19 ms 37624 KB Output is correct
7 Correct 18 ms 37596 KB Output is correct
8 Correct 18 ms 37716 KB Output is correct
9 Correct 20 ms 37716 KB Output is correct
10 Correct 18 ms 37604 KB Output is correct
11 Correct 18 ms 37716 KB Output is correct
12 Correct 18 ms 37716 KB Output is correct
13 Correct 17 ms 37592 KB Output is correct
14 Correct 18 ms 37716 KB Output is correct
15 Correct 18 ms 37588 KB Output is correct
16 Correct 18 ms 37644 KB Output is correct
17 Correct 19 ms 37588 KB Output is correct
18 Correct 18 ms 37656 KB Output is correct
19 Correct 18 ms 37588 KB Output is correct
20 Correct 18 ms 37588 KB Output is correct
21 Correct 18 ms 37648 KB Output is correct
22 Correct 19 ms 37664 KB Output is correct
23 Correct 18 ms 37592 KB Output is correct
24 Correct 18 ms 37588 KB Output is correct
25 Correct 17 ms 37588 KB Output is correct
26 Correct 20 ms 37588 KB Output is correct
27 Correct 18 ms 37720 KB Output is correct
28 Correct 19 ms 37588 KB Output is correct
29 Correct 18 ms 37716 KB Output is correct
30 Correct 19 ms 37608 KB Output is correct
31 Correct 18 ms 37680 KB Output is correct
32 Correct 18 ms 37716 KB Output is correct
33 Correct 19 ms 37700 KB Output is correct
34 Correct 18 ms 37712 KB Output is correct
35 Correct 17 ms 37676 KB Output is correct
36 Correct 18 ms 37720 KB Output is correct
37 Correct 17 ms 37588 KB Output is correct
38 Correct 21 ms 37588 KB Output is correct
39 Correct 109 ms 44560 KB Output is correct
40 Correct 129 ms 44388 KB Output is correct
41 Correct 116 ms 44544 KB Output is correct
42 Correct 131 ms 44452 KB Output is correct
43 Correct 118 ms 44340 KB Output is correct
44 Correct 120 ms 44392 KB Output is correct
45 Correct 52 ms 44016 KB Output is correct
46 Correct 49 ms 44108 KB Output is correct
47 Correct 109 ms 44248 KB Output is correct
48 Correct 110 ms 44268 KB Output is correct
49 Correct 104 ms 44260 KB Output is correct
50 Correct 110 ms 44356 KB Output is correct
51 Correct 104 ms 43716 KB Output is correct
52 Correct 121 ms 44384 KB Output is correct
53 Correct 125 ms 43936 KB Output is correct
54 Correct 128 ms 43940 KB Output is correct
55 Correct 383 ms 54504 KB Output is correct
56 Correct 336 ms 51136 KB Output is correct
57 Correct 398 ms 55928 KB Output is correct
58 Correct 277 ms 50744 KB Output is correct
59 Correct 278 ms 50976 KB Output is correct
60 Correct 380 ms 55892 KB Output is correct
61 Correct 119 ms 56208 KB Output is correct
62 Correct 120 ms 56136 KB Output is correct
63 Correct 325 ms 56028 KB Output is correct
64 Correct 332 ms 55888 KB Output is correct
65 Correct 381 ms 55628 KB Output is correct
66 Correct 389 ms 55784 KB Output is correct
67 Correct 371 ms 55556 KB Output is correct
68 Correct 420 ms 55708 KB Output is correct
69 Correct 502 ms 55764 KB Output is correct
70 Correct 445 ms 55752 KB Output is correct
71 Correct 437 ms 55908 KB Output is correct
72 Correct 409 ms 55784 KB Output is correct
73 Correct 422 ms 55880 KB Output is correct
74 Correct 476 ms 55880 KB Output is correct
75 Correct 449 ms 55792 KB Output is correct
76 Correct 476 ms 55928 KB Output is correct
77 Correct 414 ms 55932 KB Output is correct
78 Correct 432 ms 55788 KB Output is correct
79 Correct 303 ms 55880 KB Output is correct
80 Correct 289 ms 56304 KB Output is correct
81 Execution timed out 1088 ms 55452 KB Time limit exceeded
82 Halted 0 ms 0 KB -