oj.uz

답안 #547066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547066 2022-04-09T11:37:44 Z leaked 푸드 코트 (JOI21_foodcourt) C++14
68 / 100
 1000 ms 64712 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
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 : {2*v,2*v+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 : {2*v,2*v+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)){
//            cout<<"TL "<<tl<<' '<<tr<<' '<<mx[v]+x<<' '<<mn[v]+x<<endl;
            if((mx[v]+x)<=0){
                p1[v]=0;
                umax(p3[v],t);
                p2[v]=mx[v]=mn[v]=0;
//                cout<<"WAY "<<v<<' '<<tl<<' '<<tr<<endl;
                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,2*v,tl,tm);add(l,r,x,t,2*v+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 19 ms 37588 KB Output is correct
2 Correct 20 ms 37728 KB Output is correct
3 Correct 20 ms 37520 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37564 KB Output is correct
6 Correct 17 ms 37568 KB Output is correct
7 Correct 20 ms 37588 KB Output is correct
8 Correct 22 ms 37724 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 20 ms 37676 KB Output is correct
11 Correct 20 ms 37620 KB Output is correct
12 Correct 20 ms 37588 KB Output is correct
13 Correct 23 ms 37588 KB Output is correct
14 Correct 20 ms 37640 KB Output is correct
15 Correct 17 ms 37604 KB Output is correct
16 Correct 18 ms 37656 KB Output is correct
17 Correct 21 ms 37592 KB Output is correct
18 Correct 19 ms 37628 KB Output is correct
19 Correct 19 ms 37692 KB Output is correct
20 Correct 20 ms 37588 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 20 ms 37728 KB Output is correct
3 Correct 20 ms 37520 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37564 KB Output is correct
6 Correct 17 ms 37568 KB Output is correct
7 Correct 20 ms 37588 KB Output is correct
8 Correct 22 ms 37724 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 20 ms 37676 KB Output is correct
11 Correct 20 ms 37620 KB Output is correct
12 Correct 20 ms 37588 KB Output is correct
13 Correct 23 ms 37588 KB Output is correct
14 Correct 20 ms 37640 KB Output is correct
15 Correct 17 ms 37604 KB Output is correct
16 Correct 18 ms 37656 KB Output is correct
17 Correct 21 ms 37592 KB Output is correct
18 Correct 19 ms 37628 KB Output is correct
19 Correct 19 ms 37692 KB Output is correct
20 Correct 20 ms 37588 KB Output is correct
21 Correct 18 ms 37636 KB Output is correct
22 Correct 18 ms 37600 KB Output is correct
23 Correct 18 ms 37588 KB Output is correct
24 Correct 20 ms 37588 KB Output is correct
25 Correct 17 ms 37596 KB Output is correct
26 Correct 18 ms 37588 KB Output is correct
27 Correct 23 ms 37644 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37664 KB Output is correct
30 Correct 19 ms 37640 KB Output is correct
31 Correct 21 ms 37716 KB Output is correct
32 Correct 19 ms 37648 KB Output is correct
33 Correct 18 ms 37648 KB Output is correct
34 Correct 18 ms 37716 KB Output is correct
35 Correct 18 ms 37584 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 19 ms 37536 KB Output is correct
38 Correct 24 ms 37588 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 44508 KB Output is correct
2 Correct 126 ms 44308 KB Output is correct
3 Correct 122 ms 44556 KB Output is correct
4 Correct 129 ms 44460 KB Output is correct
5 Correct 117 ms 44336 KB Output is correct
6 Correct 151 ms 44384 KB Output is correct
7 Correct 51 ms 43940 KB Output is correct
8 Correct 59 ms 44072 KB Output is correct
9 Correct 121 ms 44276 KB Output is correct
10 Correct 114 ms 44364 KB Output is correct
11 Correct 116 ms 44336 KB Output is correct
12 Correct 121 ms 44264 KB Output is correct
13 Correct 111 ms 43760 KB Output is correct
14 Correct 126 ms 44432 KB Output is correct
15 Correct 134 ms 43876 KB Output is correct
16 Correct 138 ms 43928 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 61916 KB Output is correct
2 Correct 619 ms 57008 KB Output is correct
3 Correct 757 ms 64120 KB Output is correct
4 Correct 620 ms 56000 KB Output is correct
5 Correct 714 ms 56468 KB Output is correct
6 Correct 881 ms 63240 KB Output is correct
7 Correct 418 ms 64464 KB Output is correct
8 Correct 382 ms 64116 KB Output is correct
9 Correct 880 ms 64712 KB Output is correct
10 Correct 940 ms 64692 KB Output is correct
11 Correct 729 ms 63056 KB Output is correct
12 Correct 739 ms 63092 KB Output is correct
13 Correct 718 ms 63136 KB Output is correct
14 Correct 738 ms 63336 KB Output is correct
15 Correct 770 ms 63348 KB Output is correct
16 Correct 753 ms 63380 KB Output is correct
17 Correct 771 ms 63492 KB Output is correct
18 Correct 812 ms 63364 KB Output is correct
19 Correct 788 ms 63336 KB Output is correct
20 Correct 755 ms 63332 KB Output is correct
21 Correct 798 ms 63404 KB Output is correct
22 Correct 734 ms 63360 KB Output is correct
23 Correct 793 ms 63336 KB Output is correct
24 Correct 787 ms 63336 KB Output is correct
25 Correct 570 ms 64008 KB Output is correct
26 Correct 593 ms 64360 KB Output is correct
27 Execution timed out 1086 ms 55240 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 20 ms 37728 KB Output is correct
3 Correct 20 ms 37520 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37564 KB Output is correct
6 Correct 17 ms 37568 KB Output is correct
7 Correct 20 ms 37588 KB Output is correct
8 Correct 22 ms 37724 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 20 ms 37676 KB Output is correct
11 Correct 20 ms 37620 KB Output is correct
12 Correct 20 ms 37588 KB Output is correct
13 Correct 23 ms 37588 KB Output is correct
14 Correct 20 ms 37640 KB Output is correct
15 Correct 17 ms 37604 KB Output is correct
16 Correct 18 ms 37656 KB Output is correct
17 Correct 21 ms 37592 KB Output is correct
18 Correct 19 ms 37628 KB Output is correct
19 Correct 19 ms 37692 KB Output is correct
20 Correct 20 ms 37588 KB Output is correct
21 Correct 134 ms 44508 KB Output is correct
22 Correct 126 ms 44308 KB Output is correct
23 Correct 122 ms 44556 KB Output is correct
24 Correct 129 ms 44460 KB Output is correct
25 Correct 117 ms 44336 KB Output is correct
26 Correct 151 ms 44384 KB Output is correct
27 Correct 51 ms 43940 KB Output is correct
28 Correct 59 ms 44072 KB Output is correct
29 Correct 121 ms 44276 KB Output is correct
30 Correct 114 ms 44364 KB Output is correct
31 Correct 116 ms 44336 KB Output is correct
32 Correct 121 ms 44264 KB Output is correct
33 Correct 111 ms 43760 KB Output is correct
34 Correct 126 ms 44432 KB Output is correct
35 Correct 134 ms 43876 KB Output is correct
36 Correct 138 ms 43928 KB Output is correct
37 Correct 143 ms 43696 KB Output is correct
38 Correct 123 ms 42844 KB Output is correct
39 Correct 76 ms 42992 KB Output is correct
40 Correct 98 ms 43724 KB Output is correct
41 Correct 142 ms 44176 KB Output is correct
42 Correct 142 ms 44184 KB Output is correct
43 Correct 151 ms 44228 KB Output is correct
44 Correct 158 ms 44188 KB Output is correct
45 Correct 175 ms 44228 KB Output is correct
46 Correct 156 ms 44468 KB Output is correct
47 Correct 96 ms 44504 KB Output is correct
48 Correct 165 ms 44544 KB Output is correct
49 Correct 145 ms 42208 KB Output is correct
50 Correct 183 ms 43160 KB Output is correct
51 Correct 217 ms 44184 KB Output is correct
52 Correct 193 ms 44244 KB Output is correct
53 Correct 103 ms 42596 KB Output is correct
54 Correct 128 ms 43968 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 43844 KB Output is correct
2 Correct 169 ms 44648 KB Output is correct
3 Correct 183 ms 44776 KB Output is correct
4 Correct 129 ms 42500 KB Output is correct
5 Correct 166 ms 43644 KB Output is correct
6 Correct 193 ms 44636 KB Output is correct
7 Correct 145 ms 43788 KB Output is correct
8 Correct 109 ms 43384 KB Output is correct
9 Correct 160 ms 44672 KB Output is correct
10 Correct 152 ms 42432 KB Output is correct
11 Correct 166 ms 44600 KB Output is correct
12 Correct 166 ms 44688 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 20 ms 37728 KB Output is correct
3 Correct 20 ms 37520 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37564 KB Output is correct
6 Correct 17 ms 37568 KB Output is correct
7 Correct 20 ms 37588 KB Output is correct
8 Correct 22 ms 37724 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 20 ms 37676 KB Output is correct
11 Correct 20 ms 37620 KB Output is correct
12 Correct 20 ms 37588 KB Output is correct
13 Correct 23 ms 37588 KB Output is correct
14 Correct 20 ms 37640 KB Output is correct
15 Correct 17 ms 37604 KB Output is correct
16 Correct 18 ms 37656 KB Output is correct
17 Correct 21 ms 37592 KB Output is correct
18 Correct 19 ms 37628 KB Output is correct
19 Correct 19 ms 37692 KB Output is correct
20 Correct 20 ms 37588 KB Output is correct
21 Correct 18 ms 37636 KB Output is correct
22 Correct 18 ms 37600 KB Output is correct
23 Correct 18 ms 37588 KB Output is correct
24 Correct 20 ms 37588 KB Output is correct
25 Correct 17 ms 37596 KB Output is correct
26 Correct 18 ms 37588 KB Output is correct
27 Correct 23 ms 37644 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37664 KB Output is correct
30 Correct 19 ms 37640 KB Output is correct
31 Correct 21 ms 37716 KB Output is correct
32 Correct 19 ms 37648 KB Output is correct
33 Correct 18 ms 37648 KB Output is correct
34 Correct 18 ms 37716 KB Output is correct
35 Correct 18 ms 37584 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 19 ms 37536 KB Output is correct
38 Correct 24 ms 37588 KB Output is correct
39 Correct 134 ms 44508 KB Output is correct
40 Correct 126 ms 44308 KB Output is correct
41 Correct 122 ms 44556 KB Output is correct
42 Correct 129 ms 44460 KB Output is correct
43 Correct 117 ms 44336 KB Output is correct
44 Correct 151 ms 44384 KB Output is correct
45 Correct 51 ms 43940 KB Output is correct
46 Correct 59 ms 44072 KB Output is correct
47 Correct 121 ms 44276 KB Output is correct
48 Correct 114 ms 44364 KB Output is correct
49 Correct 116 ms 44336 KB Output is correct
50 Correct 121 ms 44264 KB Output is correct
51 Correct 111 ms 43760 KB Output is correct
52 Correct 126 ms 44432 KB Output is correct
53 Correct 134 ms 43876 KB Output is correct
54 Correct 138 ms 43928 KB Output is correct
55 Correct 143 ms 43696 KB Output is correct
56 Correct 123 ms 42844 KB Output is correct
57 Correct 76 ms 42992 KB Output is correct
58 Correct 98 ms 43724 KB Output is correct
59 Correct 142 ms 44176 KB Output is correct
60 Correct 142 ms 44184 KB Output is correct
61 Correct 151 ms 44228 KB Output is correct
62 Correct 158 ms 44188 KB Output is correct
63 Correct 175 ms 44228 KB Output is correct
64 Correct 156 ms 44468 KB Output is correct
65 Correct 96 ms 44504 KB Output is correct
66 Correct 165 ms 44544 KB Output is correct
67 Correct 145 ms 42208 KB Output is correct
68 Correct 183 ms 43160 KB Output is correct
69 Correct 217 ms 44184 KB Output is correct
70 Correct 193 ms 44244 KB Output is correct
71 Correct 103 ms 42596 KB Output is correct
72 Correct 128 ms 43968 KB Output is correct
73 Correct 172 ms 43844 KB Output is correct
74 Correct 169 ms 44648 KB Output is correct
75 Correct 183 ms 44776 KB Output is correct
76 Correct 129 ms 42500 KB Output is correct
77 Correct 166 ms 43644 KB Output is correct
78 Correct 193 ms 44636 KB Output is correct
79 Correct 145 ms 43788 KB Output is correct
80 Correct 109 ms 43384 KB Output is correct
81 Correct 160 ms 44672 KB Output is correct
82 Correct 152 ms 42432 KB Output is correct
83 Correct 166 ms 44600 KB Output is correct
84 Correct 166 ms 44688 KB Output is correct
85 Correct 165 ms 43884 KB Output is correct
86 Correct 144 ms 44408 KB Output is correct
87 Correct 132 ms 43420 KB Output is correct
88 Correct 195 ms 44164 KB Output is correct
89 Correct 112 ms 41980 KB Output is correct
90 Correct 143 ms 44196 KB Output is correct
91 Correct 137 ms 43020 KB Output is correct
92 Correct 130 ms 42828 KB Output is correct
93 Correct 143 ms 44336 KB Output is correct
94 Correct 140 ms 44220 KB Output is correct
95 Correct 154 ms 44068 KB Output is correct
96 Correct 159 ms 44248 KB Output is correct
97 Correct 152 ms 44284 KB Output is correct
98 Correct 134 ms 43356 KB Output is correct
99 Correct 114 ms 44488 KB Output is correct
100 Correct 130 ms 43456 KB Output is correct
101 Correct 131 ms 44504 KB Output is correct
102 Correct 624 ms 44036 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 37588 KB Output is correct
2 Correct 20 ms 37728 KB Output is correct
3 Correct 20 ms 37520 KB Output is correct
4 Correct 19 ms 37616 KB Output is correct
5 Correct 17 ms 37564 KB Output is correct
6 Correct 17 ms 37568 KB Output is correct
7 Correct 20 ms 37588 KB Output is correct
8 Correct 22 ms 37724 KB Output is correct
9 Correct 19 ms 37588 KB Output is correct
10 Correct 20 ms 37676 KB Output is correct
11 Correct 20 ms 37620 KB Output is correct
12 Correct 20 ms 37588 KB Output is correct
13 Correct 23 ms 37588 KB Output is correct
14 Correct 20 ms 37640 KB Output is correct
15 Correct 17 ms 37604 KB Output is correct
16 Correct 18 ms 37656 KB Output is correct
17 Correct 21 ms 37592 KB Output is correct
18 Correct 19 ms 37628 KB Output is correct
19 Correct 19 ms 37692 KB Output is correct
20 Correct 20 ms 37588 KB Output is correct
21 Correct 18 ms 37636 KB Output is correct
22 Correct 18 ms 37600 KB Output is correct
23 Correct 18 ms 37588 KB Output is correct
24 Correct 20 ms 37588 KB Output is correct
25 Correct 17 ms 37596 KB Output is correct
26 Correct 18 ms 37588 KB Output is correct
27 Correct 23 ms 37644 KB Output is correct
28 Correct 21 ms 37588 KB Output is correct
29 Correct 20 ms 37664 KB Output is correct
30 Correct 19 ms 37640 KB Output is correct
31 Correct 21 ms 37716 KB Output is correct
32 Correct 19 ms 37648 KB Output is correct
33 Correct 18 ms 37648 KB Output is correct
34 Correct 18 ms 37716 KB Output is correct
35 Correct 18 ms 37584 KB Output is correct
36 Correct 20 ms 37716 KB Output is correct
37 Correct 19 ms 37536 KB Output is correct
38 Correct 24 ms 37588 KB Output is correct
39 Correct 134 ms 44508 KB Output is correct
40 Correct 126 ms 44308 KB Output is correct
41 Correct 122 ms 44556 KB Output is correct
42 Correct 129 ms 44460 KB Output is correct
43 Correct 117 ms 44336 KB Output is correct
44 Correct 151 ms 44384 KB Output is correct
45 Correct 51 ms 43940 KB Output is correct
46 Correct 59 ms 44072 KB Output is correct
47 Correct 121 ms 44276 KB Output is correct
48 Correct 114 ms 44364 KB Output is correct
49 Correct 116 ms 44336 KB Output is correct
50 Correct 121 ms 44264 KB Output is correct
51 Correct 111 ms 43760 KB Output is correct
52 Correct 126 ms 44432 KB Output is correct
53 Correct 134 ms 43876 KB Output is correct
54 Correct 138 ms 43928 KB Output is correct
55 Correct 709 ms 61916 KB Output is correct
56 Correct 619 ms 57008 KB Output is correct
57 Correct 757 ms 64120 KB Output is correct
58 Correct 620 ms 56000 KB Output is correct
59 Correct 714 ms 56468 KB Output is correct
60 Correct 881 ms 63240 KB Output is correct
61 Correct 418 ms 64464 KB Output is correct
62 Correct 382 ms 64116 KB Output is correct
63 Correct 880 ms 64712 KB Output is correct
64 Correct 940 ms 64692 KB Output is correct
65 Correct 729 ms 63056 KB Output is correct
66 Correct 739 ms 63092 KB Output is correct
67 Correct 718 ms 63136 KB Output is correct
68 Correct 738 ms 63336 KB Output is correct
69 Correct 770 ms 63348 KB Output is correct
70 Correct 753 ms 63380 KB Output is correct
71 Correct 771 ms 63492 KB Output is correct
72 Correct 812 ms 63364 KB Output is correct
73 Correct 788 ms 63336 KB Output is correct
74 Correct 755 ms 63332 KB Output is correct
75 Correct 798 ms 63404 KB Output is correct
76 Correct 734 ms 63360 KB Output is correct
77 Correct 793 ms 63336 KB Output is correct
78 Correct 787 ms 63336 KB Output is correct
79 Correct 570 ms 64008 KB Output is correct
80 Correct 593 ms 64360 KB Output is correct
81 Execution timed out 1086 ms 55240 KB Time limit exceeded
82 Halted 0 ms 0 KB -