oj.uz

답안 #1077693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077693 2024-08-27T08:36:59 Z modwwe Jail (JOI22_jail) C++17
100 / 100
 563 ms 103312 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e9;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid;
int  i,s10,s12;
int kk;
int el=29;
#define getchar_unlocked getchar

inline int scan(){
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9'){
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}
main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
   int xx=scan();
  //  modwwe
  while(xx--)
    phongbeo(),down
//checktime
}
const int N=1e5+2e4+1;
int depth[N];
int head[N];
int pos[N];
int tout[N];
vector<int> v2[N];
vector<ib> v[N*4][2];
int heavy[N];
ib a[N];
int f[N];
int sz[N];
int mxz[N];
int c[N*4][2];
int par[N];
void dfs(int x,int y)
{
    sz[x]=1;
    mxz[x]=0;
    par[x]=y;
    depth[x]=depth[y]+1;
    for(auto f:v2[x])
    {
        if(f!=y)
        {
            dfs(f,x);
            sz[x]+=sz[f];
            if(sz[f]>mxz[x])
                heavy[x]=f,mxz[x]=sz[f];
        }
    }
}

void des(int x,int y)
{
    head[x]=y;
    pos[x]=++dem;
    if(heavy[x]!=0)
        des(heavy[x],y);
    for(auto f:v2[x])
        if(pos[f]==0)
            des(f,f);
            tout[x]=dem;
}
struct IT
{
    void setup(int node,int l,int r)
    {
  //  cout<<node<<" "<<l<<" "<<r,debug
            if(node!=1)v[node>>1][0].pb({node,0});
        if(node!=1) v[node][1].pb({node>>1,1});
        if(l==r)
        {
            f[l]=node;
            return;
        }
        int mid=l+r>>1;
        setup(node<<1,l,mid);
        setup(node<<1|1,mid+1,r);
    }
      void upd(int node,int l,int r,int l1,int r1,int x)
    {
        if(l>=l1&&r<=r1)
        {
            v[x][0].pb({node,0});
          //  cout<<x<<" "<<node<<" "<<0,down
         //   if(x==5) cout<<node,debug
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid)upd(node<<1,l,mid,l1,r1,x);
        if(r1>=mid+1) upd(node<<1|1,mid+1,r,l1,r1,x);

    }
    void upd2(int node,int l,int r,int l1,int r1,int x)
 {
        if(l>=l1&&r<=r1)
        {
            v[node][1].pb({x,0});
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid)upd2(node<<1,l,mid,l1,r1,x);
        if(r1>=mid+1)upd2(node<<1|1,mid+1,r,l1,r1,x);
 }
    void upd_hld(int u, int v, int i,int dd){
   while (head[u]!=head[v]){
      if (depth[head[u]]<depth[head[v]]) swap(u, v);
      upd(1, 1, n, pos[head[u]], pos[u], i);
      u=par[head[u]];
   }
   if (depth[u]>depth[v]) swap(u, v);
   upd(1, 1, n, pos[u]+dd, pos[v], i);
}
void upd_hld2(int u, int v, int i,int dd){
   while (head[u]!=head[v]){
      if (depth[head[u]]<depth[head[v]]) swap(u, v);
      upd2(1, 1, n, pos[head[u]], pos[u], i);
      u=par[head[u]];
   }
   if (depth[u]>depth[v]) swap(u, v);
   if(pos[u]+dd<=pos[v])
   upd2(1, 1, n, pos[u]+dd, pos[v], i);
}
} stt;
bool de;
bool check(int x,int y)
{
     if(pos[x]<=pos[y]&&tout[x]>=pos[y]) return 1;
      return 0;
}
void dfs2(int x,int y)
{
     c[x][y]=1;
     for(auto f:v[x][y]){
     if(c[f.a][f.b ]==1){de=1; return;}
      if(c[f.a][f.b]) continue;
      dfs2(f.a,f.b);
      if(de)return;
     }
     c[x][y]=2;
}

