oj.uz

답안 #547068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547068 2022-04-09T11:39:25 Z leaked 푸드 코트 (JOI21_foodcourt) C++17
68 / 100
 1000 ms 64688 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("Ofast")
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]);
            }
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37636 KB Output is correct
2 Correct 27 ms 37672 KB Output is correct
3 Correct 18 ms 37568 KB Output is correct
4 Correct 17 ms 37648 KB Output is correct
5 Correct 28 ms 37668 KB Output is correct
6 Correct 31 ms 37664 KB Output is correct
7 Correct 23 ms 37644 KB Output is correct
8 Correct 19 ms 37660 KB Output is correct
9 Correct 21 ms 37588 KB Output is correct
10 Correct 20 ms 37716 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 26 ms 37688 KB Output is correct
13 Correct 22 ms 37588 KB Output is correct
14 Correct 22 ms 37680 KB Output is correct
15 Correct 23 ms 37588 KB Output is correct
16 Correct 25 ms 37696 KB Output is correct
17 Correct 18 ms 37588 KB Output is correct
18 Correct 20 ms 37624 KB Output is correct
19 Correct 22 ms 37584 KB Output is correct
20 Correct 21 ms 37588 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37636 KB Output is correct
2 Correct 27 ms 37672 KB Output is correct
3 Correct 18 ms 37568 KB Output is correct
4 Correct 17 ms 37648 KB Output is correct
5 Correct 28 ms 37668 KB Output is correct
6 Correct 31 ms 37664 KB Output is correct
7 Correct 23 ms 37644 KB Output is correct
8 Correct 19 ms 37660 KB Output is correct
9 Correct 21 ms 37588 KB Output is correct
10 Correct 20 ms 37716 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 26 ms 37688 KB Output is correct
13 Correct 22 ms 37588 KB Output is correct
14 Correct 22 ms 37680 KB Output is correct
15 Correct 23 ms 37588 KB Output is correct
16 Correct 25 ms 37696 KB Output is correct
17 Correct 18 ms 37588 KB Output is correct
18 Correct 20 ms 37624 KB Output is correct
19 Correct 22 ms 37584 KB Output is correct
20 Correct 21 ms 37588 KB Output is correct
21 Correct 23 ms 37632 KB Output is correct
22 Correct 19 ms 37716 KB Output is correct
23 Correct 21 ms 37580 KB Output is correct
24 Correct 21 ms 37588 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37588 KB Output is correct
27 Correct 20 ms 37648 KB Output is correct
28 Correct 23 ms 37604 KB Output is correct
29 Correct 24 ms 37776 KB Output is correct
30 Correct 27 ms 37588 KB Output is correct
31 Correct 22 ms 37668 KB Output is correct
32 Correct 26 ms 37672 KB Output is correct
33 Correct 19 ms 37644 KB Output is correct
34 Correct 22 ms 37640 KB Output is correct
35 Correct 20 ms 37628 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 26 ms 37588 KB Output is correct
38 Correct 20 ms 37644 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 44656 KB Output is correct
2 Correct 134 ms 44320 KB Output is correct
3 Correct 142 ms 44472 KB Output is correct
4 Correct 151 ms 44516 KB Output is correct
5 Correct 145 ms 44252 KB Output is correct
6 Correct 140 ms 44296 KB Output is correct
7 Correct 51 ms 43928 KB Output is correct
8 Correct 58 ms 44108 KB Output is correct
9 Correct 127 ms 44280 KB Output is correct
10 Correct 117 ms 44308 KB Output is correct
11 Correct 118 ms 44220 KB Output is correct
12 Correct 115 ms 44288 KB Output is correct
13 Correct 131 ms 43784 KB Output is correct
14 Correct 138 ms 44516 KB Output is correct
15 Correct 157 ms 43904 KB Output is correct
16 Correct 138 ms 43968 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 841 ms 61896 KB Output is correct
2 Correct 659 ms 57016 KB Output is correct
3 Correct 814 ms 64032 KB Output is correct
4 Correct 639 ms 55984 KB Output is correct
5 Correct 629 ms 56492 KB Output is correct
6 Correct 895 ms 63360 KB Output is correct
7 Correct 426 ms 64336 KB Output is correct
8 Correct 408 ms 64180 KB Output is correct
9 Correct 971 ms 64688 KB Output is correct
10 Correct 912 ms 64668 KB Output is correct
11 Correct 766 ms 63080 KB Output is correct
12 Correct 741 ms 63216 KB Output is correct
13 Correct 670 ms 63200 KB Output is correct
14 Correct 711 ms 63500 KB Output is correct
15 Correct 771 ms 63452 KB Output is correct
16 Correct 727 ms 63452 KB Output is correct
17 Correct 751 ms 63436 KB Output is correct
18 Correct 724 ms 63352 KB Output is correct
19 Correct 713 ms 63368 KB Output is correct
20 Correct 707 ms 63492 KB Output is correct
21 Correct 724 ms 63508 KB Output is correct
22 Correct 771 ms 63524 KB Output is correct
23 Correct 694 ms 63464 KB Output is correct
24 Correct 704 ms 63428 KB Output is correct
25 Correct 535 ms 64016 KB Output is correct
26 Correct 557 ms 64464 KB Output is correct
27 Execution timed out 1090 ms 55376 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37636 KB Output is correct
2 Correct 27 ms 37672 KB Output is correct
3 Correct 18 ms 37568 KB Output is correct
4 Correct 17 ms 37648 KB Output is correct
5 Correct 28 ms 37668 KB Output is correct
6 Correct 31 ms 37664 KB Output is correct
7 Correct 23 ms 37644 KB Output is correct
8 Correct 19 ms 37660 KB Output is correct
9 Correct 21 ms 37588 KB Output is correct
10 Correct 20 ms 37716 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 26 ms 37688 KB Output is correct
13 Correct 22 ms 37588 KB Output is correct
14 Correct 22 ms 37680 KB Output is correct
15 Correct 23 ms 37588 KB Output is correct
16 Correct 25 ms 37696 KB Output is correct
17 Correct 18 ms 37588 KB Output is correct
18 Correct 20 ms 37624 KB Output is correct
19 Correct 22 ms 37584 KB Output is correct
20 Correct 21 ms 37588 KB Output is correct
21 Correct 132 ms 44656 KB Output is correct
22 Correct 134 ms 44320 KB Output is correct
23 Correct 142 ms 44472 KB Output is correct
24 Correct 151 ms 44516 KB Output is correct
25 Correct 145 ms 44252 KB Output is correct
26 Correct 140 ms 44296 KB Output is correct
27 Correct 51 ms 43928 KB Output is correct
28 Correct 58 ms 44108 KB Output is correct
29 Correct 127 ms 44280 KB Output is correct
30 Correct 117 ms 44308 KB Output is correct
31 Correct 118 ms 44220 KB Output is correct
32 Correct 115 ms 44288 KB Output is correct
33 Correct 131 ms 43784 KB Output is correct
34 Correct 138 ms 44516 KB Output is correct
35 Correct 157 ms 43904 KB Output is correct
36 Correct 138 ms 43968 KB Output is correct
37 Correct 139 ms 43764 KB Output is correct
38 Correct 122 ms 42796 KB Output is correct
39 Correct 70 ms 42992 KB Output is correct
40 Correct 87 ms 43724 KB Output is correct
41 Correct 134 ms 44208 KB Output is correct
42 Correct 140 ms 44264 KB Output is correct
43 Correct 193 ms 44192 KB Output is correct
44 Correct 147 ms 44296 KB Output is correct
45 Correct 140 ms 44208 KB Output is correct
46 Correct 156 ms 44284 KB Output is correct
47 Correct 92 ms 44644 KB Output is correct
48 Correct 134 ms 44500 KB Output is correct
49 Correct 117 ms 42196 KB Output is correct
50 Correct 148 ms 43156 KB Output is correct
51 Correct 174 ms 44180 KB Output is correct
52 Correct 171 ms 44248 KB Output is correct
53 Correct 100 ms 42584 KB Output is correct
54 Correct 132 ms 44004 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 43876 KB Output is correct
2 Correct 155 ms 44592 KB Output is correct
3 Correct 158 ms 44592 KB Output is correct
4 Correct 117 ms 42540 KB Output is correct
5 Correct 155 ms 43688 KB Output is correct
6 Correct 158 ms 44644 KB Output is correct
7 Correct 109 ms 43904 KB Output is correct
8 Correct 101 ms 43472 KB Output is correct
9 Correct 129 ms 44688 KB Output is correct
10 Correct 108 ms 42440 KB Output is correct
11 Correct 156 ms 44676 KB Output is correct
12 Correct 169 ms 44684 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37636 KB Output is correct
2 Correct 27 ms 37672 KB Output is correct
3 Correct 18 ms 37568 KB Output is correct
4 Correct 17 ms 37648 KB Output is correct
5 Correct 28 ms 37668 KB Output is correct
6 Correct 31 ms 37664 KB Output is correct
7 Correct 23 ms 37644 KB Output is correct
8 Correct 19 ms 37660 KB Output is correct
9 Correct 21 ms 37588 KB Output is correct
10 Correct 20 ms 37716 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 26 ms 37688 KB Output is correct
13 Correct 22 ms 37588 KB Output is correct
14 Correct 22 ms 37680 KB Output is correct
15 Correct 23 ms 37588 KB Output is correct
16 Correct 25 ms 37696 KB Output is correct
17 Correct 18 ms 37588 KB Output is correct
18 Correct 20 ms 37624 KB Output is correct
19 Correct 22 ms 37584 KB Output is correct
20 Correct 21 ms 37588 KB Output is correct
21 Correct 23 ms 37632 KB Output is correct
22 Correct 19 ms 37716 KB Output is correct
23 Correct 21 ms 37580 KB Output is correct
24 Correct 21 ms 37588 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37588 KB Output is correct
27 Correct 20 ms 37648 KB Output is correct
28 Correct 23 ms 37604 KB Output is correct
29 Correct 24 ms 37776 KB Output is correct
30 Correct 27 ms 37588 KB Output is correct
31 Correct 22 ms 37668 KB Output is correct
32 Correct 26 ms 37672 KB Output is correct
33 Correct 19 ms 37644 KB Output is correct
34 Correct 22 ms 37640 KB Output is correct
35 Correct 20 ms 37628 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 26 ms 37588 KB Output is correct
38 Correct 20 ms 37644 KB Output is correct
39 Correct 132 ms 44656 KB Output is correct
40 Correct 134 ms 44320 KB Output is correct
41 Correct 142 ms 44472 KB Output is correct
42 Correct 151 ms 44516 KB Output is correct
43 Correct 145 ms 44252 KB Output is correct
44 Correct 140 ms 44296 KB Output is correct
45 Correct 51 ms 43928 KB Output is correct
46 Correct 58 ms 44108 KB Output is correct
47 Correct 127 ms 44280 KB Output is correct
48 Correct 117 ms 44308 KB Output is correct
49 Correct 118 ms 44220 KB Output is correct
50 Correct 115 ms 44288 KB Output is correct
51 Correct 131 ms 43784 KB Output is correct
52 Correct 138 ms 44516 KB Output is correct
53 Correct 157 ms 43904 KB Output is correct
54 Correct 138 ms 43968 KB Output is correct
55 Correct 139 ms 43764 KB Output is correct
56 Correct 122 ms 42796 KB Output is correct
57 Correct 70 ms 42992 KB Output is correct
58 Correct 87 ms 43724 KB Output is correct
59 Correct 134 ms 44208 KB Output is correct
60 Correct 140 ms 44264 KB Output is correct
61 Correct 193 ms 44192 KB Output is correct
62 Correct 147 ms 44296 KB Output is correct
63 Correct 140 ms 44208 KB Output is correct
64 Correct 156 ms 44284 KB Output is correct
65 Correct 92 ms 44644 KB Output is correct
66 Correct 134 ms 44500 KB Output is correct
67 Correct 117 ms 42196 KB Output is correct
68 Correct 148 ms 43156 KB Output is correct
69 Correct 174 ms 44180 KB Output is correct
70 Correct 171 ms 44248 KB Output is correct
71 Correct 100 ms 42584 KB Output is correct
72 Correct 132 ms 44004 KB Output is correct
73 Correct 144 ms 43876 KB Output is correct
74 Correct 155 ms 44592 KB Output is correct
75 Correct 158 ms 44592 KB Output is correct
76 Correct 117 ms 42540 KB Output is correct
77 Correct 155 ms 43688 KB Output is correct
78 Correct 158 ms 44644 KB Output is correct
79 Correct 109 ms 43904 KB Output is correct
80 Correct 101 ms 43472 KB Output is correct
81 Correct 129 ms 44688 KB Output is correct
82 Correct 108 ms 42440 KB Output is correct
83 Correct 156 ms 44676 KB Output is correct
84 Correct 169 ms 44684 KB Output is correct
85 Correct 137 ms 43888 KB Output is correct
86 Correct 146 ms 44404 KB Output is correct
87 Correct 128 ms 43312 KB Output is correct
88 Correct 149 ms 44168 KB Output is correct
89 Correct 100 ms 41932 KB Output is correct
90 Correct 139 ms 44244 KB Output is correct
91 Correct 116 ms 43056 KB Output is correct
92 Correct 114 ms 42884 KB Output is correct
93 Correct 156 ms 44356 KB Output is correct
94 Correct 140 ms 44296 KB Output is correct
95 Correct 136 ms 44148 KB Output is correct
96 Correct 144 ms 44364 KB Output is correct
97 Correct 150 ms 44336 KB Output is correct
98 Correct 121 ms 43360 KB Output is correct
99 Correct 102 ms 44508 KB Output is correct
100 Correct 130 ms 43436 KB Output is correct
101 Correct 140 ms 44488 KB Output is correct
102 Correct 509 ms 43972 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37636 KB Output is correct
2 Correct 27 ms 37672 KB Output is correct
3 Correct 18 ms 37568 KB Output is correct
4 Correct 17 ms 37648 KB Output is correct
5 Correct 28 ms 37668 KB Output is correct
6 Correct 31 ms 37664 KB Output is correct
7 Correct 23 ms 37644 KB Output is correct
8 Correct 19 ms 37660 KB Output is correct
9 Correct 21 ms 37588 KB Output is correct
10 Correct 20 ms 37716 KB Output is correct
11 Correct 18 ms 37588 KB Output is correct
12 Correct 26 ms 37688 KB Output is correct
13 Correct 22 ms 37588 KB Output is correct
14 Correct 22 ms 37680 KB Output is correct
15 Correct 23 ms 37588 KB Output is correct
16 Correct 25 ms 37696 KB Output is correct
17 Correct 18 ms 37588 KB Output is correct
18 Correct 20 ms 37624 KB Output is correct
19 Correct 22 ms 37584 KB Output is correct
20 Correct 21 ms 37588 KB Output is correct
21 Correct 23 ms 37632 KB Output is correct
22 Correct 19 ms 37716 KB Output is correct
23 Correct 21 ms 37580 KB Output is correct
24 Correct 21 ms 37588 KB Output is correct
25 Correct 18 ms 37588 KB Output is correct
26 Correct 19 ms 37588 KB Output is correct
27 Correct 20 ms 37648 KB Output is correct
28 Correct 23 ms 37604 KB Output is correct
29 Correct 24 ms 37776 KB Output is correct
30 Correct 27 ms 37588 KB Output is correct
31 Correct 22 ms 37668 KB Output is correct
32 Correct 26 ms 37672 KB Output is correct
33 Correct 19 ms 37644 KB Output is correct
34 Correct 22 ms 37640 KB Output is correct
35 Correct 20 ms 37628 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 26 ms 37588 KB Output is correct
38 Correct 20 ms 37644 KB Output is correct
39 Correct 132 ms 44656 KB Output is correct
40 Correct 134 ms 44320 KB Output is correct
41 Correct 142 ms 44472 KB Output is correct
42 Correct 151 ms 44516 KB Output is correct
43 Correct 145 ms 44252 KB Output is correct
44 Correct 140 ms 44296 KB Output is correct
45 Correct 51 ms 43928 KB Output is correct
46 Correct 58 ms 44108 KB Output is correct
47 Correct 127 ms 44280 KB Output is correct
48 Correct 117 ms 44308 KB Output is correct
49 Correct 118 ms 44220 KB Output is correct
50 Correct 115 ms 44288 KB Output is correct
51 Correct 131 ms 43784 KB Output is correct
52 Correct 138 ms 44516 KB Output is correct
53 Correct 157 ms 43904 KB Output is correct
54 Correct 138 ms 43968 KB Output is correct
55 Correct 841 ms 61896 KB Output is correct
56 Correct 659 ms 57016 KB Output is correct
57 Correct 814 ms 64032 KB Output is correct
58 Correct 639 ms 55984 KB Output is correct
59 Correct 629 ms 56492 KB Output is correct
60 Correct 895 ms 63360 KB Output is correct
61 Correct 426 ms 64336 KB Output is correct
62 Correct 408 ms 64180 KB Output is correct
63 Correct 971 ms 64688 KB Output is correct
64 Correct 912 ms 64668 KB Output is correct
65 Correct 766 ms 63080 KB Output is correct
66 Correct 741 ms 63216 KB Output is correct
67 Correct 670 ms 63200 KB Output is correct
68 Correct 711 ms 63500 KB Output is correct
69 Correct 771 ms 63452 KB Output is correct
70 Correct 727 ms 63452 KB Output is correct
71 Correct 751 ms 63436 KB Output is correct
72 Correct 724 ms 63352 KB Output is correct
73 Correct 713 ms 63368 KB Output is correct
74 Correct 707 ms 63492 KB Output is correct
75 Correct 724 ms 63508 KB Output is correct
76 Correct 771 ms 63524 KB Output is correct
77 Correct 694 ms 63464 KB Output is correct
78 Correct 704 ms 63428 KB Output is correct
79 Correct 535 ms 64016 KB Output is correct
80 Correct 557 ms 64464 KB Output is correct
81 Execution timed out 1090 ms 55376 KB Time limit exceeded
82 Halted 0 ms 0 KB -