oj.uz

답안 #547087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547087 2022-04-09T13:49:42 Z leaked 푸드 코트 (JOI21_foodcourt) C++14
68 / 100
 1000 ms 63684 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

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 45012 KB Output is correct
2 Correct 22 ms 45080 KB Output is correct
3 Correct 21 ms 45060 KB Output is correct
4 Correct 21 ms 45140 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 20 ms 45012 KB Output is correct
7 Correct 22 ms 45240 KB Output is correct
8 Correct 22 ms 45140 KB Output is correct
9 Correct 22 ms 45124 KB Output is correct
10 Correct 23 ms 45092 KB Output is correct
11 Correct 23 ms 45204 KB Output is correct
12 Correct 23 ms 45072 KB Output is correct
13 Correct 21 ms 45116 KB Output is correct
14 Correct 21 ms 45040 KB Output is correct
15 Correct 21 ms 45008 KB Output is correct
16 Correct 22 ms 45048 KB Output is correct
17 Correct 22 ms 45000 KB Output is correct
18 Correct 23 ms 45116 KB Output is correct
19 Correct 21 ms 45012 KB Output is correct
20 Correct 21 ms 45140 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 45012 KB Output is correct
2 Correct 22 ms 45080 KB Output is correct
3 Correct 21 ms 45060 KB Output is correct
4 Correct 21 ms 45140 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 20 ms 45012 KB Output is correct
7 Correct 22 ms 45240 KB Output is correct
8 Correct 22 ms 45140 KB Output is correct
9 Correct 22 ms 45124 KB Output is correct
10 Correct 23 ms 45092 KB Output is correct
11 Correct 23 ms 45204 KB Output is correct
12 Correct 23 ms 45072 KB Output is correct
13 Correct 21 ms 45116 KB Output is correct
14 Correct 21 ms 45040 KB Output is correct
15 Correct 21 ms 45008 KB Output is correct
16 Correct 22 ms 45048 KB Output is correct
17 Correct 22 ms 45000 KB Output is correct
18 Correct 23 ms 45116 KB Output is correct
19 Correct 21 ms 45012 KB Output is correct
20 Correct 21 ms 45140 KB Output is correct
21 Correct 22 ms 45136 KB Output is correct
22 Correct 21 ms 45136 KB Output is correct
23 Correct 22 ms 45136 KB Output is correct
24 Correct 24 ms 45044 KB Output is correct
25 Correct 21 ms 45012 KB Output is correct
26 Correct 21 ms 45032 KB Output is correct
27 Correct 22 ms 45076 KB Output is correct
28 Correct 20 ms 45140 KB Output is correct
29 Correct 21 ms 45132 KB Output is correct
30 Correct 22 ms 45048 KB Output is correct
31 Correct 21 ms 45140 KB Output is correct
32 Correct 22 ms 45140 KB Output is correct
33 Correct 20 ms 45068 KB Output is correct
34 Correct 21 ms 45152 KB Output is correct
35 Correct 24 ms 45012 KB Output is correct
36 Correct 24 ms 45140 KB Output is correct
37 Correct 21 ms 45056 KB Output is correct
38 Correct 21 ms 45072 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 51996 KB Output is correct
2 Correct 127 ms 51736 KB Output is correct
3 Correct 114 ms 51908 KB Output is correct
4 Correct 111 ms 51948 KB Output is correct
5 Correct 129 ms 51772 KB Output is correct
6 Correct 152 ms 51732 KB Output is correct
7 Correct 57 ms 51324 KB Output is correct
8 Correct 61 ms 51564 KB Output is correct
9 Correct 110 ms 51688 KB Output is correct
10 Correct 112 ms 51732 KB Output is correct
11 Correct 112 ms 51648 KB Output is correct
12 Correct 114 ms 51676 KB Output is correct
13 Correct 114 ms 51228 KB Output is correct
14 Correct 128 ms 51896 KB Output is correct
15 Correct 132 ms 51456 KB Output is correct
16 Correct 140 ms 51428 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 444 ms 62020 KB Output is correct
2 Correct 341 ms 58568 KB Output is correct
3 Correct 412 ms 63356 KB Output is correct
4 Correct 291 ms 58032 KB Output is correct
5 Correct 293 ms 58504 KB Output is correct
6 Correct 393 ms 63304 KB Output is correct
7 Correct 131 ms 63580 KB Output is correct
8 Correct 136 ms 63684 KB Output is correct
9 Correct 346 ms 63420 KB Output is correct
10 Correct 345 ms 63360 KB Output is correct
11 Correct 402 ms 63152 KB Output is correct
12 Correct 496 ms 63116 KB Output is correct
13 Correct 382 ms 62988 KB Output is correct
14 Correct 416 ms 63084 KB Output is correct
15 Correct 461 ms 63276 KB Output is correct
16 Correct 489 ms 63280 KB Output is correct
17 Correct 601 ms 63236 KB Output is correct
18 Correct 424 ms 63304 KB Output is correct
19 Correct 436 ms 63336 KB Output is correct
20 Correct 436 ms 63304 KB Output is correct
21 Correct 462 ms 63304 KB Output is correct
22 Correct 439 ms 63304 KB Output is correct
23 Correct 444 ms 63216 KB Output is correct
24 Correct 448 ms 63244 KB Output is correct
25 Correct 307 ms 63372 KB Output is correct
26 Correct 322 ms 63560 KB Output is correct
27 Execution timed out 1096 ms 62896 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 45012 KB Output is correct
2 Correct 22 ms 45080 KB Output is correct
3 Correct 21 ms 45060 KB Output is correct
4 Correct 21 ms 45140 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 20 ms 45012 KB Output is correct
7 Correct 22 ms 45240 KB Output is correct
8 Correct 22 ms 45140 KB Output is correct
9 Correct 22 ms 45124 KB Output is correct
10 Correct 23 ms 45092 KB Output is correct
11 Correct 23 ms 45204 KB Output is correct
12 Correct 23 ms 45072 KB Output is correct
13 Correct 21 ms 45116 KB Output is correct
14 Correct 21 ms 45040 KB Output is correct
15 Correct 21 ms 45008 KB Output is correct
16 Correct 22 ms 45048 KB Output is correct
17 Correct 22 ms 45000 KB Output is correct
18 Correct 23 ms 45116 KB Output is correct
19 Correct 21 ms 45012 KB Output is correct
20 Correct 21 ms 45140 KB Output is correct
21 Correct 113 ms 51996 KB Output is correct
22 Correct 127 ms 51736 KB Output is correct
23 Correct 114 ms 51908 KB Output is correct
24 Correct 111 ms 51948 KB Output is correct
25 Correct 129 ms 51772 KB Output is correct
26 Correct 152 ms 51732 KB Output is correct
27 Correct 57 ms 51324 KB Output is correct
28 Correct 61 ms 51564 KB Output is correct
29 Correct 110 ms 51688 KB Output is correct
30 Correct 112 ms 51732 KB Output is correct
31 Correct 112 ms 51648 KB Output is correct
32 Correct 114 ms 51676 KB Output is correct
33 Correct 114 ms 51228 KB Output is correct
34 Correct 128 ms 51896 KB Output is correct
35 Correct 132 ms 51456 KB Output is correct
36 Correct 140 ms 51428 KB Output is correct
37 Correct 130 ms 51104 KB Output is correct
38 Correct 125 ms 50224 KB Output is correct
39 Correct 86 ms 50400 KB Output is correct
40 Correct 104 ms 51268 KB Output is correct
41 Correct 153 ms 51624 KB Output is correct
42 Correct 145 ms 51656 KB Output is correct
43 Correct 146 ms 51672 KB Output is correct
44 Correct 143 ms 51624 KB Output is correct
45 Correct 144 ms 51656 KB Output is correct
46 Correct 148 ms 51732 KB Output is correct
47 Correct 103 ms 52048 KB Output is correct
48 Correct 132 ms 51996 KB Output is correct
49 Correct 106 ms 49688 KB Output is correct
50 Correct 120 ms 50632 KB Output is correct
51 Correct 145 ms 51656 KB Output is correct
52 Correct 163 ms 51604 KB Output is correct
53 Correct 119 ms 50140 KB Output is correct
54 Correct 132 ms 51456 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 51336 KB Output is correct
2 Correct 170 ms 52196 KB Output is correct
3 Correct 192 ms 52164 KB Output is correct
4 Correct 143 ms 49980 KB Output is correct
5 Correct 156 ms 51112 KB Output is correct
6 Correct 201 ms 52148 KB Output is correct
7 Correct 128 ms 51332 KB Output is correct
8 Correct 119 ms 50932 KB Output is correct
9 Correct 139 ms 52080 KB Output is correct
10 Correct 117 ms 49836 KB Output is correct
11 Correct 162 ms 52088 KB Output is correct
12 Correct 166 ms 52132 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 45012 KB Output is correct
2 Correct 22 ms 45080 KB Output is correct
3 Correct 21 ms 45060 KB Output is correct
4 Correct 21 ms 45140 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 20 ms 45012 KB Output is correct
7 Correct 22 ms 45240 KB Output is correct
8 Correct 22 ms 45140 KB Output is correct
9 Correct 22 ms 45124 KB Output is correct
10 Correct 23 ms 45092 KB Output is correct
11 Correct 23 ms 45204 KB Output is correct
12 Correct 23 ms 45072 KB Output is correct
13 Correct 21 ms 45116 KB Output is correct
14 Correct 21 ms 45040 KB Output is correct
15 Correct 21 ms 45008 KB Output is correct
16 Correct 22 ms 45048 KB Output is correct
17 Correct 22 ms 45000 KB Output is correct
18 Correct 23 ms 45116 KB Output is correct
19 Correct 21 ms 45012 KB Output is correct
20 Correct 21 ms 45140 KB Output is correct
21 Correct 22 ms 45136 KB Output is correct
22 Correct 21 ms 45136 KB Output is correct
23 Correct 22 ms 45136 KB Output is correct
24 Correct 24 ms 45044 KB Output is correct
25 Correct 21 ms 45012 KB Output is correct
26 Correct 21 ms 45032 KB Output is correct
27 Correct 22 ms 45076 KB Output is correct
28 Correct 20 ms 45140 KB Output is correct
29 Correct 21 ms 45132 KB Output is correct
30 Correct 22 ms 45048 KB Output is correct
31 Correct 21 ms 45140 KB Output is correct
32 Correct 22 ms 45140 KB Output is correct
33 Correct 20 ms 45068 KB Output is correct
34 Correct 21 ms 45152 KB Output is correct
35 Correct 24 ms 45012 KB Output is correct
36 Correct 24 ms 45140 KB Output is correct
37 Correct 21 ms 45056 KB Output is correct
38 Correct 21 ms 45072 KB Output is correct
39 Correct 113 ms 51996 KB Output is correct
40 Correct 127 ms 51736 KB Output is correct
41 Correct 114 ms 51908 KB Output is correct
42 Correct 111 ms 51948 KB Output is correct
43 Correct 129 ms 51772 KB Output is correct
44 Correct 152 ms 51732 KB Output is correct
45 Correct 57 ms 51324 KB Output is correct
46 Correct 61 ms 51564 KB Output is correct
47 Correct 110 ms 51688 KB Output is correct
48 Correct 112 ms 51732 KB Output is correct
49 Correct 112 ms 51648 KB Output is correct
50 Correct 114 ms 51676 KB Output is correct
51 Correct 114 ms 51228 KB Output is correct
52 Correct 128 ms 51896 KB Output is correct
53 Correct 132 ms 51456 KB Output is correct
54 Correct 140 ms 51428 KB Output is correct
55 Correct 130 ms 51104 KB Output is correct
56 Correct 125 ms 50224 KB Output is correct
57 Correct 86 ms 50400 KB Output is correct
58 Correct 104 ms 51268 KB Output is correct
59 Correct 153 ms 51624 KB Output is correct
60 Correct 145 ms 51656 KB Output is correct
61 Correct 146 ms 51672 KB Output is correct
62 Correct 143 ms 51624 KB Output is correct
63 Correct 144 ms 51656 KB Output is correct
64 Correct 148 ms 51732 KB Output is correct
65 Correct 103 ms 52048 KB Output is correct
66 Correct 132 ms 51996 KB Output is correct
67 Correct 106 ms 49688 KB Output is correct
68 Correct 120 ms 50632 KB Output is correct
69 Correct 145 ms 51656 KB Output is correct
70 Correct 163 ms 51604 KB Output is correct
71 Correct 119 ms 50140 KB Output is correct
72 Correct 132 ms 51456 KB Output is correct
73 Correct 153 ms 51336 KB Output is correct
74 Correct 170 ms 52196 KB Output is correct
75 Correct 192 ms 52164 KB Output is correct
76 Correct 143 ms 49980 KB Output is correct
77 Correct 156 ms 51112 KB Output is correct
78 Correct 201 ms 52148 KB Output is correct
79 Correct 128 ms 51332 KB Output is correct
80 Correct 119 ms 50932 KB Output is correct
81 Correct 139 ms 52080 KB Output is correct
82 Correct 117 ms 49836 KB Output is correct
83 Correct 162 ms 52088 KB Output is correct
84 Correct 166 ms 52132 KB Output is correct
85 Correct 152 ms 51236 KB Output is correct
86 Correct 167 ms 51900 KB Output is correct
87 Correct 173 ms 50736 KB Output is correct
88 Correct 166 ms 51692 KB Output is correct
89 Correct 109 ms 49436 KB Output is correct
90 Correct 150 ms 51740 KB Output is correct
91 Correct 121 ms 50456 KB Output is correct
92 Correct 119 ms 50260 KB Output is correct
93 Correct 157 ms 51724 KB Output is correct
94 Correct 149 ms 51652 KB Output is correct
95 Correct 143 ms 51552 KB Output is correct
96 Correct 153 ms 51788 KB Output is correct
97 Correct 157 ms 51740 KB Output is correct
98 Correct 132 ms 50736 KB Output is correct
99 Correct 107 ms 51940 KB Output is correct
100 Correct 119 ms 50872 KB Output is correct
101 Correct 140 ms 52012 KB Output is correct
102 Correct 534 ms 51420 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 45012 KB Output is correct
2 Correct 22 ms 45080 KB Output is correct
3 Correct 21 ms 45060 KB Output is correct
4 Correct 21 ms 45140 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 20 ms 45012 KB Output is correct
7 Correct 22 ms 45240 KB Output is correct
8 Correct 22 ms 45140 KB Output is correct
9 Correct 22 ms 45124 KB Output is correct
10 Correct 23 ms 45092 KB Output is correct
11 Correct 23 ms 45204 KB Output is correct
12 Correct 23 ms 45072 KB Output is correct
13 Correct 21 ms 45116 KB Output is correct
14 Correct 21 ms 45040 KB Output is correct
15 Correct 21 ms 45008 KB Output is correct
16 Correct 22 ms 45048 KB Output is correct
17 Correct 22 ms 45000 KB Output is correct
18 Correct 23 ms 45116 KB Output is correct
19 Correct 21 ms 45012 KB Output is correct
20 Correct 21 ms 45140 KB Output is correct
21 Correct 22 ms 45136 KB Output is correct
22 Correct 21 ms 45136 KB Output is correct
23 Correct 22 ms 45136 KB Output is correct
24 Correct 24 ms 45044 KB Output is correct
25 Correct 21 ms 45012 KB Output is correct
26 Correct 21 ms 45032 KB Output is correct
27 Correct 22 ms 45076 KB Output is correct
28 Correct 20 ms 45140 KB Output is correct
29 Correct 21 ms 45132 KB Output is correct
30 Correct 22 ms 45048 KB Output is correct
31 Correct 21 ms 45140 KB Output is correct
32 Correct 22 ms 45140 KB Output is correct
33 Correct 20 ms 45068 KB Output is correct
34 Correct 21 ms 45152 KB Output is correct
35 Correct 24 ms 45012 KB Output is correct
36 Correct 24 ms 45140 KB Output is correct
37 Correct 21 ms 45056 KB Output is correct
38 Correct 21 ms 45072 KB Output is correct
39 Correct 113 ms 51996 KB Output is correct
40 Correct 127 ms 51736 KB Output is correct
41 Correct 114 ms 51908 KB Output is correct
42 Correct 111 ms 51948 KB Output is correct
43 Correct 129 ms 51772 KB Output is correct
44 Correct 152 ms 51732 KB Output is correct
45 Correct 57 ms 51324 KB Output is correct
46 Correct 61 ms 51564 KB Output is correct
47 Correct 110 ms 51688 KB Output is correct
48 Correct 112 ms 51732 KB Output is correct
49 Correct 112 ms 51648 KB Output is correct
50 Correct 114 ms 51676 KB Output is correct
51 Correct 114 ms 51228 KB Output is correct
52 Correct 128 ms 51896 KB Output is correct
53 Correct 132 ms 51456 KB Output is correct
54 Correct 140 ms 51428 KB Output is correct
55 Correct 444 ms 62020 KB Output is correct
56 Correct 341 ms 58568 KB Output is correct
57 Correct 412 ms 63356 KB Output is correct
58 Correct 291 ms 58032 KB Output is correct
59 Correct 293 ms 58504 KB Output is correct
60 Correct 393 ms 63304 KB Output is correct
61 Correct 131 ms 63580 KB Output is correct
62 Correct 136 ms 63684 KB Output is correct
63 Correct 346 ms 63420 KB Output is correct
64 Correct 345 ms 63360 KB Output is correct
65 Correct 402 ms 63152 KB Output is correct
66 Correct 496 ms 63116 KB Output is correct
67 Correct 382 ms 62988 KB Output is correct
68 Correct 416 ms 63084 KB Output is correct
69 Correct 461 ms 63276 KB Output is correct
70 Correct 489 ms 63280 KB Output is correct
71 Correct 601 ms 63236 KB Output is correct
72 Correct 424 ms 63304 KB Output is correct
73 Correct 436 ms 63336 KB Output is correct
74 Correct 436 ms 63304 KB Output is correct
75 Correct 462 ms 63304 KB Output is correct
76 Correct 439 ms 63304 KB Output is correct
77 Correct 444 ms 63216 KB Output is correct
78 Correct 448 ms 63244 KB Output is correct
79 Correct 307 ms 63372 KB Output is correct
80 Correct 322 ms 63560 KB Output is correct
81 Execution timed out 1096 ms 62896 KB Time limit exceeded
82 Halted 0 ms 0 KB -