void phongbeo()
{
n=scan();
    /// cach 1
    de=0;
    dem=0;
    for(int i=1; i<=n; i++)
        v2[i].clear(),f[i]=0,heavy[i]=0,pos[i]=0,head[i]=0,depth[i]=0;
    for(int i=1; i<=n*4; i++)
        v[i][0].clear(),v[i][1].clear(),c[i][0]=c[i][1]=0;
    for(int i=1; i<n; i++)
       l=scan(),r=scan(),v2[l].pb(r),v2[r].pb(l);
    dfs(1,0);
    des(1,0);
    stt.setup(1,1,n);
m=scan();
    for(int i=1; i<=m; i++){
       a[i].a=scan(),a[i].b=scan();
       v[f[pos[a[i].a]]][0].pb({f[pos[a[i].b]],1});
       if(check(a[i].a,a[i].b)){
   stt.upd_hld(a[i].a,par[a[i].b],f[pos[a[i].a]],1);}
   else if(check(a[i].b,a[i].a)){
        stt.upd_hld(par[a[i].a],a[i].b,f[pos[a[i].a]],1);}
   else {
        stt.upd_hld(par[a[i].a],par[a[i].b],f[pos[a[i].a]],0);}
    if(check(a[i].b,a[i].a))
        stt.upd_hld2(a[i].a,a[i].b,f[pos[a[i].a]],1);
    else stt.upd_hld2(a[i].a,par[a[i].b],f[pos[a[i].a]],0);
       }
    for(int i=1; i<=m; i++)
    {

        if(!c[f[pos[a[i].a]]][0]) dfs2(f[pos[a[i].a]],0);
        if(de)break;
    }


    if(de) cout<<"No";
    else cout<<"Yes";
}

Compilation message

jail.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main()
      | ^~~~
jail.cpp: In function 'void des(int, int)':
jail.cpp:115:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  115 |         if(pos[f]==0)
      |         ^~
jail.cpp:117:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  117 |             tout[x]=dem;
      |             ^~~~
