oj.uz

답안 #547144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547144 2022-04-09T17:14:34 Z leaked 푸드 코트 (JOI21_foodcourt) C++14
89 / 100
 1000 ms 79236 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 ll inf=1e18;
const int N=3e5+1;
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
template<class T> bool umin(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],p4[4*N];
    ///add,whom,to_set
    int p3[4*N];
    struct node{
        ll x,y;
        node(){
            x=0,y=inf;
        }
    };
    node mg(node a,node b){
        if(a.x>b.x) swap(a.x,b.x);
        if(b.x>b.y) swap(b.x,b.y);
        if(a.x==b.x) umin(a.y,b.y);
        else umin(a.y,b.x);
        return a;
    }
    node tt[4*N];
    segtree(){
        fill(p1,p1+4*N,0);
        fill(p4,p4+4*N,inf);
        fill(p3,p3+4*N,-1);
    }
    bool check(ll a,ll b,ll c){
        if((a+c)<=0 && (b+c)<=0)
            return 0;
        return 1;
    }
    void push(int v,int tl,int tr){
        ll mn=min(tt[2*v].x,tt[2*v+1].x);
        for(auto &u : {v<<1,v<<1|1}){
            if(tt[u].x==mn && p4[v]!=inf){
                tt[u].x=p4[v];
                umax(p3[u],p3[v]);
                p4[u]=p4[v];
            }else tt[u].x+=p1[v],p4[u]=(p4[u]==inf?inf:p4[u]+p1[v]);
            tt[u].y+=p1[v];
            p1[u]+=p1[v];
        }
        p1[v]=0;p4[v]=inf;
    }

    void add(int l,int r,ll x,int t,int v,int tl,int tr){
        if(tl>r||tr<l) return;
        if(tl>=l&&tr<=r&&check(tt[v].x,tt[v].y,x)){
            tt[v].x+=x;
            if((tt[v].x)<0){
                umax(p3[v],t);
            }
            tt[v].y+=x;
            p1[v]+=x;
            if(umax(tt[v].x,0LL) || p4[v]!=inf)
                p4[v]=tt[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);
        tt[v]=mg(tt[2*v],tt[2*v+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);
    }
}sega1;
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];
            sega1.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]);
            sega1.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<<"ALO "<<
//            cerr<<"WO "<<sega1.get(l[i],1,0,n-1)<<endl;
            tl[i]=sega1.get(l[i],1,0,n-1)+1;tr[i]=i;
//            cout<<"ALO "<<tl[i]<<endl;
            if(tl[i]!=0) need[tl[i]-1].pb(i);
        }
