oj.uz

답안 #1077685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077685 2024-08-27T08:35:31 Z BABY_GANGSTER Jail (JOI22_jail) C++14
100 / 100
 676 ms 128676 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*8][2];
int heavy[N];
ib a[N];
int f[N];
int sz[N];
int mxz[N];
int c[N*8][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 17 ms 49756 KB Output is correct
2 Correct 17 ms 49752 KB Output is correct
3 Correct 17 ms 49756 KB Output is correct
4 Correct 20 ms 49756 KB Output is correct
5 Correct 26 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 17 ms 49796 KB Output is correct
8 Correct 18 ms 49756 KB Output is correct
9 Correct 34 ms 52052 KB Output is correct
10 Correct 72 ms 80980 KB Output is correct
11 Correct 20 ms 49752 KB Output is correct
12 Correct 32 ms 50516 KB Output is correct
13 Correct 127 ms 90964 KB Output is correct
14 Correct 110 ms 91460 KB Output is correct
15 Correct 183 ms 100848 KB Output is correct
16 Correct 318 ms 126820 KB Output is correct
17 Correct 142 ms 107984 KB Output is correct
18 Correct 97 ms 89940 KB Output is correct
19 Correct 158 ms 102992 KB Output is correct
20 Correct 142 ms 103012 KB Output is correct
21 Correct 152 ms 105544 KB Output is correct
22 Correct 76 ms 85196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 49756 KB Output is correct
2 Correct 17 ms 49756 KB Output is correct
3 Correct 18 ms 49756 KB Output is correct
4 Correct 21 ms 49752 KB Output is correct
5 Correct 18 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 18 ms 49756 KB Output is correct
8 Correct 26 ms 49756 KB Output is correct
9 Correct 17 ms 49644 KB Output is correct
10 Correct 22 ms 49756 KB Output is correct
11 Correct 18 ms 49756 KB Output is correct
12 Correct 18 ms 49568 KB Output is correct
13 Correct 18 ms 49756 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 49756 KB Output is correct
2 Correct 17 ms 49756 KB Output is correct
3 Correct 18 ms 49756 KB Output is correct
4 Correct 21 ms 49752 KB Output is correct
5 Correct 18 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 18 ms 49756 KB Output is correct
8 Correct 26 ms 49756 KB Output is correct
9 Correct 17 ms 49644 KB Output is correct
10 Correct 22 ms 49756 KB Output is correct
11 Correct 18 ms 49756 KB Output is correct
12 Correct 18 ms 49568 KB Output is correct
13 Correct 18 ms 49756 KB Output is correct
14 Correct 18 ms 49756 KB Output is correct
15 Correct 18 ms 49756 KB Output is correct
16 Correct 18 ms 49756 KB Output is correct
17 Correct 20 ms 49628 KB Output is correct
18 Correct 17 ms 49756 KB Output is correct
19 Correct 16 ms 49704 KB Output is correct
20 Correct 18 ms 49636 KB Output is correct
21 Correct 18 ms 49752 KB Output is correct
22 Correct 17 ms 49756 KB Output is correct
23 Correct 16 ms 49752 KB Output is correct
24 Correct 17 ms 49756 KB Output is correct
25 Correct 18 ms 49756 KB Output is correct
26 Correct 18 ms 49756 KB Output is correct
27 Correct 17 ms 49756 KB Output is correct
28 Correct 16 ms 49752 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 49756 KB Output is correct
2 Correct 17 ms 49756 KB Output is correct
3 Correct 18 ms 49756 KB Output is correct
4 Correct 21 ms 49752 KB Output is correct
5 Correct 18 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 18 ms 49756 KB Output is correct
8 Correct 26 ms 49756 KB Output is correct
9 Correct 17 ms 49644 KB Output is correct
10 Correct 22 ms 49756 KB Output is correct
11 Correct 18 ms 49756 KB Output is correct
12 Correct 18 ms 49568 KB Output is correct
13 Correct 18 ms 49756 KB Output is correct
14 Correct 18 ms 49756 KB Output is correct
15 Correct 18 ms 49756 KB Output is correct
16 Correct 18 ms 49756 KB Output is correct
17 Correct 20 ms 49628 KB Output is correct
18 Correct 17 ms 49756 KB Output is correct
19 Correct 16 ms 49704 KB Output is correct
20 Correct 18 ms 49636 KB Output is correct
21 Correct 18 ms 49752 KB Output is correct
22 Correct 17 ms 49756 KB Output is correct
23 Correct 16 ms 49752 KB Output is correct
24 Correct 17 ms 49756 KB Output is correct
25 Correct 18 ms 49756 KB Output is correct
26 Correct 18 ms 49756 KB Output is correct
27 Correct 17 ms 49756 KB Output is correct
28 Correct 16 ms 49752 KB Output is correct
29 Correct 20 ms 49756 KB Output is correct
30 Correct 18 ms 49648 KB Output is correct
31 Correct 17 ms 49752 KB Output is correct
32 Correct 18 ms 49744 KB Output is correct
33 Correct 17 ms 49756 KB Output is correct
34 Correct 19 ms 49756 KB Output is correct
35 Correct 17 ms 49752 KB Output is correct
36 Correct 17 ms 49752 KB Output is correct
37 Correct 18 ms 49692 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 49756 KB Output is correct
2 Correct 17 ms 49756 KB Output is correct
3 Correct 18 ms 49756 KB Output is correct
4 Correct 21 ms 49752 KB Output is correct
5 Correct 18 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 18 ms 49756 KB Output is correct
8 Correct 26 ms 49756 KB Output is correct
9 Correct 17 ms 49644 KB Output is correct
10 Correct 22 ms 49756 KB Output is correct
11 Correct 18 ms 49756 KB Output is correct
12 Correct 18 ms 49568 KB Output is correct
13 Correct 18 ms 49756 KB Output is correct
14 Correct 18 ms 49756 KB Output is correct
15 Correct 18 ms 49756 KB Output is correct
16 Correct 18 ms 49756 KB Output is correct
17 Correct 20 ms 49628 KB Output is correct
18 Correct 17 ms 49756 KB Output is correct
19 Correct 16 ms 49704 KB Output is correct
20 Correct 18 ms 49636 KB Output is correct
21 Correct 18 ms 49752 KB Output is correct
22 Correct 17 ms 49756 KB Output is correct
23 Correct 16 ms 49752 KB Output is correct
24 Correct 17 ms 49756 KB Output is correct
25 Correct 18 ms 49756 KB Output is correct
26 Correct 18 ms 49756 KB Output is correct
27 Correct 17 ms 49756 KB Output is correct
28 Correct 16 ms 49752 KB Output is correct
29 Correct 20 ms 49756 KB Output is correct
30 Correct 18 ms 49648 KB Output is correct
31 Correct 17 ms 49752 KB Output is correct
32 Correct 18 ms 49744 KB Output is correct
33 Correct 17 ms 49756 KB Output is correct
34 Correct 19 ms 49756 KB Output is correct
35 Correct 17 ms 49752 KB Output is correct
36 Correct 17 ms 49752 KB Output is correct
37 Correct 18 ms 49692 KB Output is correct
38 Correct 33 ms 52052 KB Output is correct
39 Correct 60 ms 80888 KB Output is correct
40 Correct 42 ms 53336 KB Output is correct
41 Correct 48 ms 53328 KB Output is correct
42 Correct 35 ms 53076 KB Output is correct
43 Correct 35 ms 52060 KB Output is correct
44 Correct 26 ms 50512 KB Output is correct
45 Correct 73 ms 73300 KB Output is correct
46 Correct 68 ms 73040 KB Output is correct
47 Correct 66 ms 77392 KB Output is correct
48 Correct 64 ms 77652 KB Output is correct
49 Correct 66 ms 73220 KB Output is correct
50 Correct 72 ms 73304 KB Output is correct
51 Correct 58 ms 74320 KB Output is correct
52 Correct 60 ms 74324 KB Output is correct
53 Correct 25 ms 51540 KB Output is correct
54 Correct 78 ms 72968 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 49756 KB Output is correct
2 Correct 15 ms 49612 KB Output is correct
3 Correct 16 ms 49756 KB Output is correct
4 Correct 15 ms 49756 KB Output is correct
5 Correct 18 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 17 ms 49756 KB Output is correct
8 Correct 17 ms 49756 KB Output is correct
9 Correct 15 ms 49756 KB Output is correct
10 Correct 16 ms 49784 KB Output is correct
11 Correct 17 ms 49756 KB Output is correct
12 Correct 18 ms 49752 KB Output is correct
13 Correct 30 ms 49756 KB Output is correct
14 Correct 38 ms 49752 KB Output is correct
15 Correct 32 ms 49752 KB Output is correct
16 Correct 92 ms 74320 KB Output is correct
17 Correct 228 ms 87996 KB Output is correct
18 Correct 378 ms 104052 KB Output is correct
19 Correct 138 ms 77240 KB Output is correct
20 Correct 126 ms 77152 KB Output is correct
21 Correct 143 ms 77308 KB Output is correct
22 Correct 222 ms 87756 KB Output is correct
23 Correct 173 ms 87796 KB Output is correct
24 Correct 177 ms 88012 KB Output is correct
25 Correct 166 ms 87868 KB Output is correct
26 Correct 179 ms 88000 KB Output is correct
27 Correct 192 ms 85680 KB Output is correct
28 Correct 199 ms 88668 KB Output is correct
29 Correct 184 ms 82624 KB Output is correct
30 Correct 169 ms 80844 KB Output is correct
31 Correct 165 ms 82124 KB Output is correct
32 Correct 178 ms 80080 KB Output is correct
33 Correct 204 ms 80844 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49756 KB Output is correct
2 Correct 17 ms 49752 KB Output is correct
3 Correct 17 ms 49756 KB Output is correct
4 Correct 20 ms 49756 KB Output is correct
5 Correct 26 ms 49756 KB Output is correct
6 Correct 17 ms 49756 KB Output is correct
7 Correct 17 ms 49796 KB Output is correct
8 Correct 18 ms 49756 KB Output is correct
9 Correct 34 ms 52052 KB Output is correct
10 Correct 72 ms 80980 KB Output is correct
11 Correct 20 ms 49752 KB Output is correct
12 Correct 32 ms 50516 KB Output is correct
13 Correct 127 ms 90964 KB Output is correct
14 Correct 110 ms 91460 KB Output is correct
15 Correct 183 ms 100848 KB Output is correct
16 Correct 318 ms 126820 KB Output is correct
17 Correct 142 ms 107984 KB Output is correct
18 Correct 97 ms 89940 KB Output is correct
19 Correct 158 ms 102992 KB Output is correct
20 Correct 142 ms 103012 KB Output is correct
21 Correct 152 ms 105544 KB Output is correct
22 Correct 76 ms 85196 KB Output is correct
23 Correct 16 ms 49756 KB Output is correct
24 Correct 17 ms 49756 KB Output is correct
25 Correct 18 ms 49756 KB Output is correct
26 Correct 21 ms 49752 KB Output is correct
27 Correct 18 ms 49756 KB Output is correct
28 Correct 17 ms 49756 KB Output is correct
29 Correct 18 ms 49756 KB Output is correct
30 Correct 26 ms 49756 KB Output is correct
31 Correct 17 ms 49644 KB Output is correct
32 Correct 22 ms 49756 KB Output is correct
33 Correct 18 ms 49756 KB Output is correct
34 Correct 18 ms 49568 KB Output is correct
35 Correct 18 ms 49756 KB Output is correct
36 Correct 18 ms 49756 KB Output is correct
37 Correct 18 ms 49756 KB Output is correct
38 Correct 18 ms 49756 KB Output is correct
39 Correct 20 ms 49628 KB Output is correct
40 Correct 17 ms 49756 KB Output is correct
41 Correct 16 ms 49704 KB Output is correct
42 Correct 18 ms 49636 KB Output is correct
43 Correct 18 ms 49752 KB Output is correct
44 Correct 17 ms 49756 KB Output is correct
45 Correct 16 ms 49752 KB Output is correct
46 Correct 17 ms 49756 KB Output is correct
47 Correct 18 ms 49756 KB Output is correct
48 Correct 18 ms 49756 KB Output is correct
49 Correct 17 ms 49756 KB Output is correct
50 Correct 16 ms 49752 KB Output is correct
51 Correct 20 ms 49756 KB Output is correct
52 Correct 18 ms 49648 KB Output is correct
53 Correct 17 ms 49752 KB Output is correct
54 Correct 18 ms 49744 KB Output is correct
55 Correct 17 ms 49756 KB Output is correct
56 Correct 19 ms 49756 KB Output is correct
57 Correct 17 ms 49752 KB Output is correct
58 Correct 17 ms 49752 KB Output is correct
59 Correct 18 ms 49692 KB Output is correct
60 Correct 33 ms 52052 KB Output is correct
61 Correct 60 ms 80888 KB Output is correct
62 Correct 42 ms 53336 KB Output is correct
63 Correct 48 ms 53328 KB Output is correct
64 Correct 35 ms 53076 KB Output is correct
65 Correct 35 ms 52060 KB Output is correct
66 Correct 26 ms 50512 KB Output is correct
67 Correct 73 ms 73300 KB Output is correct
68 Correct 68 ms 73040 KB Output is correct
69 Correct 66 ms 77392 KB Output is correct
70 Correct 64 ms 77652 KB Output is correct
71 Correct 66 ms 73220 KB Output is correct
72 Correct 72 ms 73304 KB Output is correct
73 Correct 58 ms 74320 KB Output is correct
74 Correct 60 ms 74324 KB Output is correct
75 Correct 25 ms 51540 KB Output is correct
76 Correct 78 ms 72968 KB Output is correct
77 Correct 18 ms 49756 KB Output is correct
78 Correct 15 ms 49612 KB Output is correct
79 Correct 16 ms 49756 KB Output is correct
80 Correct 15 ms 49756 KB Output is correct
81 Correct 18 ms 49756 KB Output is correct
82 Correct 17 ms 49756 KB Output is correct
83 Correct 17 ms 49756 KB Output is correct
84 Correct 17 ms 49756 KB Output is correct
85 Correct 15 ms 49756 KB Output is correct
86 Correct 16 ms 49784 KB Output is correct
87 Correct 17 ms 49756 KB Output is correct
88 Correct 18 ms 49752 KB Output is correct
89 Correct 30 ms 49756 KB Output is correct
90 Correct 38 ms 49752 KB Output is correct
91 Correct 32 ms 49752 KB Output is correct
92 Correct 92 ms 74320 KB Output is correct
93 Correct 228 ms 87996 KB Output is correct
94 Correct 378 ms 104052 KB Output is correct
95 Correct 138 ms 77240 KB Output is correct
96 Correct 126 ms 77152 KB Output is correct
97 Correct 143 ms 77308 KB Output is correct
98 Correct 222 ms 87756 KB Output is correct
99 Correct 173 ms 87796 KB Output is correct
100 Correct 177 ms 88012 KB Output is correct
101 Correct 166 ms 87868 KB Output is correct
102 Correct 179 ms 88000 KB Output is correct
103 Correct 192 ms 85680 KB Output is correct
104 Correct 199 ms 88668 KB Output is correct
105 Correct 184 ms 82624 KB Output is correct
106 Correct 169 ms 80844 KB Output is correct
107 Correct 165 ms 82124 KB Output is correct
108 Correct 178 ms 80080 KB Output is correct
109 Correct 204 ms 80844 KB Output is correct
110 Correct 45 ms 50768 KB Output is correct
111 Correct 30 ms 49872 KB Output is correct
112 Correct 232 ms 99576 KB Output is correct
113 Correct 168 ms 85184 KB Output is correct
114 Correct 162 ms 89588 KB Output is correct
115 Correct 95 ms 73096 KB Output is correct
116 Correct 180 ms 76368 KB Output is correct
117 Correct 676 ms 128676 KB Output is correct
118 Correct 108 ms 73108 KB Output is correct
119 Correct 96 ms 74836 KB Output is correct
120 Correct 31 ms 52308 KB Output is correct
121 Correct 270 ms 80976 KB Output is correct
122 Correct 230 ms 81184 KB Output is correct
123 Correct 169 ms 87956 KB Output is correct
124 Correct 134 ms 88100 KB Output is correct
125 Correct 161 ms 89360 KB Output is correct
126 Correct 377 ms 122560 KB Output is correct
127 Correct 191 ms 109052 KB Output is correct
128 Correct 199 ms 111164 KB Output is correct
129 Correct 184 ms 108928 KB Output is correct
130 Correct 178 ms 110316 KB Output is correct