jail.cpp: In member function 'void IT::setup(int, int, int)':
jail.cpp:131:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  131 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd(int, int, int, int, int, int)':
jail.cpp:144:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  144 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd2(int, int, int, int, int, int)':
jail.cpp:156:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  156 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 14 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 7 ms 27228 KB Output is correct
9 Correct 22 ms 29276 KB Output is correct
10 Correct 61 ms 58672 KB Output is correct
11 Correct 8 ms 26968 KB Output is correct
12 Correct 24 ms 27208 KB Output is correct
13 Correct 95 ms 66808 KB Output is correct
14 Correct 85 ms 67156 KB Output is correct
15 Correct 132 ms 76624 KB Output is correct
16 Correct 252 ms 101416 KB Output is correct
17 Correct 134 ms 83596 KB Output is correct
18 Correct 76 ms 64596 KB Output is correct
19 Correct 140 ms 78320 KB Output is correct
20 Correct 115 ms 78364 KB Output is correct
21 Correct 116 ms 81224 KB Output is correct
22 Correct 62 ms 60748 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 7 ms 27116 KB Output is correct
4 Correct 6 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 6 ms 27048 KB Output is correct
7 Correct 6 ms 27096 KB Output is correct
8 Correct 6 ms 27228 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 7 ms 27072 KB Output is correct
11 Correct 6 ms 27224 KB Output is correct
12 Correct 6 ms 27224 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 7 ms 27116 KB Output is correct
4 Correct 6 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 6 ms 27048 KB Output is correct
7 Correct 6 ms 27096 KB Output is correct
8 Correct 6 ms 27228 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 7 ms 27072 KB Output is correct
11 Correct 6 ms 27224 KB Output is correct
12 Correct 6 ms 27224 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct
14 Correct 5 ms 26968 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 6 ms 27224 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 6 ms 27076 KB Output is correct
19 Correct 7 ms 26972 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27188 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 5 ms 26972 KB Output is correct
25 Correct 6 ms 27224 KB Output is correct
26 Correct 5 ms 27232 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 6 ms 27064 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 7 ms 27116 KB Output is correct
4 Correct 6 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 6 ms 27048 KB Output is correct
7 Correct 6 ms 27096 KB Output is correct
8 Correct 6 ms 27228 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 7 ms 27072 KB Output is correct
11 Correct 6 ms 27224 KB Output is correct
12 Correct 6 ms 27224 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct
14 Correct 5 ms 26968 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 6 ms 27224 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 6 ms 27076 KB Output is correct
19 Correct 7 ms 26972 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27188 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 5 ms 26972 KB Output is correct
25 Correct 6 ms 27224 KB Output is correct
26 Correct 5 ms 27232 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 6 ms 27064 KB Output is correct
29 Correct 7 ms 27228 KB Output is correct
30 Correct 8 ms 27224 KB Output is correct
31 Correct 7 ms 27228 KB Output is correct
32 Correct 7 ms 27228 KB Output is correct
33 Correct 6 ms 27480 KB Output is correct
34 Correct 6 ms 27228 KB Output is correct
35 Correct 6 ms 27196 KB Output is correct
36 Correct 6 ms 27248 KB Output is correct
37 Correct 6 ms 27140 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 7 ms 27116 KB Output is correct
4 Correct 6 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 6 ms 27048 KB Output is correct
7 Correct 6 ms 27096 KB Output is correct
8 Correct 6 ms 27228 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 7 ms 27072 KB Output is correct
11 Correct 6 ms 27224 KB Output is correct
12 Correct 6 ms 27224 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct
14 Correct 5 ms 26968 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 6 ms 27224 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 6 ms 27076 KB Output is correct
19 Correct 7 ms 26972 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27188 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 5 ms 26972 KB Output is correct
25 Correct 6 ms 27224 KB Output is correct
26 Correct 5 ms 27232 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 6 ms 27064 KB Output is correct
29 Correct 7 ms 27228 KB Output is correct
30 Correct 8 ms 27224 KB Output is correct
31 Correct 7 ms 27228 KB Output is correct
32 Correct 7 ms 27228 KB Output is correct
33 Correct 6 ms 27480 KB Output is correct
34 Correct 6 ms 27228 KB Output is correct
35 Correct 6 ms 27196 KB Output is correct
36 Correct 6 ms 27248 KB Output is correct
37 Correct 6 ms 27140 KB Output is correct
38 Correct 25 ms 29276 KB Output is correct
39 Correct 55 ms 58704 KB Output is correct
40 Correct 34 ms 29532 KB Output is correct
41 Correct 42 ms 29516 KB Output is correct
42 Correct 24 ms 29272 KB Output is correct
43 Correct 18 ms 28248 KB Output is correct
44 Correct 15 ms 27740 KB Output is correct
45 Correct 58 ms 49232 KB Output is correct
46 Correct 56 ms 49376 KB Output is correct
47 Correct 65 ms 53780 KB Output is correct
48 Correct 51 ms 53820 KB Output is correct
49 Correct 59 ms 49500 KB Output is correct
50 Correct 50 ms 49488 KB Output is correct
51 Correct 48 ms 50520 KB Output is correct
52 Correct 51 ms 50520 KB Output is correct
53 Correct 13 ms 28760 KB Output is correct
54 Correct 65 ms 49248 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 6 ms 26968 KB Output is correct
3 Correct 7 ms 26968 KB Output is correct
4 Correct 6 ms 27076 KB Output is correct
5 Correct 8 ms 27192 KB Output is correct
6 Correct 6 ms 26972 KB Output is correct
7 Correct 6 ms 26972 KB Output is correct
8 Correct 5 ms 26972 KB Output is correct
9 Correct 6 ms 26968 KB Output is correct
10 Correct 6 ms 26968 KB Output is correct
11 Correct 6 ms 27088 KB Output is correct
12 Correct 6 ms 27228 KB Output is correct
13 Correct 18 ms 27228 KB Output is correct
14 Correct 29 ms 27256 KB Output is correct
15 Correct 22 ms 27228 KB Output is correct
16 Correct 86 ms 51904 KB Output is correct
17 Correct 216 ms 65476 KB Output is correct
18 Correct 384 ms 81596 KB Output is correct
19 Correct 122 ms 54864 KB Output is correct
20 Correct 121 ms 54872 KB Output is correct
21 Correct 130 ms 54864 KB Output is correct
22 Correct 222 ms 65484 KB Output is correct
23 Correct 155 ms 65212 KB Output is correct
24 Correct 172 ms 65736 KB Output is correct
25 Correct 149 ms 65600 KB Output is correct
26 Correct 162 ms 65728 KB Output is correct
27 Correct 149 ms 63176 KB Output is correct
28 Correct 164 ms 65992 KB Output is correct
29 Correct 169 ms 60040 KB Output is correct
30 Correct 134 ms 58756 KB Output is correct
31 Correct 168 ms 59852 KB Output is correct
32 Correct 151 ms 57992 KB Output is correct
33 Correct 136 ms 58564 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 14 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 7 ms 27228 KB Output is correct
9 Correct 22 ms 29276 KB Output is correct
10 Correct 61 ms 58672 KB Output is correct
11 Correct 8 ms 26968 KB Output is correct
12 Correct 24 ms 27208 KB Output is correct
13 Correct 95 ms 66808 KB Output is correct
14 Correct 85 ms 67156 KB Output is correct
15 Correct 132 ms 76624 KB Output is correct
16 Correct 252 ms 101416 KB Output is correct
17 Correct 134 ms 83596 KB Output is correct
18 Correct 76 ms 64596 KB Output is correct
19 Correct 140 ms 78320 KB Output is correct
20 Correct 115 ms 78364 KB Output is correct
21 Correct 116 ms 81224 KB Output is correct
22 Correct 62 ms 60748 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 5 ms 26972 KB Output is correct
25 Correct 7 ms 27116 KB Output is correct
26 Correct 6 ms 27228 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 6 ms 27048 KB Output is correct
29 Correct 6 ms 27096 KB Output is correct
30 Correct 6 ms 27228 KB Output is correct
31 Correct 5 ms 26972 KB Output is correct
32 Correct 7 ms 27072 KB Output is correct
33 Correct 6 ms 27224 KB Output is correct
34 Correct 6 ms 27224 KB Output is correct
35 Correct 6 ms 26972 KB Output is correct
36 Correct 5 ms 26968 KB Output is correct
37 Correct 5 ms 26972 KB Output is correct
38 Correct 6 ms 27224 KB Output is correct
39 Correct 7 ms 27228 KB Output is correct
40 Correct 6 ms 27076 KB Output is correct
41 Correct 7 ms 26972 KB Output is correct
42 Correct 6 ms 27228 KB Output is correct
43 Correct 6 ms 27228 KB Output is correct
44 Correct 6 ms 27188 KB Output is correct
45 Correct 6 ms 26972 KB Output is correct
46 Correct 5 ms 26972 KB Output is correct
47 Correct 6 ms 27224 KB Output is correct
48 Correct 5 ms 27232 KB Output is correct
49 Correct 7 ms 27228 KB Output is correct
50 Correct 6 ms 27064 KB Output is correct
51 Correct 7 ms 27228 KB Output is correct
52 Correct 8 ms 27224 KB Output is correct
53 Correct 7 ms 27228 KB Output is correct
54 Correct 7 ms 27228 KB Output is correct
55 Correct 6 ms 27480 KB Output is correct
56 Correct 6 ms 27228 KB Output is correct
57 Correct 6 ms 27196 KB Output is correct
58 Correct 6 ms 27248 KB Output is correct
59 Correct 6 ms 27140 KB Output is correct
60 Correct 25 ms 29276 KB Output is correct
61 Correct 55 ms 58704 KB Output is correct
62 Correct 34 ms 29532 KB Output is correct
63 Correct 42 ms 29516 KB Output is correct
64 Correct 24 ms 29272 KB Output is correct
65 Correct 18 ms 28248 KB Output is correct
66 Correct 15 ms 27740 KB Output is correct
67 Correct 58 ms 49232 KB Output is correct
68 Correct 56 ms 49376 KB Output is correct
69 Correct 65 ms 53780 KB Output is correct
70 Correct 51 ms 53820 KB Output is correct
71 Correct 59 ms 49500 KB Output is correct
72 Correct 50 ms 49488 KB Output is correct
73 Correct 48 ms 50520 KB Output is correct
74 Correct 51 ms 50520 KB Output is correct
75 Correct 13 ms 28760 KB Output is correct
76 Correct 65 ms 49248 KB Output is correct
77 Correct 5 ms 26968 KB Output is correct
78 Correct 6 ms 26968 KB Output is correct
79 Correct 7 ms 26968 KB Output is correct
80 Correct 6 ms 27076 KB Output is correct
81 Correct 8 ms 27192 KB Output is correct
82 Correct 6 ms 26972 KB Output is correct
83 Correct 6 ms 26972 KB Output is correct
84 Correct 5 ms 26972 KB Output is correct
85 Correct 6 ms 26968 KB Output is correct
86 Correct 6 ms 26968 KB Output is correct
87 Correct 6 ms 27088 KB Output is correct
88 Correct 6 ms 27228 KB Output is correct
89 Correct 18 ms 27228 KB Output is correct
90 Correct 29 ms 27256 KB Output is correct
91 Correct 22 ms 27228 KB Output is correct
92 Correct 86 ms 51904 KB Output is correct
93 Correct 216 ms 65476 KB Output is correct
94 Correct 384 ms 81596 KB Output is correct
95 Correct 122 ms 54864 KB Output is correct
96 Correct 121 ms 54872 KB Output is correct
97 Correct 130 ms 54864 KB Output is correct
98 Correct 222 ms 65484 KB Output is correct
99 Correct 155 ms 65212 KB Output is correct
100 Correct 172 ms 65736 KB Output is correct
101 Correct 149 ms 65600 KB Output is correct
102 Correct 162 ms 65728 KB Output is correct
103 Correct 149 ms 63176 KB Output is correct
104 Correct 164 ms 65992 KB Output is correct
105 Correct 169 ms 60040 KB Output is correct
106 Correct 134 ms 58756 KB Output is correct
107 Correct 168 ms 59852 KB Output is correct
108 Correct 151 ms 57992 KB Output is correct
109 Correct 136 ms 58564 KB Output is correct
110 Correct 28 ms 27224 KB Output is correct
111 Correct 20 ms 27212 KB Output is correct
112 Correct 188 ms 75148 KB Output is correct
113 Correct 111 ms 61268 KB Output is correct
114 Correct 122 ms 65484 KB Output is correct
115 Correct 47 ms 49620 KB Output is correct
116 Correct 143 ms 52052 KB Output is correct
117 Correct 563 ms 103312 KB Output is correct
118 Correct 68 ms 49324 KB Output is correct
119 Correct 57 ms 49488 KB Output is correct
120 Correct 16 ms 29532 KB Output is correct
121 Correct 162 ms 56616 KB Output is correct
122 Correct 170 ms 56664 KB Output is correct
123 Correct 120 ms 64024 KB Output is correct
124 Correct 105 ms 64080 KB Output is correct
125 Correct 124 ms 65420 KB Output is correct
126 Correct 281 ms 97472 KB Output is correct
127 Correct 171 ms 84772 KB Output is correct
128 Correct 151 ms 86612 KB Output is correct
129 Correct 176 ms 84604 KB Output is correct
130 Correct 149 ms 85828 KB Output is correct