oj.uz

Submission #1011089

# Submission time Handle Problem Language Result Execution time Memory
1011089 2024-06-29T19:21:55 Z imarn JOI tour (JOI24_joitour) C++17
100 / 100
 1974 ms 219288 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
using namespace std;
const int mxn=2e5+5;
vector<int>g[mxn],f;
int sz[mxn]{0},lv[mxn]{0},pr[mxn];
bool vis[mxn]{0};
ll ans=0;
int getsz(int u,int p){
    sz[u]=1;
    for(auto v:g[u])if(v!=p&&!vis[v])sz[u]+=getsz(v,u);
    return sz[u];
}
int getct(int u,int p,int r){
    for(auto v:g[u])if(v!=p&&!vis[v]&&sz[v]*2>r)return getct(v,u,r);
    return u;
}
vector<ll>dp[6][mxn];
ll td[6][mxn]{0};
struct few{
    int fw[mxn]{0};
    void add(int i,int amt){
        for(;i<mxn;i+=i&-i)fw[i]+=amt;
    }
    ll qr(int i,ll res=0){
        for(;i;i-=i&-i)res+=fw[i];
        return res;
    }
}fw[3][19],wf[3][19];
int tin[19][mxn],tout[19][mxn],cnt[19]{0},ID[19][mxn];
ll getP(int col,int lvl,int u){
    return fw[col][lvl].qr(tin[lvl][u]);
}
ll getC(int col,int lvl,int u){
    return wf[col][lvl].qr(tout[lvl][u])-wf[col][lvl].qr(tin[lvl][u]-1);
}
void gen1(int u,int p,int x,int id,int x0,int x1,int x2){
    dp[f[u]][x][id]++;tin[lv[x]][u]=++cnt[lv[x]];
    fw[f[u]][lv[x]].add(tin[lv[x]][u],1);
    if(f[u]==2)dp[3][x][id]+=x1;
    for(auto v:g[u])if(v!=p&&!vis[v])gen1(v,u,x,id,x0+(f[v]==0),x1+(f[v]==1),x2+(f[v]==2));
    tout[lv[x]][u]=cnt[lv[x]];ID[lv[x]][u]=id;
    fw[f[u]][lv[x]].add(tout[lv[x]][u]+1,-1);
}
void gen2(int u,int p,int x,int id){
    for(auto v:g[u])if(v!=p&&!vis[v])gen2(v,u,x,id);
    wf[f[u]][lv[x]].add(tin[lv[x]][u],1);
    if(f[u]==1)dp[4][x][id]+=getC(0,lv[x],u);
}
void play(int u,int p){int id=-1;
    u = getct(u,u,getsz(u,u));vis[u]=1;
    pr[u]=p;if(p!=-1)lv[u]=lv[p]+1;
    tin[lv[u]][u]=++cnt[lv[u]];
    for(auto v:g[u]){
        if(vis[v])continue;
        for(int i=0;i<6;i++)dp[i][u].pb(0);id++;
        gen1(v,u,u,id,(f[v]==0),(f[v]==1),(f[v]==2));gen2(v,u,u,id);
        for(int i=0;i<5;i++)td[i][u]+=dp[i][u][id];td[5][u]+=dp[0][u][id]*dp[2][u][id];
    }tout[lv[u]][u]=cnt[lv[u]];
    for(int j=0;j<=id;j++){
        ans+=dp[0][u][j]*(td[3][u]-dp[3][u][j]);
        ans+=dp[4][u][j]*(td[2][u]-dp[2][u][j]);
        if(f[u]==1)ans+=dp[0][u][j]*(td[2][u]-dp[2][u][j]);
    }if(f[u]==0)ans+=td[3][u];if(f[u]==2)ans+=td[4][u];
    for(auto v:g[u])if(!vis[v])play(v,u);
}
void init(int N, std::vector<int> F, std::vector<int> U, std::vector<int> V,int Q){
    f=F;for(int i=0;i<N-1;i++)g[U[i]].pb(V[i]),g[V[i]].pb(U[i]);
    play(0,-1);
}
void up(int col,int u,int sig){
    int x=u;
    if(col==0){
        ans+=td[3][u]*sig;x=pr[u];int j=ID[lv[x]][u];
        while(x!=-1){
            ans-=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans-=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans-=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans-=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            if(f[x]==1)ans-=td[0][x]*td[2][x]-td[5][x];
            if(f[x]==2)ans-=td[4][x];
            td[5][x]-=dp[0][x][j]*dp[2][x][j];
            td[4][x]-=dp[4][x][j];
            td[0][x]+=sig;dp[0][x][j]+=sig;
            dp[4][x][j]+=sig*getP(1,lv[x],u);
            td[4][x]+=dp[4][x][j];
            td[5][x]+=dp[0][x][j]*dp[2][x][j];
            if(f[x]==1)ans+=td[0][x]*td[2][x]-td[5][x];
            if(f[x]==2)ans+=td[4][x];
            ans+=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans+=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans+=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans+=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            fw[0][lv[x]].add(tin[lv[x]][u],sig);
            fw[0][lv[x]].add(tout[lv[x]][u]+1,-sig);
            wf[0][lv[x]].add(tin[lv[x]][u],sig);
            if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
        }
    }
    else if(col==1){
        ans+=(td[0][u]*td[2][u]-td[5][u])*sig;x=pr[u];int j=ID[lv[x]][u];
        while(x!=-1){
            ans-=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans-=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans-=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans-=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            if(f[x]==0)ans-=td[3][x];
            if(f[x]==2)ans-=td[4][x];
            td[4][x]-=dp[4][x][j];
            td[3][x]-=dp[3][x][j];
            td[1][x]+=sig;dp[1][x][j]+=sig;
            dp[4][x][j]+=sig*getC(0,lv[x],u);
            dp[3][x][j]+=sig*getC(2,lv[x],u);
            td[4][x]+=dp[4][x][j];
            td[3][x]+=dp[3][x][j];
            if(f[x]==0)ans+=td[3][x];
            if(f[x]==2)ans+=td[4][x];
            ans+=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans+=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans+=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans+=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            fw[1][lv[x]].add(tin[lv[x]][u],sig);
            fw[1][lv[x]].add(tout[lv[x]][u]+1,-sig);
            wf[1][lv[x]].add(tin[lv[x]][u],sig);
            if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
        }
    }
    else {
        ans+=td[4][u]*sig;x=pr[u];int j=ID[lv[x]][u];
        while(x!=-1){
            ans-=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans-=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans-=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans-=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            if(f[x]==1)ans-=td[0][x]*td[2][x]-td[5][x];
            if(f[x]==0)ans-=td[3][x];
            td[5][x]-=dp[0][x][j]*dp[2][x][j];
            td[3][x]-=dp[3][x][j];
            td[2][x]+=sig;dp[2][x][j]+=sig;
            dp[3][x][j]+=sig*getP(1,lv[x],u);
            td[3][x]+=dp[3][x][j];
            td[5][x]+=dp[0][x][j]*dp[2][x][j];
            if(f[x]==1)ans+=td[0][x]*td[2][x]-td[5][x];
            if(f[x]==0)ans+=td[3][x];
            ans+=dp[0][x][j]*(td[3][x]-dp[3][x][j]);
            ans+=dp[4][x][j]*(td[2][x]-dp[2][x][j]);
            ans+=dp[3][x][j]*(td[0][x]-dp[0][x][j]);
            ans+=dp[2][x][j]*(td[4][x]-dp[4][x][j]);
            fw[2][lv[x]].add(tin[lv[x]][u],sig);
            fw[2][lv[x]].add(tout[lv[x]][u]+1,-sig);
            wf[2][lv[x]].add(tin[lv[x]][u],sig);
            if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
        }
    }
}
void change(int X, int Y){
    up(f[X],X,-1);up(Y,X,1);
    f[X]=Y;
}
 
