oj.uz

답안 #547140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547140 2022-04-09T17:12:39 Z leaked 푸드 코트 (JOI21_foodcourt) C++14
89 / 100
 1000 ms 89436 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){
        int 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,int 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 24 ms 49812 KB Output is correct
2 Correct 24 ms 49840 KB Output is correct
3 Correct 24 ms 49720 KB Output is correct
4 Correct 27 ms 49876 KB Output is correct
5 Correct 23 ms 49748 KB Output is correct
6 Correct 25 ms 49864 KB Output is correct
7 Correct 24 ms 49876 KB Output is correct
8 Correct 31 ms 49768 KB Output is correct
9 Correct 31 ms 49864 KB Output is correct
10 Correct 32 ms 49816 KB Output is correct
11 Correct 29 ms 49804 KB Output is correct
12 Correct 24 ms 49800 KB Output is correct
13 Correct 22 ms 49748 KB Output is correct
14 Correct 24 ms 49940 KB Output is correct
15 Correct 24 ms 49876 KB Output is correct
16 Correct 24 ms 49876 KB Output is correct
17 Correct 24 ms 49740 KB Output is correct
18 Correct 26 ms 49876 KB Output is correct
19 Correct 25 ms 49748 KB Output is correct
20 Correct 25 ms 49876 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 49812 KB Output is correct
2 Correct 24 ms 49840 KB Output is correct
3 Correct 24 ms 49720 KB Output is correct
4 Correct 27 ms 49876 KB Output is correct
5 Correct 23 ms 49748 KB Output is correct
6 Correct 25 ms 49864 KB Output is correct
7 Correct 24 ms 49876 KB Output is correct
8 Correct 31 ms 49768 KB Output is correct
9 Correct 31 ms 49864 KB Output is correct
10 Correct 32 ms 49816 KB Output is correct
11 Correct 29 ms 49804 KB Output is correct
12 Correct 24 ms 49800 KB Output is correct
13 Correct 22 ms 49748 KB Output is correct
14 Correct 24 ms 49940 KB Output is correct
15 Correct 24 ms 49876 KB Output is correct
16 Correct 24 ms 49876 KB Output is correct
17 Correct 24 ms 49740 KB Output is correct
18 Correct 26 ms 49876 KB Output is correct
19 Correct 25 ms 49748 KB Output is correct
20 Correct 25 ms 49876 KB Output is correct
21 Correct 27 ms 49868 KB Output is correct
22 Correct 32 ms 49956 KB Output is correct
23 Correct 27 ms 49752 KB Output is correct
24 Correct 27 ms 49820 KB Output is correct
25 Correct 25 ms 49828 KB Output is correct
26 Correct 24 ms 49824 KB Output is correct
27 Correct 25 ms 49876 KB Output is correct
28 Correct 24 ms 49768 KB Output is correct
29 Correct 27 ms 49828 KB Output is correct
30 Correct 27 ms 49788 KB Output is correct
31 Correct 28 ms 49896 KB Output is correct
32 Correct 28 ms 49836 KB Output is correct
33 Correct 26 ms 49848 KB Output is correct
34 Correct 24 ms 49876 KB Output is correct
35 Correct 25 ms 49848 KB Output is correct
36 Correct 26 ms 49800 KB Output is correct
37 Correct 28 ms 49764 KB Output is correct
38 Correct 26 ms 49876 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 58356 KB Output is correct
2 Correct 167 ms 58040 KB Output is correct
3 Correct 147 ms 58304 KB Output is correct
4 Correct 162 ms 58268 KB Output is correct
5 Correct 144 ms 58104 KB Output is correct
6 Correct 162 ms 58080 KB Output is correct
7 Correct 61 ms 57552 KB Output is correct
8 Correct 63 ms 57800 KB Output is correct
9 Correct 151 ms 58000 KB Output is correct
10 Correct 160 ms 58020 KB Output is correct
11 Correct 129 ms 58056 KB Output is correct
12 Correct 132 ms 58060 KB Output is correct
13 Correct 137 ms 57420 KB Output is correct
14 Correct 160 ms 58392 KB Output is correct
15 Correct 151 ms 57672 KB Output is correct
16 Correct 157 ms 57660 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 72972 KB Output is correct
2 Correct 439 ms 68080 KB Output is correct
3 Correct 553 ms 74676 KB Output is correct
4 Correct 341 ms 67236 KB Output is correct
5 Correct 411 ms 67832 KB Output is correct
6 Correct 473 ms 74424 KB Output is correct
7 Correct 149 ms 74820 KB Output is correct
8 Correct 137 ms 74908 KB Output is correct
9 Correct 395 ms 74488 KB Output is correct
10 Correct 399 ms 74348 KB Output is correct
11 Correct 544 ms 73828 KB Output is correct
12 Correct 520 ms 73864 KB Output is correct
13 Correct 471 ms 73804 KB Output is correct
14 Correct 609 ms 74500 KB Output is correct
15 Correct 679 ms 74516 KB Output is correct
16 Correct 562 ms 74352 KB Output is correct
17 Correct 615 ms 74376 KB Output is correct
18 Correct 570 ms 74468 KB Output is correct
19 Correct 559 ms 74452 KB Output is correct
20 Correct 556 ms 74472 KB Output is correct
21 Correct 627 ms 74356 KB Output is correct
22 Correct 683 ms 74344 KB Output is correct
23 Correct 592 ms 74372 KB Output is correct
24 Correct 587 ms 74472 KB Output is correct
25 Correct 399 ms 74468 KB Output is correct
26 Correct 390 ms 75096 KB Output is correct
27 Correct 437 ms 75176 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 49812 KB Output is correct
2 Correct 24 ms 49840 KB Output is correct
3 Correct 24 ms 49720 KB Output is correct
4 Correct 27 ms 49876 KB Output is correct
5 Correct 23 ms 49748 KB Output is correct
6 Correct 25 ms 49864 KB Output is correct
7 Correct 24 ms 49876 KB Output is correct
8 Correct 31 ms 49768 KB Output is correct
9 Correct 31 ms 49864 KB Output is correct
10 Correct 32 ms 49816 KB Output is correct
11 Correct 29 ms 49804 KB Output is correct
12 Correct 24 ms 49800 KB Output is correct
13 Correct 22 ms 49748 KB Output is correct
14 Correct 24 ms 49940 KB Output is correct
15 Correct 24 ms 49876 KB Output is correct
16 Correct 24 ms 49876 KB Output is correct
17 Correct 24 ms 49740 KB Output is correct
18 Correct 26 ms 49876 KB Output is correct
19 Correct 25 ms 49748 KB Output is correct
20 Correct 25 ms 49876 KB Output is correct
21 Correct 140 ms 58356 KB Output is correct
22 Correct 167 ms 58040 KB Output is correct
23 Correct 147 ms 58304 KB Output is correct
24 Correct 162 ms 58268 KB Output is correct
25 Correct 144 ms 58104 KB Output is correct
26 Correct 162 ms 58080 KB Output is correct
27 Correct 61 ms 57552 KB Output is correct
28 Correct 63 ms 57800 KB Output is correct
29 Correct 151 ms 58000 KB Output is correct
30 Correct 160 ms 58020 KB Output is correct
31 Correct 129 ms 58056 KB Output is correct
32 Correct 132 ms 58060 KB Output is correct
33 Correct 137 ms 57420 KB Output is correct
34 Correct 160 ms 58392 KB Output is correct
35 Correct 151 ms 57672 KB Output is correct
36 Correct 157 ms 57660 KB Output is correct
37 Correct 173 ms 57400 KB Output is correct
38 Correct 154 ms 56256 KB Output is correct
39 Correct 106 ms 56492 KB Output is correct
40 Correct 108 ms 57504 KB Output is correct
41 Correct 170 ms 57852 KB Output is correct
42 Correct 184 ms 57928 KB Output is correct
43 Correct 227 ms 58192 KB Output is correct
44 Correct 202 ms 58072 KB Output is correct
45 Correct 173 ms 58044 KB Output is correct
46 Correct 199 ms 58124 KB Output is correct
47 Correct 108 ms 58296 KB Output is correct
48 Correct 156 ms 58280 KB Output is correct
49 Correct 156 ms 55444 KB Output is correct
50 Correct 187 ms 56648 KB Output is correct
51 Correct 182 ms 57932 KB Output is correct
52 Correct 212 ms 57992 KB Output is correct
53 Correct 140 ms 55968 KB Output is correct
54 Correct 204 ms 57732 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 57560 KB Output is correct
2 Correct 236 ms 58372 KB Output is correct
3 Correct 205 ms 58440 KB Output is correct
4 Correct 154 ms 55832 KB Output is correct
5 Correct 186 ms 57296 KB Output is correct
6 Correct 194 ms 58480 KB Output is correct
7 Correct 146 ms 57476 KB Output is correct
8 Correct 128 ms 57020 KB Output is correct
9 Correct 175 ms 58608 KB Output is correct
10 Correct 134 ms 55668 KB Output is correct
11 Correct 192 ms 58436 KB Output is correct
12 Correct 226 ms 58568 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 49812 KB Output is correct
2 Correct 24 ms 49840 KB Output is correct
3 Correct 24 ms 49720 KB Output is correct
4 Correct 27 ms 49876 KB Output is correct
5 Correct 23 ms 49748 KB Output is correct
6 Correct 25 ms 49864 KB Output is correct
7 Correct 24 ms 49876 KB Output is correct
8 Correct 31 ms 49768 KB Output is correct
9 Correct 31 ms 49864 KB Output is correct
10 Correct 32 ms 49816 KB Output is correct
11 Correct 29 ms 49804 KB Output is correct
12 Correct 24 ms 49800 KB Output is correct
13 Correct 22 ms 49748 KB Output is correct
14 Correct 24 ms 49940 KB Output is correct
15 Correct 24 ms 49876 KB Output is correct
16 Correct 24 ms 49876 KB Output is correct
17 Correct 24 ms 49740 KB Output is correct
18 Correct 26 ms 49876 KB Output is correct
19 Correct 25 ms 49748 KB Output is correct
20 Correct 25 ms 49876 KB Output is correct
21 Correct 27 ms 49868 KB Output is correct
22 Correct 32 ms 49956 KB Output is correct
23 Correct 27 ms 49752 KB Output is correct
24 Correct 27 ms 49820 KB Output is correct
25 Correct 25 ms 49828 KB Output is correct
26 Correct 24 ms 49824 KB Output is correct
27 Correct 25 ms 49876 KB Output is correct
28 Correct 24 ms 49768 KB Output is correct
29 Correct 27 ms 49828 KB Output is correct
30 Correct 27 ms 49788 KB Output is correct
31 Correct 28 ms 49896 KB Output is correct
32 Correct 28 ms 49836 KB Output is correct
33 Correct 26 ms 49848 KB Output is correct
34 Correct 24 ms 49876 KB Output is correct
35 Correct 25 ms 49848 KB Output is correct
36 Correct 26 ms 49800 KB Output is correct
37 Correct 28 ms 49764 KB Output is correct
38 Correct 26 ms 49876 KB Output is correct
39 Correct 140 ms 58356 KB Output is correct
40 Correct 167 ms 58040 KB Output is correct
41 Correct 147 ms 58304 KB Output is correct
42 Correct 162 ms 58268 KB Output is correct
43 Correct 144 ms 58104 KB Output is correct
44 Correct 162 ms 58080 KB Output is correct
45 Correct 61 ms 57552 KB Output is correct
46 Correct 63 ms 57800 KB Output is correct
47 Correct 151 ms 58000 KB Output is correct
48 Correct 160 ms 58020 KB Output is correct
49 Correct 129 ms 58056 KB Output is correct
50 Correct 132 ms 58060 KB Output is correct
51 Correct 137 ms 57420 KB Output is correct
52 Correct 160 ms 58392 KB Output is correct
53 Correct 151 ms 57672 KB Output is correct
54 Correct 157 ms 57660 KB Output is correct
55 Correct 173 ms 57400 KB Output is correct
56 Correct 154 ms 56256 KB Output is correct
57 Correct 106 ms 56492 KB Output is correct
58 Correct 108 ms 57504 KB Output is correct
59 Correct 170 ms 57852 KB Output is correct
60 Correct 184 ms 57928 KB Output is correct
61 Correct 227 ms 58192 KB Output is correct
62 Correct 202 ms 58072 KB Output is correct
63 Correct 173 ms 58044 KB Output is correct
64 Correct 199 ms 58124 KB Output is correct
65 Correct 108 ms 58296 KB Output is correct
66 Correct 156 ms 58280 KB Output is correct
67 Correct 156 ms 55444 KB Output is correct
68 Correct 187 ms 56648 KB Output is correct
69 Correct 182 ms 57932 KB Output is correct
70 Correct 212 ms 57992 KB Output is correct
71 Correct 140 ms 55968 KB Output is correct
72 Correct 204 ms 57732 KB Output is correct
73 Correct 219 ms 57560 KB Output is correct
74 Correct 236 ms 58372 KB Output is correct
75 Correct 205 ms 58440 KB Output is correct
76 Correct 154 ms 55832 KB Output is correct
77 Correct 186 ms 57296 KB Output is correct
78 Correct 194 ms 58480 KB Output is correct
79 Correct 146 ms 57476 KB Output is correct
80 Correct 128 ms 57020 KB Output is correct
81 Correct 175 ms 58608 KB Output is correct
82 Correct 134 ms 55668 KB Output is correct
83 Correct 192 ms 58436 KB Output is correct
84 Correct 226 ms 58568 KB Output is correct
85 Correct 187 ms 57592 KB Output is correct
86 Correct 223 ms 58320 KB Output is correct
87 Correct 174 ms 56892 KB Output is correct
88 Correct 184 ms 57944 KB Output is correct
89 Correct 125 ms 55240 KB Output is correct
90 Correct 210 ms 57992 KB Output is correct
91 Correct 152 ms 56776 KB Output is correct
92 Correct 141 ms 56284 KB Output is correct
93 Correct 190 ms 57996 KB Output is correct
94 Correct 187 ms 58000 KB Output is correct
95 Correct 168 ms 57880 KB Output is correct
96 Correct 187 ms 58008 KB Output is correct
97 Correct 264 ms 58028 KB Output is correct
98 Correct 170 ms 56896 KB Output is correct
99 Correct 139 ms 58328 KB Output is correct
100 Correct 158 ms 57016 KB Output is correct
101 Correct 171 ms 58400 KB Output is correct
102 Correct 182 ms 57684 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 49812 KB Output is correct
2 Correct 24 ms 49840 KB Output is correct
3 Correct 24 ms 49720 KB Output is correct
4 Correct 27 ms 49876 KB Output is correct
5 Correct 23 ms 49748 KB Output is correct
6 Correct 25 ms 49864 KB Output is correct
7 Correct 24 ms 49876 KB Output is correct
8 Correct 31 ms 49768 KB Output is correct
9 Correct 31 ms 49864 KB Output is correct
10 Correct 32 ms 49816 KB Output is correct
11 Correct 29 ms 49804 KB Output is correct
12 Correct 24 ms 49800 KB Output is correct
13 Correct 22 ms 49748 KB Output is correct
14 Correct 24 ms 49940 KB Output is correct
15 Correct 24 ms 49876 KB Output is correct
16 Correct 24 ms 49876 KB Output is correct
17 Correct 24 ms 49740 KB Output is correct
18 Correct 26 ms 49876 KB Output is correct
19 Correct 25 ms 49748 KB Output is correct
20 Correct 25 ms 49876 KB Output is correct
21 Correct 27 ms 49868 KB Output is correct
22 Correct 32 ms 49956 KB Output is correct
23 Correct 27 ms 49752 KB Output is correct
24 Correct 27 ms 49820 KB Output is correct
25 Correct 25 ms 49828 KB Output is correct
26 Correct 24 ms 49824 KB Output is correct
27 Correct 25 ms 49876 KB Output is correct
28 Correct 24 ms 49768 KB Output is correct
29 Correct 27 ms 49828 KB Output is correct
30 Correct 27 ms 49788 KB Output is correct
31 Correct 28 ms 49896 KB Output is correct
32 Correct 28 ms 49836 KB Output is correct
33 Correct 26 ms 49848 KB Output is correct
34 Correct 24 ms 49876 KB Output is correct
35 Correct 25 ms 49848 KB Output is correct
36 Correct 26 ms 49800 KB Output is correct
37 Correct 28 ms 49764 KB Output is correct
38 Correct 26 ms 49876 KB Output is correct
39 Correct 140 ms 58356 KB Output is correct
40 Correct 167 ms 58040 KB Output is correct
41 Correct 147 ms 58304 KB Output is correct
42 Correct 162 ms 58268 KB Output is correct
43 Correct 144 ms 58104 KB Output is correct
44 Correct 162 ms 58080 KB Output is correct
45 Correct 61 ms 57552 KB Output is correct
46 Correct 63 ms 57800 KB Output is correct
47 Correct 151 ms 58000 KB Output is correct
48 Correct 160 ms 58020 KB Output is correct
49 Correct 129 ms 58056 KB Output is correct
50 Correct 132 ms 58060 KB Output is correct
51 Correct 137 ms 57420 KB Output is correct
52 Correct 160 ms 58392 KB Output is correct
53 Correct 151 ms 57672 KB Output is correct
54 Correct 157 ms 57660 KB Output is correct
55 Correct 525 ms 72972 KB Output is correct
56 Correct 439 ms 68080 KB Output is correct
57 Correct 553 ms 74676 KB Output is correct
58 Correct 341 ms 67236 KB Output is correct
59 Correct 411 ms 67832 KB Output is correct
60 Correct 473 ms 74424 KB Output is correct
61 Correct 149 ms 74820 KB Output is correct
62 Correct 137 ms 74908 KB Output is correct
63 Correct 395 ms 74488 KB Output is correct
64 Correct 399 ms 74348 KB Output is correct
65 Correct 544 ms 73828 KB Output is correct
66 Correct 520 ms 73864 KB Output is correct
67 Correct 471 ms 73804 KB Output is correct
68 Correct 609 ms 74500 KB Output is correct
69 Correct 679 ms 74516 KB Output is correct
70 Correct 562 ms 74352 KB Output is correct
71 Correct 615 ms 74376 KB Output is correct
72 Correct 570 ms 74468 KB Output is correct
73 Correct 559 ms 74452 KB Output is correct
74 Correct 556 ms 74472 KB Output is correct
75 Correct 627 ms 74356 KB Output is correct
76 Correct 683 ms 74344 KB Output is correct
77 Correct 592 ms 74372 KB Output is correct
78 Correct 587 ms 74472 KB Output is correct
79 Correct 399 ms 74468 KB Output is correct
80 Correct 390 ms 75096 KB Output is correct
81 Correct 437 ms 75176 KB Output is correct
82 Correct 173 ms 57400 KB Output is correct
83 Correct 154 ms 56256 KB Output is correct
84 Correct 106 ms 56492 KB Output is correct
85 Correct 108 ms 57504 KB Output is correct
86 Correct 170 ms 57852 KB Output is correct
87 Correct 184 ms 57928 KB Output is correct
88 Correct 227 ms 58192 KB Output is correct
89 Correct 202 ms 58072 KB Output is correct
90 Correct 173 ms 58044 KB Output is correct
91 Correct 199 ms 58124 KB Output is correct
92 Correct 108 ms 58296 KB Output is correct
93 Correct 156 ms 58280 KB Output is correct
94 Correct 156 ms 55444 KB Output is correct
95 Correct 187 ms 56648 KB Output is correct
96 Correct 182 ms 57932 KB Output is correct
97 Correct 212 ms 57992 KB Output is correct
98 Correct 140 ms 55968 KB Output is correct
99 Correct 204 ms 57732 KB Output is correct
100 Correct 219 ms 57560 KB Output is correct
101 Correct 236 ms 58372 KB Output is correct
102 Correct 205 ms 58440 KB Output is correct
103 Correct 154 ms 55832 KB Output is correct
104 Correct 186 ms 57296 KB Output is correct
105 Correct 194 ms 58480 KB Output is correct
106 Correct 146 ms 57476 KB Output is correct
107 Correct 128 ms 57020 KB Output is correct
108 Correct 175 ms 58608 KB Output is correct
109 Correct 134 ms 55668 KB Output is correct
110 Correct 192 ms 58436 KB Output is correct
111 Correct 226 ms 58568 KB Output is correct
112 Correct 187 ms 57592 KB Output is correct
113 Correct 223 ms 58320 KB Output is correct
114 Correct 174 ms 56892 KB Output is correct
115 Correct 184 ms 57944 KB Output is correct
116 Correct 125 ms 55240 KB Output is correct
117 Correct 210 ms 57992 KB Output is correct
118 Correct 152 ms 56776 KB Output is correct
119 Correct 141 ms 56284 KB Output is correct
120 Correct 190 ms 57996 KB Output is correct
121 Correct 187 ms 58000 KB Output is correct
122 Correct 168 ms 57880 KB Output is correct
123 Correct 187 ms 58008 KB Output is correct
124 Correct 264 ms 58028 KB Output is correct
125 Correct 170 ms 56896 KB Output is correct
126 Correct 139 ms 58328 KB Output is correct
127 Correct 158 ms 57016 KB Output is correct
128 Correct 171 ms 58400 KB Output is correct
129 Correct 182 ms 57684 KB Output is correct
130 Execution timed out 1041 ms 89436 KB Time limit exceeded
131 Halted 0 ms 0 KB -