//        sega1.get(977,1,0,n-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]==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;
}
/*
1457 1000 3
2 253 1112 1
1 872 1007 206029 1
3 978 1

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 36 ms 45056 KB Output is correct
2 Correct 25 ms 45140 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 27 ms 45084 KB Output is correct
5 Correct 20 ms 45044 KB Output is correct
6 Correct 23 ms 45012 KB Output is correct
7 Correct 22 ms 45140 KB Output is correct
8 Correct 24 ms 45096 KB Output is correct
9 Correct 32 ms 45116 KB Output is correct
10 Correct 24 ms 45104 KB Output is correct
11 Correct 22 ms 45140 KB Output is correct
12 Correct 23 ms 45140 KB Output is correct
13 Correct 21 ms 45012 KB Output is correct
14 Correct 21 ms 45140 KB Output is correct
15 Correct 22 ms 45012 KB Output is correct
16 Correct 23 ms 45148 KB Output is correct
17 Correct 23 ms 45020 KB Output is correct
18 Correct 25 ms 45084 KB Output is correct
19 Correct 24 ms 45056 KB Output is correct
20 Correct 24 ms 45072 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 45056 KB Output is correct
2 Correct 25 ms 45140 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 27 ms 45084 KB Output is correct
5 Correct 20 ms 45044 KB Output is correct
6 Correct 23 ms 45012 KB Output is correct
7 Correct 22 ms 45140 KB Output is correct
8 Correct 24 ms 45096 KB Output is correct
9 Correct 32 ms 45116 KB Output is correct
10 Correct 24 ms 45104 KB Output is correct
11 Correct 22 ms 45140 KB Output is correct
12 Correct 23 ms 45140 KB Output is correct
13 Correct 21 ms 45012 KB Output is correct
14 Correct 21 ms 45140 KB Output is correct
15 Correct 22 ms 45012 KB Output is correct
16 Correct 23 ms 45148 KB Output is correct
17 Correct 23 ms 45020 KB Output is correct
18 Correct 25 ms 45084 KB Output is correct
19 Correct 24 ms 45056 KB Output is correct
20 Correct 24 ms 45072 KB Output is correct
21 Correct 25 ms 45140 KB Output is correct
22 Correct 26 ms 45040 KB Output is correct
23 Correct 24 ms 45140 KB Output is correct
24 Correct 33 ms 45060 KB Output is correct
25 Correct 22 ms 45004 KB Output is correct
26 Correct 22 ms 45044 KB Output is correct
27 Correct 32 ms 45140 KB Output is correct
28 Correct 24 ms 45032 KB Output is correct
29 Correct 24 ms 45140 KB Output is correct
30 Correct 23 ms 45068 KB Output is correct
31 Correct 23 ms 45084 KB Output is correct
32 Correct 23 ms 45136 KB Output is correct
33 Correct 20 ms 45120 KB Output is correct
34 Correct 21 ms 45104 KB Output is correct
35 Correct 26 ms 45040 KB Output is correct
36 Correct 24 ms 45088 KB Output is correct
37 Correct 24 ms 45064 KB Output is correct
38 Correct 23 ms 45140 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 51944 KB Output is correct
2 Correct 138 ms 51756 KB Output is correct
3 Correct 136 ms 51988 KB Output is correct
4 Correct 131 ms 51908 KB Output is correct
5 Correct 160 ms 51908 KB Output is correct
6 Correct 150 ms 51672 KB Output is correct
7 Correct 63 ms 51400 KB Output is correct
8 Correct 61 ms 51468 KB Output is correct
9 Correct 126 ms 51672 KB Output is correct
10 Correct 138 ms 51860 KB Output is correct
11 Correct 126 ms 51732 KB Output is correct
12 Correct 129 ms 51668 KB Output is correct
13 Correct 126 ms 51192 KB Output is correct
14 Correct 151 ms 52072 KB Output is correct
15 Correct 152 ms 51304 KB Output is correct
16 Correct 159 ms 51452 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 503 ms 62244 KB Output is correct
2 Correct 420 ms 58516 KB Output is correct
3 Correct 512 ms 63416 KB Output is correct
4 Correct 348 ms 58048 KB Output is correct
5 Correct 335 ms 58444 KB Output is correct
6 Correct 465 ms 63324 KB Output is correct
7 Correct 142 ms 63580 KB Output is correct
8 Correct 136 ms 63620 KB Output is correct
9 Correct 396 ms 63436 KB Output is correct
10 Correct 391 ms 63368 KB Output is correct
11 Correct 477 ms 63104 KB Output is correct
12 Correct 579 ms 63064 KB Output is correct
13 Correct 475 ms 62984 KB Output is correct
14 Correct 520 ms 63248 KB Output is correct
15 Correct 578 ms 63260 KB Output is correct
16 Correct 571 ms 63336 KB Output is correct
17 Correct 575 ms 63404 KB Output is correct
18 Correct 504 ms 63316 KB Output is correct
19 Correct 524 ms 63268 KB Output is correct
20 Correct 544 ms 63284 KB Output is correct
21 Correct 675 ms 63240 KB Output is correct
22 Correct 634 ms 63244 KB Output is correct
23 Correct 533 ms 63504 KB Output is correct
24 Correct 606 ms 63288 KB Output is correct
25 Correct 378 ms 63288 KB Output is correct
26 Correct 392 ms 63720 KB Output is correct
27 Correct 401 ms 62956 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 45056 KB Output is correct
2 Correct 25 ms 45140 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 27 ms 45084 KB Output is correct
5 Correct 20 ms 45044 KB Output is correct
6 Correct 23 ms 45012 KB Output is correct
7 Correct 22 ms 45140 KB Output is correct
8 Correct 24 ms 45096 KB Output is correct
9 Correct 32 ms 45116 KB Output is correct
10 Correct 24 ms 45104 KB Output is correct
11 Correct 22 ms 45140 KB Output is correct
12 Correct 23 ms 45140 KB Output is correct
13 Correct 21 ms 45012 KB Output is correct
14 Correct 21 ms 45140 KB Output is correct
15 Correct 22 ms 45012 KB Output is correct
16 Correct 23 ms 45148 KB Output is correct
17 Correct 23 ms 45020 KB Output is correct
18 Correct 25 ms 45084 KB Output is correct
19 Correct 24 ms 45056 KB Output is correct
20 Correct 24 ms 45072 KB Output is correct
21 Correct 134 ms 51944 KB Output is correct
22 Correct 138 ms 51756 KB Output is correct
23 Correct 136 ms 51988 KB Output is correct
24 Correct 131 ms 51908 KB Output is correct
25 Correct 160 ms 51908 KB Output is correct
26 Correct 150 ms 51672 KB Output is correct
27 Correct 63 ms 51400 KB Output is correct
28 Correct 61 ms 51468 KB Output is correct
29 Correct 126 ms 51672 KB Output is correct
30 Correct 138 ms 51860 KB Output is correct
31 Correct 126 ms 51732 KB Output is correct
32 Correct 129 ms 51668 KB Output is correct
33 Correct 126 ms 51192 KB Output is correct
34 Correct 151 ms 52072 KB Output is correct
35 Correct 152 ms 51304 KB Output is correct
36 Correct 159 ms 51452 KB Output is correct
37 Correct 184 ms 51156 KB Output is correct
38 Correct 155 ms 50236 KB Output is correct
39 Correct 98 ms 50396 KB Output is correct
40 Correct 122 ms 51256 KB Output is correct
41 Correct 191 ms 51560 KB Output is correct
42 Correct 179 ms 51644 KB Output is correct
43 Correct 196 ms 51732 KB Output is correct
44 Correct 205 ms 51704 KB Output is correct
45 Correct 183 ms 51700 KB Output is correct
46 Correct 199 ms 51672 KB Output is correct
47 Correct 111 ms 51996 KB Output is correct
48 Correct 167 ms 51968 KB Output is correct
49 Correct 161 ms 49688 KB Output is correct
50 Correct 233 ms 50624 KB Output is correct
51 Correct 245 ms 51672 KB Output is correct
52 Correct 234 ms 51608 KB Output is correct
53 Correct 159 ms 50048 KB Output is correct
54 Correct 198 ms 51456 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 51284 KB Output is correct
2 Correct 250 ms 51972 KB Output is correct
3 Correct 253 ms 52108 KB Output is correct
4 Correct 161 ms 49984 KB Output is correct
5 Correct 188 ms 51152 KB Output is correct
6 Correct 210 ms 52056 KB Output is correct
7 Correct 148 ms 51432 KB Output is correct
8 Correct 128 ms 50852 KB Output is correct
9 Correct 157 ms 52096 KB Output is correct
10 Correct 127 ms 49840 KB Output is correct
11 Correct 188 ms 52112 KB Output is correct
12 Correct 177 ms 52076 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 45056 KB Output is correct
2 Correct 25 ms 45140 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 27 ms 45084 KB Output is correct
5 Correct 20 ms 45044 KB Output is correct
6 Correct 23 ms 45012 KB Output is correct
7 Correct 22 ms 45140 KB Output is correct
8 Correct 24 ms 45096 KB Output is correct
9 Correct 32 ms 45116 KB Output is correct
10 Correct 24 ms 45104 KB Output is correct
11 Correct 22 ms 45140 KB Output is correct
12 Correct 23 ms 45140 KB Output is correct
13 Correct 21 ms 45012 KB Output is correct
14 Correct 21 ms 45140 KB Output is correct
15 Correct 22 ms 45012 KB Output is correct
16 Correct 23 ms 45148 KB Output is correct
17 Correct 23 ms 45020 KB Output is correct
18 Correct 25 ms 45084 KB Output is correct
19 Correct 24 ms 45056 KB Output is correct
20 Correct 24 ms 45072 KB Output is correct
21 Correct 25 ms 45140 KB Output is correct
22 Correct 26 ms 45040 KB Output is correct
23 Correct 24 ms 45140 KB Output is correct
24 Correct 33 ms 45060 KB Output is correct
25 Correct 22 ms 45004 KB Output is correct
26 Correct 22 ms 45044 KB Output is correct
27 Correct 32 ms 45140 KB Output is correct
28 Correct 24 ms 45032 KB Output is correct
29 Correct 24 ms 45140 KB Output is correct
30 Correct 23 ms 45068 KB Output is correct
31 Correct 23 ms 45084 KB Output is correct
32 Correct 23 ms 45136 KB Output is correct
33 Correct 20 ms 45120 KB Output is correct
34 Correct 21 ms 45104 KB Output is correct
35 Correct 26 ms 45040 KB Output is correct
36 Correct 24 ms 45088 KB Output is correct
37 Correct 24 ms 45064 KB Output is correct
38 Correct 23 ms 45140 KB Output is correct
39 Correct 134 ms 51944 KB Output is correct
40 Correct 138 ms 51756 KB Output is correct
41 Correct 136 ms 51988 KB Output is correct
42 Correct 131 ms 51908 KB Output is correct
43 Correct 160 ms 51908 KB Output is correct
44 Correct 150 ms 51672 KB Output is correct
45 Correct 63 ms 51400 KB Output is correct
46 Correct 61 ms 51468 KB Output is correct
47 Correct 126 ms 51672 KB Output is correct
48 Correct 138 ms 51860 KB Output is correct
49 Correct 126 ms 51732 KB Output is correct
50 Correct 129 ms 51668 KB Output is correct
51 Correct 126 ms 51192 KB Output is correct
52 Correct 151 ms 52072 KB Output is correct
53 Correct 152 ms 51304 KB Output is correct
54 Correct 159 ms 51452 KB Output is correct
55 Correct 184 ms 51156 KB Output is correct
56 Correct 155 ms 50236 KB Output is correct
57 Correct 98 ms 50396 KB Output is correct
58 Correct 122 ms 51256 KB Output is correct
59 Correct 191 ms 51560 KB Output is correct
60 Correct 179 ms 51644 KB Output is correct
61 Correct 196 ms 51732 KB Output is correct
62 Correct 205 ms 51704 KB Output is correct
63 Correct 183 ms 51700 KB Output is correct
64 Correct 199 ms 51672 KB Output is correct
65 Correct 111 ms 51996 KB Output is correct
66 Correct 167 ms 51968 KB Output is correct
67 Correct 161 ms 49688 KB Output is correct
68 Correct 233 ms 50624 KB Output is correct
69 Correct 245 ms 51672 KB Output is correct
70 Correct 234 ms 51608 KB Output is correct
71 Correct 159 ms 50048 KB Output is correct
72 Correct 198 ms 51456 KB Output is correct
73 Correct 256 ms 51284 KB Output is correct
74 Correct 250 ms 51972 KB Output is correct
75 Correct 253 ms 52108 KB Output is correct
76 Correct 161 ms 49984 KB Output is correct
77 Correct 188 ms 51152 KB Output is correct
78 Correct 210 ms 52056 KB Output is correct
79 Correct 148 ms 51432 KB Output is correct
80 Correct 128 ms 50852 KB Output is correct
81 Correct 157 ms 52096 KB Output is correct
82 Correct 127 ms 49840 KB Output is correct
83 Correct 188 ms 52112 KB Output is correct
84 Correct 177 ms 52076 KB Output is correct
85 Correct 165 ms 51288 KB Output is correct
86 Correct 180 ms 51856 KB Output is correct
87 Correct 152 ms 50756 KB Output is correct
88 Correct 169 ms 51632 KB Output is correct
89 Correct 114 ms 49456 KB Output is correct
90 Correct 163 ms 51668 KB Output is correct
91 Correct 147 ms 50588 KB Output is correct
92 Correct 134 ms 50200 KB Output is correct
93 Correct 173 ms 51664 KB Output is correct
94 Correct 166 ms 51652 KB Output is correct
95 Correct 159 ms 51572 KB Output is correct
96 Correct 179 ms 51720 KB Output is correct
97 Correct 179 ms 51668 KB Output is correct
98 Correct 161 ms 50836 KB Output is correct
99 Correct 132 ms 51932 KB Output is correct
100 Correct 132 ms 50860 KB Output is correct
101 Correct 167 ms 51944 KB Output is correct
102 Correct 163 ms 51652 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 45056 KB Output is correct
2 Correct 25 ms 45140 KB Output is correct
3 Correct 24 ms 45012 KB Output is correct
4 Correct 27 ms 45084 KB Output is correct
5 Correct 20 ms 45044 KB Output is correct
6 Correct 23 ms 45012 KB Output is correct
7 Correct 22 ms 45140 KB Output is correct
8 Correct 24 ms 45096 KB Output is correct
9 Correct 32 ms 45116 KB Output is correct
10 Correct 24 ms 45104 KB Output is correct
11 Correct 22 ms 45140 KB Output is correct
12 Correct 23 ms 45140 KB Output is correct
13 Correct 21 ms 45012 KB Output is correct
14 Correct 21 ms 45140 KB Output is correct
15 Correct 22 ms 45012 KB Output is correct
16 Correct 23 ms 45148 KB Output is correct
17 Correct 23 ms 45020 KB Output is correct
18 Correct 25 ms 45084 KB Output is correct
19 Correct 24 ms 45056 KB Output is correct
20 Correct 24 ms 45072 KB Output is correct
21 Correct 25 ms 45140 KB Output is correct
22 Correct 26 ms 45040 KB Output is correct
23 Correct 24 ms 45140 KB Output is correct
24 Correct 33 ms 45060 KB Output is correct
25 Correct 22 ms 45004 KB Output is correct
26 Correct 22 ms 45044 KB Output is correct
27 Correct 32 ms 45140 KB Output is correct
28 Correct 24 ms 45032 KB Output is correct
29 Correct 24 ms 45140 KB Output is correct
30 Correct 23 ms 45068 KB Output is correct
31 Correct 23 ms 45084 KB Output is correct
32 Correct 23 ms 45136 KB Output is correct
33 Correct 20 ms 45120 KB Output is correct
34 Correct 21 ms 45104 KB Output is correct
35 Correct 26 ms 45040 KB Output is correct
36 Correct 24 ms 45088 KB Output is correct
37 Correct 24 ms 45064 KB Output is correct
38 Correct 23 ms 45140 KB Output is correct
39 Correct 134 ms 51944 KB Output is correct
40 Correct 138 ms 51756 KB Output is correct
41 Correct 136 ms 51988 KB Output is correct
42 Correct 131 ms 51908 KB Output is correct
43 Correct 160 ms 51908 KB Output is correct
44 Correct 150 ms 51672 KB Output is correct
45 Correct 63 ms 51400 KB Output is correct
46 Correct 61 ms 51468 KB Output is correct
47 Correct 126 ms 51672 KB Output is correct
48 Correct 138 ms 51860 KB Output is correct
49 Correct 126 ms 51732 KB Output is correct
50 Correct 129 ms 51668 KB Output is correct
51 Correct 126 ms 51192 KB Output is correct
52 Correct 151 ms 52072 KB Output is correct
53 Correct 152 ms 51304 KB Output is correct
54 Correct 159 ms 51452 KB Output is correct
55 Correct 503 ms 62244 KB Output is correct
56 Correct 420 ms 58516 KB Output is correct
57 Correct 512 ms 63416 KB Output is correct
58 Correct 348 ms 58048 KB Output is correct
59 Correct 335 ms 58444 KB Output is correct
60 Correct 465 ms 63324 KB Output is correct
61 Correct 142 ms 63580 KB Output is correct
62 Correct 136 ms 63620 KB Output is correct
63 Correct 396 ms 63436 KB Output is correct
64 Correct 391 ms 63368 KB Output is correct
65 Correct 477 ms 63104 KB Output is correct
66 Correct 579 ms 63064 KB Output is correct
67 Correct 475 ms 62984 KB Output is correct
68 Correct 520 ms 63248 KB Output is correct
69 Correct 578 ms 63260 KB Output is correct
70 Correct 571 ms 63336 KB Output is correct
71 Correct 575 ms 63404 KB Output is correct
72 Correct 504 ms 63316 KB Output is correct
73 Correct 524 ms 63268 KB Output is correct
74 Correct 544 ms 63284 KB Output is correct
75 Correct 675 ms 63240 KB Output is correct
76 Correct 634 ms 63244 KB Output is correct
77 Correct 533 ms 63504 KB Output is correct
78 Correct 606 ms 63288 KB Output is correct
79 Correct 378 ms 63288 KB Output is correct
80 Correct 392 ms 63720 KB Output is correct
81 Correct 401 ms 62956 KB Output is correct
82 Correct 184 ms 51156 KB Output is correct
83 Correct 155 ms 50236 KB Output is correct
84 Correct 98 ms 50396 KB Output is correct
85 Correct 122 ms 51256 KB Output is correct
86 Correct 191 ms 51560 KB Output is correct
87 Correct 179 ms 51644 KB Output is correct
88 Correct 196 ms 51732 KB Output is correct
89 Correct 205 ms 51704 KB Output is correct
90 Correct 183 ms 51700 KB Output is correct
91 Correct 199 ms 51672 KB Output is correct
92 Correct 111 ms 51996 KB Output is correct
93 Correct 167 ms 51968 KB Output is correct
94 Correct 161 ms 49688 KB Output is correct
95 Correct 233 ms 50624 KB Output is correct
96 Correct 245 ms 51672 KB Output is correct
97 Correct 234 ms 51608 KB Output is correct
98 Correct 159 ms 50048 KB Output is correct
99 Correct 198 ms 51456 KB Output is correct
100 Correct 256 ms 51284 KB Output is correct
101 Correct 250 ms 51972 KB Output is correct
102 Correct 253 ms 52108 KB Output is correct
103 Correct 161 ms 49984 KB Output is correct
104 Correct 188 ms 51152 KB Output is correct
105 Correct 210 ms 52056 KB Output is correct
106 Correct 148 ms 51432 KB Output is correct
107 Correct 128 ms 50852 KB Output is correct
108 Correct 157 ms 52096 KB Output is correct
109 Correct 127 ms 49840 KB Output is correct
110 Correct 188 ms 52112 KB Output is correct
111 Correct 177 ms 52076 KB Output is correct
112 Correct 165 ms 51288 KB Output is correct
113 Correct 180 ms 51856 KB Output is correct
114 Correct 152 ms 50756 KB Output is correct
115 Correct 169 ms 51632 KB Output is correct
116 Correct 114 ms 49456 KB Output is correct
117 Correct 163 ms 51668 KB Output is correct
118 Correct 147 ms 50588 KB Output is correct
119 Correct 134 ms 50200 KB Output is correct
120 Correct 173 ms 51664 KB Output is correct
121 Correct 166 ms 51652 KB Output is correct
122 Correct 159 ms 51572 KB Output is correct
123 Correct 179 ms 51720 KB Output is correct
124 Correct 179 ms 51668 KB Output is correct
125 Correct 161 ms 50836 KB Output is correct
126 Correct 132 ms 51932 KB Output is correct
127 Correct 132 ms 50860 KB Output is correct
128 Correct 167 ms 51944 KB Output is correct
129 Correct 163 ms 51652 KB Output is correct
130 Correct 881 ms 71952 KB Output is correct
131 Correct 601 ms 64496 KB Output is correct
132 Correct 905 ms 71960 KB Output is correct
133 Correct 791 ms 76032 KB Output is correct
134 Correct 821 ms 72540 KB Output is correct
135 Correct 819 ms 77608 KB Output is correct
136 Correct 918 ms 79212 KB Output is correct
137 Execution timed out 1048 ms 79236 KB Time limit exceeded
138 Halted 0 ms 0 KB -