long long num_tours() {
  return ans;
}
/*int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    vector<int>ff(n+1),u,v;
    for(int i=1;i<=n;i++)ff[i]=i%3;
    for(int i=1;i<=n-1;i++){
        if(2*i<=n)g[i].pb(2*i),g[2*i].pb(i);
        if(2*i+1<=n)g[i].pb(2*i+1),g[2*i+1].pb(i);
    }init(n,ff,u,v,0);cout<<num_tours()<<'\n';
    int q;cin>>q;
    change(2,0);
    cout<<num_tours()<<'\n';
    /*while(q--){
        int x,y;cin>>x>>y;change(x,y);
        cout<<num_tours()<<'\n';
    }
}*/

Compilation message

joitour.cpp:188:5: warning: "/*" within comment [-Wcomment]
  188 |     /*while(q--){
      |      
joitour.cpp: In function 'void play(int, int)':
joitour.cpp:68:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   68 |         for(int i=0;i<6;i++)dp[i][u].pb(0);id++;
      |         ^~~
joitour.cpp:68:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   68 |         for(int i=0;i<6;i++)dp[i][u].pb(0);id++;
      |                                            ^~
joitour.cpp:70:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   70 |         for(int i=0;i<5;i++)td[i][u]+=dp[i][u][id];td[5][u]+=dp[0][u][id]*dp[2][u][id];
      |         ^~~
joitour.cpp:70:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   70 |         for(int i=0;i<5;i++)td[i][u]+=dp[i][u][id];td[5][u]+=dp[0][u][id]*dp[2][u][id];
      |                                                    ^~
joitour.cpp: In function 'void up(int, int, int)':
joitour.cpp:109:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  109 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |             ^~
joitour.cpp:109:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  109 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |                                ^
joitour.cpp:137:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  137 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |             ^~
joitour.cpp:137:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  137 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |                                ^
joitour.cpp:164:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  164 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |             ^~
joitour.cpp:164:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  164 |             if(pr[x]==-1)break;x=pr[x];j=ID[lv[x]][u];
      |                                ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 62144 KB Output is correct
4 Correct 10 ms 63576 KB Output is correct
5 Correct 8 ms 61896 KB Output is correct
6 Correct 8 ms 62040 KB Output is correct
7 Correct 10 ms 61888 KB Output is correct
8 Correct 8 ms 62040 KB Output is correct
9 Correct 10 ms 61272 KB Output is correct
10 Correct 9 ms 62040 KB Output is correct
11 Correct 6 ms 51544 KB Output is correct
12 Correct 7 ms 57688 KB Output is correct
13 Correct 8 ms 59992 KB Output is correct
14 Correct 8 ms 59992 KB Output is correct
15 Correct 8 ms 59992 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 9 ms 59992 KB Output is correct
18 Correct 9 ms 61952 KB Output is correct
19 Correct 10 ms 61528 KB Output is correct
20 Correct 8 ms 61784 KB Output is correct
21 Correct 8 ms 59992 KB Output is correct
22 Correct 8 ms 62040 KB Output is correct
23 Correct 12 ms 62040 KB Output is correct
24 Correct 10 ms 61204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 62144 KB Output is correct
4 Correct 10 ms 63576 KB Output is correct
5 Correct 8 ms 61896 KB Output is correct
6 Correct 8 ms 62040 KB Output is correct
7 Correct 10 ms 61888 KB Output is correct
8 Correct 8 ms 62040 KB Output is correct
9 Correct 10 ms 61272 KB Output is correct
10 Correct 9 ms 62040 KB Output is correct
11 Correct 6 ms 51544 KB Output is correct
12 Correct 7 ms 57688 KB Output is correct
13 Correct 8 ms 59992 KB Output is correct
14 Correct 8 ms 59992 KB Output is correct
15 Correct 8 ms 59992 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 9 ms 59992 KB Output is correct
18 Correct 9 ms 61952 KB Output is correct
19 Correct 10 ms 61528 KB Output is correct
20 Correct 8 ms 61784 KB Output is correct
21 Correct 8 ms 59992 KB Output is correct
22 Correct 8 ms 62040 KB Output is correct
23 Correct 12 ms 62040 KB Output is correct
24 Correct 10 ms 61204 KB Output is correct
25 Correct 26 ms 65624 KB Output is correct
26 Correct 22 ms 65368 KB Output is correct
27 Correct 13 ms 62548 KB Output is correct
28 Correct 22 ms 65624 KB Output is correct
29 Correct 21 ms 63056 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 57688 KB Output is correct
2 Correct 947 ms 208668 KB Output is correct
3 Correct 895 ms 207884 KB Output is correct
4 Correct 853 ms 208464 KB Output is correct
5 Correct 958 ms 207652 KB Output is correct
6 Correct 369 ms 199444 KB Output is correct
7 Correct 403 ms 199440 KB Output is correct
8 Correct 737 ms 197624 KB Output is correct
9 Correct 833 ms 199492 KB Output is correct
10 Correct 784 ms 194588 KB Output is correct
11 Correct 740 ms 188756 KB Output is correct
12 Correct 815 ms 205424 KB Output is correct
13 Correct 793 ms 203032 KB Output is correct
14 Correct 781 ms 205532 KB Output is correct
15 Correct 865 ms 204844 KB Output is correct
16 Correct 998 ms 219112 KB Output is correct
17 Correct 7 ms 51544 KB Output is correct
18 Correct 8 ms 57688 KB Output is correct
19 Correct 7 ms 57820 KB Output is correct
20 Correct 8 ms 55896 KB Output is correct
21 Correct 678 ms 183312 KB Output is correct
22 Correct 707 ms 182284 KB Output is correct
23 Correct 673 ms 184600 KB Output is correct
24 Correct 720 ms 185612 KB Output is correct
25 Correct 105 ms 86400 KB Output is correct
26 Correct 144 ms 86404 KB Output is correct
27 Correct 101 ms 87108 KB Output is correct
28 Correct 117 ms 87680 KB Output is correct
29 Correct 419 ms 218652 KB Output is correct
30 Correct 434 ms 218396 KB Output is correct
31 Correct 406 ms 219220 KB Output is correct
32 Correct 478 ms 219168 KB Output is correct
33 Correct 368 ms 190032 KB Output is correct
34 Correct 402 ms 189392 KB Output is correct
35 Correct 349 ms 190804 KB Output is correct
36 Correct 388 ms 190032 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 59992 KB Output is correct
4 Correct 8 ms 62040 KB Output is correct
5 Correct 10 ms 62152 KB Output is correct
6 Correct 9 ms 66136 KB Output is correct
7 Correct 11 ms 67544 KB Output is correct
8 Correct 22 ms 67672 KB Output is correct
9 Correct 407 ms 218448 KB Output is correct
10 Correct 414 ms 218380 KB Output is correct
11 Correct 371 ms 219136 KB Output is correct
12 Correct 403 ms 219220 KB Output is correct
13 Correct 407 ms 139284 KB Output is correct
14 Correct 429 ms 140116 KB Output is correct
15 Correct 561 ms 139060 KB Output is correct
16 Correct 585 ms 138952 KB Output is correct
17 Correct 499 ms 139284 KB Output is correct
18 Correct 552 ms 139344 KB Output is correct
19 Correct 864 ms 218448 KB Output is correct
20 Correct 810 ms 219148 KB Output is correct
21 Correct 1232 ms 219152 KB Output is correct
22 Correct 1284 ms 219288 KB Output is correct
23 Correct 1128 ms 219216 KB Output is correct
24 Correct 1317 ms 218384 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 64088 KB Output is correct
2 Correct 12 ms 61784 KB Output is correct
3 Correct 8 ms 66136 KB Output is correct
4 Correct 8 ms 64088 KB Output is correct
5 Correct 9 ms 65952 KB Output is correct
6 Correct 10 ms 67160 KB Output is correct
7 Correct 21 ms 67100 KB Output is correct
8 Correct 386 ms 191824 KB Output is correct
9 Correct 397 ms 191704 KB Output is correct
10 Correct 343 ms 193032 KB Output is correct
11 Correct 367 ms 193116 KB Output is correct
12 Correct 377 ms 128992 KB Output is correct
13 Correct 519 ms 127828 KB Output is correct
14 Correct 499 ms 127316 KB Output is correct
15 Correct 567 ms 127916 KB Output is correct
16 Correct 489 ms 128896 KB Output is correct
17 Correct 563 ms 128148 KB Output is correct
18 Correct 832 ms 191824 KB Output is correct
19 Correct 1158 ms 191892 KB Output is correct
20 Correct 1218 ms 191688 KB Output is correct
21 Correct 1265 ms 191772 KB Output is correct
22 Correct 1125 ms 193252 KB Output is correct
23 Correct 1252 ms 191756 KB Output is correct

Subtask #6
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 62144 KB Output is correct
4 Correct 10 ms 63576 KB Output is correct
5 Correct 8 ms 61896 KB Output is correct
6 Correct 8 ms 62040 KB Output is correct
7 Correct 10 ms 61888 KB Output is correct
8 Correct 8 ms 62040 KB Output is correct
9 Correct 10 ms 61272 KB Output is correct
10 Correct 9 ms 62040 KB Output is correct
11 Correct 6 ms 51544 KB Output is correct
12 Correct 7 ms 57688 KB Output is correct
13 Correct 8 ms 59992 KB Output is correct
14 Correct 8 ms 59992 KB Output is correct
15 Correct 8 ms 59992 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 9 ms 59992 KB Output is correct
18 Correct 9 ms 61952 KB Output is correct
19 Correct 10 ms 61528 KB Output is correct
20 Correct 8 ms 61784 KB Output is correct
21 Correct 8 ms 59992 KB Output is correct
22 Correct 8 ms 62040 KB Output is correct
23 Correct 12 ms 62040 KB Output is correct
24 Correct 10 ms 61204 KB Output is correct
25 Correct 26 ms 65624 KB Output is correct
26 Correct 22 ms 65368 KB Output is correct
27 Correct 13 ms 62548 KB Output is correct
28 Correct 22 ms 65624 KB Output is correct
29 Correct 21 ms 63056 KB Output is correct
30 Correct 622 ms 136048 KB Output is correct
31 Correct 611 ms 135612 KB Output is correct
32 Correct 768 ms 136428 KB Output is correct
33 Correct 774 ms 135504 KB Output is correct
34 Correct 721 ms 136372 KB Output is correct
35 Correct 746 ms 136060 KB Output is correct
36 Correct 533 ms 131152 KB Output is correct
37 Correct 514 ms 130384 KB Output is correct
38 Correct 724 ms 129360 KB Output is correct
39 Correct 712 ms 131016 KB Output is correct
40 Correct 653 ms 128128 KB Output is correct
41 Correct 660 ms 127172 KB Output is correct
42 Correct 618 ms 133852 KB Output is correct
43 Correct 713 ms 134736 KB Output is correct
44 Correct 751 ms 133884 KB Output is correct
45 Correct 729 ms 133968 KB Output is correct
46 Correct 688 ms 134736 KB Output is correct
47 Correct 733 ms 134604 KB Output is correct
48 Correct 729 ms 141392 KB Output is correct
49 Correct 709 ms 141552 KB Output is correct
50 Correct 845 ms 140916 KB Output is correct
51 Correct 451 ms 124800 KB Output is correct
52 Correct 648 ms 124236 KB Output is correct
53 Correct 669 ms 123864 KB Output is correct
54 Correct 576 ms 124752 KB Output is correct
55 Correct 646 ms 125008 KB Output is correct
56 Correct 637 ms 124496 KB Output is correct
57 Correct 209 ms 78208 KB Output is correct
58 Correct 193 ms 76724 KB Output is correct
59 Correct 227 ms 76672 KB Output is correct
60 Correct 187 ms 78208 KB Output is correct
61 Correct 216 ms 76672 KB Output is correct
62 Correct 426 ms 139344 KB Output is correct
63 Correct 460 ms 140112 KB Output is correct
64 Correct 634 ms 138880 KB Output is correct
65 Correct 615 ms 138832 KB Output is correct
66 Correct 498 ms 139400 KB Output is correct
67 Correct 564 ms 139344 KB Output is correct
68 Correct 369 ms 125516 KB Output is correct
69 Correct 540 ms 125520 KB Output is correct
70 Correct 553 ms 125264 KB Output is correct
71 Correct 547 ms 125384 KB Output is correct
72 Correct 507 ms 123784 KB Output is correct
73 Correct 532 ms 122448 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 62144 KB Output is correct
4 Correct 10 ms 63576 KB Output is correct
5 Correct 8 ms 61896 KB Output is correct
6 Correct 8 ms 62040 KB Output is correct
7 Correct 10 ms 61888 KB Output is correct
8 Correct 8 ms 62040 KB Output is correct
9 Correct 10 ms 61272 KB Output is correct
10 Correct 9 ms 62040 KB Output is correct
11 Correct 6 ms 51544 KB Output is correct
12 Correct 7 ms 57688 KB Output is correct
13 Correct 8 ms 59992 KB Output is correct
14 Correct 8 ms 59992 KB Output is correct
15 Correct 8 ms 59992 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 9 ms 59992 KB Output is correct
18 Correct 9 ms 61952 KB Output is correct
19 Correct 10 ms 61528 KB Output is correct
20 Correct 8 ms 61784 KB Output is correct
21 Correct 8 ms 59992 KB Output is correct
22 Correct 8 ms 62040 KB Output is correct
23 Correct 12 ms 62040 KB Output is correct
24 Correct 10 ms 61204 KB Output is correct
25 Correct 26 ms 65624 KB Output is correct
26 Correct 22 ms 65368 KB Output is correct
27 Correct 13 ms 62548 KB Output is correct
28 Correct 22 ms 65624 KB Output is correct
29 Correct 21 ms 63056 KB Output is correct
30 Correct 7 ms 57688 KB Output is correct
31 Correct 947 ms 208668 KB Output is correct
32 Correct 895 ms 207884 KB Output is correct
33 Correct 853 ms 208464 KB Output is correct
34 Correct 958 ms 207652 KB Output is correct
35 Correct 369 ms 199444 KB Output is correct
36 Correct 403 ms 199440 KB Output is correct
37 Correct 737 ms 197624 KB Output is correct
38 Correct 833 ms 199492 KB Output is correct
39 Correct 784 ms 194588 KB Output is correct
40 Correct 740 ms 188756 KB Output is correct
41 Correct 815 ms 205424 KB Output is correct
42 Correct 793 ms 203032 KB Output is correct
43 Correct 781 ms 205532 KB Output is correct
44 Correct 865 ms 204844 KB Output is correct
45 Correct 998 ms 219112 KB Output is correct
46 Correct 7 ms 51544 KB Output is correct
47 Correct 8 ms 57688 KB Output is correct
48 Correct 7 ms 57820 KB Output is correct
49 Correct 8 ms 55896 KB Output is correct
50 Correct 678 ms 183312 KB Output is correct
51 Correct 707 ms 182284 KB Output is correct
52 Correct 673 ms 184600 KB Output is correct
53 Correct 720 ms 185612 KB Output is correct
54 Correct 105 ms 86400 KB Output is correct
55 Correct 144 ms 86404 KB Output is correct
56 Correct 101 ms 87108 KB Output is correct
57 Correct 117 ms 87680 KB Output is correct
58 Correct 419 ms 218652 KB Output is correct
59 Correct 434 ms 218396 KB Output is correct
60 Correct 406 ms 219220 KB Output is correct
61 Correct 478 ms 219168 KB Output is correct
62 Correct 368 ms 190032 KB Output is correct
63 Correct 402 ms 189392 KB Output is correct
64 Correct 349 ms 190804 KB Output is correct
65 Correct 388 ms 190032 KB Output is correct
66 Correct 8 ms 57688 KB Output is correct
67 Correct 8 ms 57688 KB Output is correct
68 Correct 8 ms 59992 KB Output is correct
69 Correct 8 ms 62040 KB Output is correct
70 Correct 10 ms 62152 KB Output is correct
71 Correct 9 ms 66136 KB Output is correct
72 Correct 11 ms 67544 KB Output is correct
73 Correct 22 ms 67672 KB Output is correct
74 Correct 407 ms 218448 KB Output is correct
75 Correct 414 ms 218380 KB Output is correct
76 Correct 371 ms 219136 KB Output is correct
77 Correct 403 ms 219220 KB Output is correct
78 Correct 407 ms 139284 KB Output is correct
79 Correct 429 ms 140116 KB Output is correct
80 Correct 561 ms 139060 KB Output is correct
81 Correct 585 ms 138952 KB Output is correct
82 Correct 499 ms 139284 KB Output is correct
83 Correct 552 ms 139344 KB Output is correct
84 Correct 864 ms 218448 KB Output is correct
85 Correct 810 ms 219148 KB Output is correct
86 Correct 1232 ms 219152 KB Output is correct
87 Correct 1284 ms 219288 KB Output is correct
88 Correct 1128 ms 219216 KB Output is correct
89 Correct 1317 ms 218384 KB Output is correct
90 Correct 8 ms 64088 KB Output is correct
91 Correct 12 ms 61784 KB Output is correct
92 Correct 8 ms 66136 KB Output is correct
93 Correct 8 ms 64088 KB Output is correct
94 Correct 9 ms 65952 KB Output is correct
95 Correct 10 ms 67160 KB Output is correct
96 Correct 21 ms 67100 KB Output is correct
97 Correct 386 ms 191824 KB Output is correct
98 Correct 397 ms 191704 KB Output is correct
99 Correct 343 ms 193032 KB Output is correct
100 Correct 367 ms 193116 KB Output is correct
101 Correct 377 ms 128992 KB Output is correct
102 Correct 519 ms 127828 KB Output is correct
103 Correct 499 ms 127316 KB Output is correct
104 Correct 567 ms 127916 KB Output is correct
105 Correct 489 ms 128896 KB Output is correct
106 Correct 563 ms 128148 KB Output is correct
107 Correct 832 ms 191824 KB Output is correct
108 Correct 1158 ms 191892 KB Output is correct
109 Correct 1218 ms 191688 KB Output is correct
110 Correct 1265 ms 191772 KB Output is correct
111 Correct 1125 ms 193252 KB Output is correct
112 Correct 1252 ms 191756 KB Output is correct
113 Correct 622 ms 136048 KB Output is correct
114 Correct 611 ms 135612 KB Output is correct
115 Correct 768 ms 136428 KB Output is correct
116 Correct 774 ms 135504 KB Output is correct
117 Correct 721 ms 136372 KB Output is correct
118 Correct 746 ms 136060 KB Output is correct
119 Correct 533 ms 131152 KB Output is correct
120 Correct 514 ms 130384 KB Output is correct
121 Correct 724 ms 129360 KB Output is correct
122 Correct 712 ms 131016 KB Output is correct
123 Correct 653 ms 128128 KB Output is correct
124 Correct 660 ms 127172 KB Output is correct
125 Correct 618 ms 133852 KB Output is correct
126 Correct 713 ms 134736 KB Output is correct
127 Correct 751 ms 133884 KB Output is correct
128 Correct 729 ms 133968 KB Output is correct
129 Correct 688 ms 134736 KB Output is correct
130 Correct 733 ms 134604 KB Output is correct
131 Correct 729 ms 141392 KB Output is correct
132 Correct 709 ms 141552 KB Output is correct
133 Correct 845 ms 140916 KB Output is correct
134 Correct 451 ms 124800 KB Output is correct
135 Correct 648 ms 124236 KB Output is correct
136 Correct 669 ms 123864 KB Output is correct
137 Correct 576 ms 124752 KB Output is correct
138 Correct 646 ms 125008 KB Output is correct
139 Correct 637 ms 124496 KB Output is correct
140 Correct 209 ms 78208 KB Output is correct
141 Correct 193 ms 76724 KB Output is correct
142 Correct 227 ms 76672 KB Output is correct
143 Correct 187 ms 78208 KB Output is correct
144 Correct 216 ms 76672 KB Output is correct
145 Correct 426 ms 139344 KB Output is correct
146 Correct 460 ms 140112 KB Output is correct
147 Correct 634 ms 138880 KB Output is correct
148 Correct 615 ms 138832 KB Output is correct
149 Correct 498 ms 139400 KB Output is correct
150 Correct 564 ms 139344 KB Output is correct
151 Correct 369 ms 125516 KB Output is correct
152 Correct 540 ms 125520 KB Output is correct
153 Correct 553 ms 125264 KB Output is correct
154 Correct 547 ms 125384 KB Output is correct
155 Correct 507 ms 123784 KB Output is correct
156 Correct 532 ms 122448 KB Output is correct
157 Correct 1366 ms 208576 KB Output is correct
158 Correct 1303 ms 207952 KB Output is correct
159 Correct 1773 ms 208560 KB Output is correct
160 Correct 1774 ms 207696 KB Output is correct
161 Correct 1679 ms 206360 KB Output is correct
162 Correct 1659 ms 208136 KB Output is correct
163 Correct 1099 ms 198172 KB Output is correct
164 Correct 1090 ms 199200 KB Output is correct
165 Correct 1484 ms 195600 KB Output is correct
166 Correct 1498 ms 198940 KB Output is correct
167 Correct 1458 ms 194332 KB Output is correct
168 Correct 1356 ms 189012 KB Output is correct
169 Correct 1156 ms 204372 KB Output is correct
170 Correct 1649 ms 203520 KB Output is correct
171 Correct 1624 ms 204624 KB Output is correct
172 Correct 1639 ms 200736 KB Output is correct
173 Correct 1503 ms 205064 KB Output is correct
174 Correct 1663 ms 204808 KB Output is correct
175 Correct 1350 ms 218840 KB Output is correct
176 Correct 1400 ms 218124 KB Output is correct
177 Correct 1974 ms 218216 KB Output is correct
178 Correct 1090 ms 183760 KB Output is correct
179 Correct 1411 ms 184404 KB Output is correct
180 Correct 1392 ms 187472 KB Output is correct
181 Correct 1290 ms 182448 KB Output is correct
182 Correct 1325 ms 183888 KB Output is correct
183 Correct 1354 ms 180836 KB Output is correct
184 Correct 381 ms 83064 KB Output is correct
185 Correct 430 ms 84352 KB Output is correct
186 Correct 383 ms 83072 KB Output is correct
187 Correct 412 ms 83072 KB Output is correct
188 Correct 414 ms 84284 KB Output is correct