oj.uz

답안 #1077702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077702 2024-08-27T08:39:18 Z modwwe Jail (JOI22_jail) C++17
100 / 100
 695 ms 122912 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
}
int st[17][120007];
int depth[120007];
int head[120007];
int pos[120007];
vector<int> v2[120007];
vector<ib> v[480007][2];
int heavy[120007];
ib a[120007];
int f[120007];
int sz[120007];
int mxz[120007];
int c[480007][2];
void dfs(int x,int y)
{
    sz[x]=1;
    mxz[x]=0;
    st[0][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];
        }
    }
}

int lca2(int x,int y)
{
    if(depth[x]<depth[y]) swap(x,y);
    int ss=depth[x]-depth[y]-1;
    if(ss>=0)
        for(int j=0; j<17; ++j)
            if(bit(ss,j))
                x=st[j][x];
    if(st[0][x]==y) return x;
    if(ss!=-1)  x=st[0][x];
    for(int j=16; j>=0; --j)
        if(st[j][x]!=st[j][y])
            x=st[j][x],y=st[j][y];
    return x;
}
int lca(int x,int y)
{
    if(depth[x]<depth[y]) swap(x,y);
    int ss=depth[x]-depth[y];
    for(int j=0; j<17; ++j)
        if(bit(ss,j))
            x=st[j][x];
    if(x==y) return x;
    for(int j=16; j>=0; --j)
        if(st[j][x]!=st[j][y])
            x=st[j][x],y=st[j][y];
    return st[0][x];
}
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);
}
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>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            v[x][0].pb({node,0});
         //   if(x==5) cout<<node,debug
            return;
        }
        int mid=l+r>>1;
        upd(node<<1,l,mid,l1,r1,x);
        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>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            v[node][1].pb({x,0});
            ///if(node==5) cout<<x<<" "<<l1<<" "<<r1<<" fadfdafafa",debug
            return;
        }
        int mid=l+r>>1;
        upd2(node<<1,l,mid,l1,r1,x);
        upd2(node<<1|1,mid+1,r,l1,r1,x);
 }
    void hld(int x,int y,int z)
    {
        if(pos[x]<pos[y]) return;
        if(pos[head[x]]<=pos[y]) upd(1,1,n,pos[y],pos[x],z);
        else upd(1,1,n,pos[head[x]],pos[x],z),hld(st[0][head[x]],y,z);
    }
    void hld2(int x,int y,int z)
    {
        if(pos[x]<pos[y]) return;
        if(pos[head[x]]<=pos[y]) upd2(1,1,n,pos[y],pos[x],z);
        else upd2(1,1,n,pos[head[x]],pos[x],z),hld2(st[0][head[x]],y,z);
    }
    void upd_hld(int x,int y)
    {
        s2=lca(x,y);
        s3=lca2(s2,y);
        hld(st[0][x],s2,f[pos[x]]);
        hld(y,s3,f[pos[x]]);
if(s2==y)s2=lca2(x,s2);
         hld2(x,s2,f[pos[x]]);
        hld2(st[0][y],s3,f[pos[x]]);
    }
} stt;
bool de;
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);
    for(int i=1; i<17; i++)
        for(int j=1; j<=n; j++)
            st[i][j]=st[i-1][st[i-1][j]];
    stt.setup(1,1,n);
m=scan();
    for(int i=1; i<=m; i++)
       a[i].a=scan(),a[i].b=scan(),stt.upd_hld(a[i].a,a[i].b),v[f[pos[a[i].a]]][0].pb({f[pos[a[i].b]],1});
 dem=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 member function 'void IT::setup(int, int, int)':
jail.cpp:156:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  156 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd(int, int, int, int, int, int)':
jail.cpp:169:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  169 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd2(int, int, int, int, int, int)':
jail.cpp:183:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  183 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd_hld(int, int)':
jail.cpp:205:1: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  205 | if(s2==y)s2=lca2(x,s2);
      | ^~
jail.cpp:206:10: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  206 |          hld2(x,s2,f[pos[x]]);
      |          ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 27228 KB Output is correct
2 Correct 11 ms 27228 KB Output is correct
3 Correct 7 ms 27228 KB Output is correct
4 Correct 14 ms 27228 KB Output is correct
5 Correct 18 ms 27300 KB Output is correct
6 Correct 9 ms 27228 KB Output is correct
7 Correct 8 ms 27228 KB Output is correct
8 Correct 11 ms 27228 KB Output is correct
9 Correct 29 ms 30460 KB Output is correct
10 Correct 63 ms 78420 KB Output is correct
11 Correct 11 ms 27228 KB Output is correct
12 Correct 27 ms 27308 KB Output is correct
13 Correct 121 ms 86868 KB Output is correct
14 Correct 112 ms 87632 KB Output is correct
15 Correct 212 ms 97008 KB Output is correct
16 Correct 374 ms 122912 KB Output is correct
17 Correct 157 ms 102096 KB Output is correct
18 Correct 105 ms 83076 KB Output is correct
19 Correct 159 ms 98556 KB Output is correct
20 Correct 139 ms 98576 KB Output is correct
21 Correct 166 ms 101960 KB Output is correct
22 Correct 80 ms 80616 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 27224 KB Output is correct
2 Correct 8 ms 27228 KB Output is correct
3 Correct 9 ms 27224 KB Output is correct
4 Correct 8 ms 27228 KB Output is correct
5 Correct 10 ms 27088 KB Output is correct
6 Correct 9 ms 27088 KB Output is correct
7 Correct 9 ms 27228 KB Output is correct
8 Correct 9 ms 27096 KB Output is correct
9 Correct 8 ms 27228 KB Output is correct
10 Correct 9 ms 27192 KB Output is correct
11 Correct 9 ms 27228 KB Output is correct
12 Correct 9 ms 27228 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 8 ms 27224 KB Output is correct
15 Correct 9 ms 27248 KB Output is correct
16 Correct 8 ms 27224 KB Output is correct
17 Correct 10 ms 27328 KB Output is correct
18 Correct 10 ms 27224 KB Output is correct
19 Correct 8 ms 27228 KB Output is correct
20 Correct 9 ms 27344 KB Output is correct
21 Correct 9 ms 27224 KB Output is correct
22 Correct 9 ms 27356 KB Output is correct
23 Correct 8 ms 27228 KB Output is correct
24 Correct 12 ms 27228 KB Output is correct
25 Correct 9 ms 27224 KB Output is correct
26 Correct 9 ms 27228 KB Output is correct
27 Correct 8 ms 27228 KB Output is correct
28 Correct 9 ms 27084 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 27224 KB Output is correct
2 Correct 8 ms 27228 KB Output is correct
3 Correct 9 ms 27224 KB Output is correct
4 Correct 8 ms 27228 KB Output is correct
5 Correct 10 ms 27088 KB Output is correct
6 Correct 9 ms 27088 KB Output is correct
7 Correct 9 ms 27228 KB Output is correct
8 Correct 9 ms 27096 KB Output is correct
9 Correct 8 ms 27228 KB Output is correct
10 Correct 9 ms 27192 KB Output is correct
11 Correct 9 ms 27228 KB Output is correct
12 Correct 9 ms 27228 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 8 ms 27224 KB Output is correct
15 Correct 9 ms 27248 KB Output is correct
16 Correct 8 ms 27224 KB Output is correct
17 Correct 10 ms 27328 KB Output is correct
18 Correct 10 ms 27224 KB Output is correct
19 Correct 8 ms 27228 KB Output is correct
20 Correct 9 ms 27344 KB Output is correct
21 Correct 9 ms 27224 KB Output is correct
22 Correct 9 ms 27356 KB Output is correct
23 Correct 8 ms 27228 KB Output is correct
24 Correct 12 ms 27228 KB Output is correct
25 Correct 9 ms 27224 KB Output is correct
26 Correct 9 ms 27228 KB Output is correct
27 Correct 8 ms 27228 KB Output is correct
28 Correct 9 ms 27084 KB Output is correct
29 Correct 13 ms 27400 KB Output is correct
30 Correct 12 ms 27224 KB Output is correct
31 Correct 9 ms 27312 KB Output is correct
32 Correct 13 ms 25948 KB Output is correct
33 Correct 14 ms 26012 KB Output is correct
34 Correct 15 ms 26972 KB Output is correct
35 Correct 22 ms 26972 KB Output is correct
36 Correct 20 ms 25948 KB Output is correct
37 Correct 14 ms 26912 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 27224 KB Output is correct
2 Correct 8 ms 27228 KB Output is correct
3 Correct 9 ms 27224 KB Output is correct
4 Correct 8 ms 27228 KB Output is correct
5 Correct 10 ms 27088 KB Output is correct
6 Correct 9 ms 27088 KB Output is correct
7 Correct 9 ms 27228 KB Output is correct
8 Correct 9 ms 27096 KB Output is correct
9 Correct 8 ms 27228 KB Output is correct
10 Correct 9 ms 27192 KB Output is correct
11 Correct 9 ms 27228 KB Output is correct
12 Correct 9 ms 27228 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 8 ms 27224 KB Output is correct
15 Correct 9 ms 27248 KB Output is correct
16 Correct 8 ms 27224 KB Output is correct
17 Correct 10 ms 27328 KB Output is correct
18 Correct 10 ms 27224 KB Output is correct
19 Correct 8 ms 27228 KB Output is correct
20 Correct 9 ms 27344 KB Output is correct
21 Correct 9 ms 27224 KB Output is correct
22 Correct 9 ms 27356 KB Output is correct
23 Correct 8 ms 27228 KB Output is correct
24 Correct 12 ms 27228 KB Output is correct
25 Correct 9 ms 27224 KB Output is correct
26 Correct 9 ms 27228 KB Output is correct
27 Correct 8 ms 27228 KB Output is correct
28 Correct 9 ms 27084 KB Output is correct
29 Correct 13 ms 27400 KB Output is correct
30 Correct 12 ms 27224 KB Output is correct
31 Correct 9 ms 27312 KB Output is correct
32 Correct 13 ms 25948 KB Output is correct
33 Correct 14 ms 26012 KB Output is correct
34 Correct 15 ms 26972 KB Output is correct
35 Correct 22 ms 26972 KB Output is correct
36 Correct 20 ms 25948 KB Output is correct
37 Correct 14 ms 26912 KB Output is correct
38 Correct 34 ms 29264 KB Output is correct
39 Correct 75 ms 78588 KB Output is correct
40 Correct 41 ms 30032 KB Output is correct
41 Correct 67 ms 30036 KB Output is correct
42 Correct 34 ms 30116 KB Output is correct
43 Correct 27 ms 28764 KB Output is correct
44 Correct 36 ms 27444 KB Output is correct
45 Correct 65 ms 56144 KB Output is correct
46 Correct 95 ms 56144 KB Output is correct
47 Correct 65 ms 67156 KB Output is correct
48 Correct 64 ms 67204 KB Output is correct
49 Correct 73 ms 56644 KB Output is correct
50 Correct 72 ms 56500 KB Output is correct
51 Correct 58 ms 59472 KB Output is correct
52 Correct 59 ms 59676 KB Output is correct
53 Correct 17 ms 29276 KB Output is correct
54 Correct 73 ms 56024 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 27228 KB Output is correct
2 Correct 10 ms 27152 KB Output is correct
3 Correct 8 ms 27248 KB Output is correct
4 Correct 11 ms 27108 KB Output is correct
5 Correct 15 ms 27076 KB Output is correct
6 Correct 12 ms 27200 KB Output is correct
7 Correct 9 ms 27228 KB Output is correct
8 Correct 10 ms 27068 KB Output is correct
9 Correct 9 ms 27252 KB Output is correct
10 Correct 11 ms 27228 KB Output is correct
11 Correct 9 ms 27260 KB Output is correct
12 Correct 9 ms 27228 KB Output is correct
13 Correct 36 ms 27296 KB Output is correct
14 Correct 41 ms 27228 KB Output is correct
15 Correct 30 ms 27228 KB Output is correct
16 Correct 108 ms 58804 KB Output is correct
17 Correct 291 ms 72648 KB Output is correct
18 Correct 546 ms 89948 KB Output is correct
19 Correct 169 ms 61776 KB Output is correct
20 Correct 172 ms 61792 KB Output is correct
21 Correct 171 ms 61952 KB Output is correct
22 Correct 263 ms 73124 KB Output is correct
23 Correct 208 ms 73680 KB Output is correct
24 Correct 254 ms 73364 KB Output is correct
25 Correct 204 ms 74048 KB Output is correct
26 Correct 248 ms 73868 KB Output is correct
27 Correct 257 ms 66836 KB Output is correct
28 Correct 195 ms 67812 KB Output is correct
29 Correct 241 ms 65636 KB Output is correct
30 Correct 221 ms 63944 KB Output is correct
31 Correct 204 ms 64856 KB Output is correct
32 Correct 252 ms 64952 KB Output is correct
33 Correct 188 ms 65624 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 27228 KB Output is correct
2 Correct 11 ms 27228 KB Output is correct
3 Correct 7 ms 27228 KB Output is correct
4 Correct 14 ms 27228 KB Output is correct
5 Correct 18 ms 27300 KB Output is correct
6 Correct 9 ms 27228 KB Output is correct
7 Correct 8 ms 27228 KB Output is correct
8 Correct 11 ms 27228 KB Output is correct
9 Correct 29 ms 30460 KB Output is correct
10 Correct 63 ms 78420 KB Output is correct
11 Correct 11 ms 27228 KB Output is correct
12 Correct 27 ms 27308 KB Output is correct
13 Correct 121 ms 86868 KB Output is correct
14 Correct 112 ms 87632 KB Output is correct
15 Correct 212 ms 97008 KB Output is correct
16 Correct 374 ms 122912 KB Output is correct
17 Correct 157 ms 102096 KB Output is correct
18 Correct 105 ms 83076 KB Output is correct
19 Correct 159 ms 98556 KB Output is correct
20 Correct 139 ms 98576 KB Output is correct
21 Correct 166 ms 101960 KB Output is correct
22 Correct 80 ms 80616 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 8 ms 27228 KB Output is correct
25 Correct 9 ms 27224 KB Output is correct
26 Correct 8 ms 27228 KB Output is correct
27 Correct 10 ms 27088 KB Output is correct
28 Correct 9 ms 27088 KB Output is correct
29 Correct 9 ms 27228 KB Output is correct
30 Correct 9 ms 27096 KB Output is correct
31 Correct 8 ms 27228 KB Output is correct
32 Correct 9 ms 27192 KB Output is correct
33 Correct 9 ms 27228 KB Output is correct
34 Correct 9 ms 27228 KB Output is correct
35 Correct 8 ms 27228 KB Output is correct
36 Correct 8 ms 27224 KB Output is correct
37 Correct 9 ms 27248 KB Output is correct
38 Correct 8 ms 27224 KB Output is correct
39 Correct 10 ms 27328 KB Output is correct
40 Correct 10 ms 27224 KB Output is correct
41 Correct 8 ms 27228 KB Output is correct
42 Correct 9 ms 27344 KB Output is correct
43 Correct 9 ms 27224 KB Output is correct
44 Correct 9 ms 27356 KB Output is correct
45 Correct 8 ms 27228 KB Output is correct
46 Correct 12 ms 27228 KB Output is correct
47 Correct 9 ms 27224 KB Output is correct
48 Correct 9 ms 27228 KB Output is correct
49 Correct 8 ms 27228 KB Output is correct
50 Correct 9 ms 27084 KB Output is correct
51 Correct 13 ms 27400 KB Output is correct
52 Correct 12 ms 27224 KB Output is correct
53 Correct 9 ms 27312 KB Output is correct
54 Correct 13 ms 25948 KB Output is correct
55 Correct 14 ms 26012 KB Output is correct
56 Correct 15 ms 26972 KB Output is correct
57 Correct 22 ms 26972 KB Output is correct
58 Correct 20 ms 25948 KB Output is correct
59 Correct 14 ms 26912 KB Output is correct
60 Correct 34 ms 29264 KB Output is correct
61 Correct 75 ms 78588 KB Output is correct
62 Correct 41 ms 30032 KB Output is correct
63 Correct 67 ms 30036 KB Output is correct
64 Correct 34 ms 30116 KB Output is correct
65 Correct 27 ms 28764 KB Output is correct
66 Correct 36 ms 27444 KB Output is correct
67 Correct 65 ms 56144 KB Output is correct
68 Correct 95 ms 56144 KB Output is correct
69 Correct 65 ms 67156 KB Output is correct
70 Correct 64 ms 67204 KB Output is correct
71 Correct 73 ms 56644 KB Output is correct
72 Correct 72 ms 56500 KB Output is correct
73 Correct 58 ms 59472 KB Output is correct
74 Correct 59 ms 59676 KB Output is correct
75 Correct 17 ms 29276 KB Output is correct
76 Correct 73 ms 56024 KB Output is correct
77 Correct 10 ms 27228 KB Output is correct
78 Correct 10 ms 27152 KB Output is correct
79 Correct 8 ms 27248 KB Output is correct
80 Correct 11 ms 27108 KB Output is correct
81 Correct 15 ms 27076 KB Output is correct
82 Correct 12 ms 27200 KB Output is correct
83 Correct 9 ms 27228 KB Output is correct
84 Correct 10 ms 27068 KB Output is correct
85 Correct 9 ms 27252 KB Output is correct
86 Correct 11 ms 27228 KB Output is correct
87 Correct 9 ms 27260 KB Output is correct
88 Correct 9 ms 27228 KB Output is correct
89 Correct 36 ms 27296 KB Output is correct
90 Correct 41 ms 27228 KB Output is correct
91 Correct 30 ms 27228 KB Output is correct
92 Correct 108 ms 58804 KB Output is correct
93 Correct 291 ms 72648 KB Output is correct
94 Correct 546 ms 89948 KB Output is correct
95 Correct 169 ms 61776 KB Output is correct
96 Correct 172 ms 61792 KB Output is correct
97 Correct 171 ms 61952 KB Output is correct
98 Correct 263 ms 73124 KB Output is correct
99 Correct 208 ms 73680 KB Output is correct
100 Correct 254 ms 73364 KB Output is correct
101 Correct 204 ms 74048 KB Output is correct
102 Correct 248 ms 73868 KB Output is correct
103 Correct 257 ms 66836 KB Output is correct
104 Correct 195 ms 67812 KB Output is correct
105 Correct 241 ms 65636 KB Output is correct
106 Correct 221 ms 63944 KB Output is correct
107 Correct 204 ms 64856 KB Output is correct
108 Correct 252 ms 64952 KB Output is correct
109 Correct 188 ms 65624 KB Output is correct
110 Correct 37 ms 27412 KB Output is correct
111 Correct 24 ms 27344 KB Output is correct
112 Correct 298 ms 89896 KB Output is correct
113 Correct 160 ms 74992 KB Output is correct
114 Correct 196 ms 83844 KB Output is correct
115 Correct 66 ms 56612 KB Output is correct
116 Correct 200 ms 60216 KB Output is correct
117 Correct 695 ms 111416 KB Output is correct
118 Correct 71 ms 56128 KB Output is correct
119 Correct 89 ms 56148 KB Output is correct
120 Correct 18 ms 30344 KB Output is correct
121 Correct 223 ms 64336 KB Output is correct
122 Correct 232 ms 64340 KB Output is correct
123 Correct 174 ms 80244 KB Output is correct
124 Correct 176 ms 80200 KB Output is correct
125 Correct 212 ms 81656 KB Output is correct
126 Correct 440 ms 115464 KB Output is correct
127 Correct 255 ms 116244 KB Output is correct
128 Correct 205 ms 116292 KB Output is correct
129 Correct 236 ms 116776 KB Output is correct
130 Correct 209 ms 117208 KB Output is correct