oj.uz

답안 #880931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880931 2023-11-30T08:54:27 Z vivkostov Jail (JOI22_jail) C++14
100 / 100
 2485 ms 785584 KB 
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
struct cell
{
    int st,in;
};
bool cmp(cell a1,cell a2)
{
    return a1.st>a2.st;
}
int q,n,m,c,d,a[2000005],b[2000005],child[2000005],machild[2000005],used[2000005],up[2000005],bin[2000005][60],level[2000005],usedl[2000005],in,brr,brj,tim,usedr[2000005];
vector<int>v[2000005],p[2000005],rp[2000005];
cell order[2000005];
void find_child(int beg,int par,int lev)
{
    level[beg]=lev;
    child[beg]++;
    bin[beg][0]=par;
    int w=0;
    for(int i=0;i<v[beg].size();i++)
    {
        w=v[beg][i];
        if(!child[w])
        {
            find_child(w,beg,lev+1);
            child[beg]+=child[w];
            machild[beg]=max(machild[beg],child[w]);
        }
    }
}
void heavylight(int beg,int last)
{
    in++;
    up[beg]=last;
    used[beg]=in;
    int w,ma=0;
    for(int i=0;i<v[beg].size();i++)
    {
        w=v[beg][i];
        if(!used[w]&&child[w]==machild[beg])
        {
            heavylight(w,last);
            break;
        }
    }
    for(int i=0;i<v[beg].size();i++)
    {
        w=v[beg][i];
        if(!used[w])heavylight(w,w);
    }
}
void make_start(int l,int r,int h)
{
    if(l==r)return;
    int mid=(l+r)/2;
    p[h+n].push_back(h*2+n);
    p[h+n].push_back(h*2+1+n);
    make_start(l,mid,h*2);
    make_start(mid+1,r,h*2+1);
}
void make_finish(int l,int r,int h)
{
    if(l==r)return;
    int mid=(l+r)/2;
    p[h*2+n*5].push_back(h+n*5);
    p[h*2+1+n*5].push_back(h+n*5);
    make_finish(l,mid,h*2);
    make_finish(mid+1,r,h*2+1);
}
void update(int l,int r,int ql,int qr,int h,int to,int type)
{
    if(l>qr||r<ql)return;
    if(l>=ql&&r<=qr)
    {
        if(type==1)p[h+n].push_back(to);
        if(type==2)p[to].push_back(h+n*5);
        if(type==3)p[to].push_back(h+n);
        if(type==4)p[h+n*5].push_back(to);
        return;
    }
    int mid=(l+r)/2;
    update(l,mid,ql,qr,h*2,to,type);
    update(mid+1,r,ql,qr,h*2+1,to,type);
}
void make_bin()
{
    for(int j=1;j<=30;j++)
    {
        for(int i=1;i<=n;i++)
        {
            bin[i][j]=bin[bin[i][j-1]][j-1];
        }
    }
}
void add_all()
{
    for(int i=1;i<=m;i++)
    {
        update(1,n,used[a[i]],used[a[i]],1,i,1);
        update(1,n,used[b[i]],used[b[i]],1,i,2);
    }
}
int lca(int x,int y)
{
    if(level[x]>level[y])swap(x,y);
    for(int i=30;i>=0;i--)
    {
        if(level[bin[y][i]]>=level[x])y=bin[y][i];
    }
    if(x==y)return x;
    for(int i=30;i>=0;i--)
    {
        if(bin[x][i]!=bin[y][i])
        {
            x=bin[x][i];
            y=bin[y][i];
        }
    }
    return bin[x][0];
}
void go_up_heavy(int beg,int lc,int prisoner)
{
    if(level[up[beg]]==level[lc])
    {
        update(1,n,used[up[beg]],used[beg],1,prisoner,3);
        update(1,n,used[up[beg]],used[beg],1,prisoner,4);
        return;
    }
    if(level[up[beg]]>level[lc])
    {
        update(1,n,used[up[beg]],used[beg],1,prisoner,3);
        update(1,n,used[up[beg]],used[beg],1,prisoner,4);
        go_up_heavy(bin[up[beg]][0],lc,prisoner);
        return;
    }
    update(1,n,used[lc],used[beg],1,prisoner,3);
    update(1,n,used[lc],used[beg],1,prisoner,4);
}
void add_path()
{
    for(int i=1;i<=m;i++)
    {
        int g=lca(a[i],b[i]);
        go_up_heavy(a[i],g,i);
        go_up_heavy(b[i],g,i);
    }
}
int tin[2000005],low[2000005],lamp,comp[2000005];
stack<int>s;
void add_rv(int beg)
{
    usedr[beg]=1;
    int w;
    for(int i=0;i<p[beg].size();i++)
    {
        w=p[beg][i];
        rp[w].push_back(beg);
        if(!usedr[w])add_rv(w);
    }
}
void fill_cycle(int beg)
{
    if(beg<=m)
    {
        brj++;
    }
    usedl[beg]=2;
    int w;
    for(int i=0; i<rp[beg].size(); i++)
    {
        w=rp[beg][i];
        if(usedl[w]==1)fill_cycle(w);
    }
}
void find_cycle(int beg)
{
    usedl[beg]=1;
    int w;
    for(int i=0; i<p[beg].size(); i++)
    {
        w=p[beg][i];
        if(!usedl[w])find_cycle(w);
    }
    tim++;
    order[beg].st=tim;
    order[beg].in=beg;
}
void resh()
{
    find_child(1,0,1);
    heavylight(1,1);
    make_start(1,n,1);
    make_finish(1,n,1);
    add_all();
    make_bin();
    add_path();
    for(int i=1;i<=n*10;i++)
    {
        if(!usedr[i])add_rv(i);
    }
    for(int i=1;i<=n*10;i++)
    {
        if(!usedl[i])find_cycle(i);
    }
    sort(order+1,order+n*10+1,cmp);
    for(int i=1;i<=n*10;i++)
    {
        if(usedl[order[i].in]==1)
        {
            fill_cycle(order[i].in);
            if(brj>=2)brr=1;
            brj=0;
        }
    }
    /*for(int i=1;i<=48;i++)
    {
        cout<<i<<" | ";
        for(int j=0;j<p[i].size();j++)
        {
            cout<<p[i][j]<<" ";
        }
        cout<<endl;
    }
    */
    if(brr)cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    for(int i=0;i<=n*15;i++)
    {
        a[i]=0;
        b[i]=0;
        child[i]=0;
        machild[i]=0;
        used[i]=0;
        up[i]=0;
        level[i]=0;
        usedl[i]=0;
        tin[i]=0;
        low[i]=0;
        comp[i]=0;
        usedr[i]=0;
        order[i].st=0;
        order[i].in=0;
        v[i].clear();
        p[i].clear();
        rp[i].clear();
        for(int j=0;j<=30;j++)bin[i][j]=0;
    }
    in=0;
    brr=0;
    brj=0;
    tim=0;
}
void read()
{
    cin>>q;
    for(int z=1;z<=q;z++)
    {
        cin>>n;
        for(int i=1;i<n;i++)
        {
            cin>>c>>d;
            v[c].push_back(d);
            v[d].push_back(c);
        }
        cin>>m;
        for(int i=1;i<=m;i++)
        {
            cin>>a[i]>>b[i];
        }
        resh();
    }
}
int main()
{
    speed();
    read();
    return 0;
}

Compilation message

jail.cpp: In function 'void find_child(int, int, int)':
jail.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp: In function 'void heavylight(int, int)':
jail.cpp:44:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp:53:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp:43:11: warning: unused variable 'ma' [-Wunused-variable]
   43 |     int w,ma=0;
      |           ^~
jail.cpp: In function 'void add_rv(int)':
jail.cpp:161:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |     for(int i=0;i<p[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp: In function 'void fill_cycle(int)':
jail.cpp:176:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  176 |     for(int i=0; i<rp[beg].size(); i++)
      |                  ~^~~~~~~~~~~~~~~
jail.cpp: In function 'void find_cycle(int)':
jail.cpp:186:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |     for(int i=0; i<p[beg].size(); i++)
      |                  ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164444 KB Output is correct
2 Correct 33 ms 164696 KB Output is correct
3 Correct 34 ms 164500 KB Output is correct
4 Correct 85 ms 164436 KB Output is correct
5 Correct 169 ms 165432 KB Output is correct
6 Correct 39 ms 164772 KB Output is correct
7 Correct 40 ms 164772 KB Output is correct
8 Correct 42 ms 164844 KB Output is correct
9 Correct 248 ms 192388 KB Output is correct
10 Correct 555 ms 703516 KB Output is correct
11 Correct 58 ms 164708 KB Output is correct
12 Correct 197 ms 165608 KB Output is correct
13 Correct 643 ms 714872 KB Output is correct
14 Correct 623 ms 715276 KB Output is correct
15 Correct 1112 ms 731316 KB Output is correct
16 Correct 2016 ms 783684 KB Output is correct
17 Correct 705 ms 738948 KB Output is correct
18 Correct 643 ms 740520 KB Output is correct
19 Correct 659 ms 734032 KB Output is correct
20 Correct 731 ms 734028 KB Output is correct
21 Correct 714 ms 736080 KB Output is correct
22 Correct 533 ms 718504 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164400 KB Output is correct
2 Correct 34 ms 164612 KB Output is correct
3 Correct 40 ms 164748 KB Output is correct
4 Correct 42 ms 164688 KB Output is correct
5 Correct 39 ms 164692 KB Output is correct
6 Correct 43 ms 164516 KB Output is correct
7 Correct 38 ms 164760 KB Output is correct
8 Correct 42 ms 164688 KB Output is correct
9 Correct 39 ms 164700 KB Output is correct
10 Correct 39 ms 164592 KB Output is correct
11 Correct 37 ms 164588 KB Output is correct
12 Correct 37 ms 164700 KB Output is correct
13 Correct 36 ms 164692 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164400 KB Output is correct
2 Correct 34 ms 164612 KB Output is correct
3 Correct 40 ms 164748 KB Output is correct
4 Correct 42 ms 164688 KB Output is correct
5 Correct 39 ms 164692 KB Output is correct
6 Correct 43 ms 164516 KB Output is correct
7 Correct 38 ms 164760 KB Output is correct
8 Correct 42 ms 164688 KB Output is correct
9 Correct 39 ms 164700 KB Output is correct
10 Correct 39 ms 164592 KB Output is correct
11 Correct 37 ms 164588 KB Output is correct
12 Correct 37 ms 164700 KB Output is correct
13 Correct 36 ms 164692 KB Output is correct
14 Correct 34 ms 164432 KB Output is correct
15 Correct 33 ms 164432 KB Output is correct
16 Correct 39 ms 164780 KB Output is correct
17 Correct 38 ms 164700 KB Output is correct
18 Correct 43 ms 164768 KB Output is correct
19 Correct 34 ms 164528 KB Output is correct
20 Correct 40 ms 164696 KB Output is correct
21 Correct 40 ms 164776 KB Output is correct
22 Correct 48 ms 164780 KB Output is correct
23 Correct 34 ms 164444 KB Output is correct
24 Correct 35 ms 164464 KB Output is correct
25 Correct 42 ms 164584 KB Output is correct
26 Correct 36 ms 164688 KB Output is correct
27 Correct 39 ms 164696 KB Output is correct
28 Correct 34 ms 164496 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164400 KB Output is correct
2 Correct 34 ms 164612 KB Output is correct
3 Correct 40 ms 164748 KB Output is correct
4 Correct 42 ms 164688 KB Output is correct
5 Correct 39 ms 164692 KB Output is correct
6 Correct 43 ms 164516 KB Output is correct
7 Correct 38 ms 164760 KB Output is correct
8 Correct 42 ms 164688 KB Output is correct
9 Correct 39 ms 164700 KB Output is correct
10 Correct 39 ms 164592 KB Output is correct
11 Correct 37 ms 164588 KB Output is correct
12 Correct 37 ms 164700 KB Output is correct
13 Correct 36 ms 164692 KB Output is correct
14 Correct 34 ms 164432 KB Output is correct
15 Correct 33 ms 164432 KB Output is correct
16 Correct 39 ms 164780 KB Output is correct
17 Correct 38 ms 164700 KB Output is correct
18 Correct 43 ms 164768 KB Output is correct
19 Correct 34 ms 164528 KB Output is correct
20 Correct 40 ms 164696 KB Output is correct
21 Correct 40 ms 164776 KB Output is correct
22 Correct 48 ms 164780 KB Output is correct
23 Correct 34 ms 164444 KB Output is correct
24 Correct 35 ms 164464 KB Output is correct
25 Correct 42 ms 164584 KB Output is correct
26 Correct 36 ms 164688 KB Output is correct
27 Correct 39 ms 164696 KB Output is correct
28 Correct 34 ms 164496 KB Output is correct
29 Correct 41 ms 164688 KB Output is correct
30 Correct 42 ms 164688 KB Output is correct
31 Correct 41 ms 164700 KB Output is correct
32 Correct 41 ms 164584 KB Output is correct
33 Correct 39 ms 164688 KB Output is correct
34 Correct 42 ms 164616 KB Output is correct
35 Correct 41 ms 164688 KB Output is correct
36 Correct 45 ms 164700 KB Output is correct
37 Correct 41 ms 164896 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164400 KB Output is correct
2 Correct 34 ms 164612 KB Output is correct
3 Correct 40 ms 164748 KB Output is correct
4 Correct 42 ms 164688 KB Output is correct
5 Correct 39 ms 164692 KB Output is correct
6 Correct 43 ms 164516 KB Output is correct
7 Correct 38 ms 164760 KB Output is correct
8 Correct 42 ms 164688 KB Output is correct
9 Correct 39 ms 164700 KB Output is correct
10 Correct 39 ms 164592 KB Output is correct
11 Correct 37 ms 164588 KB Output is correct
12 Correct 37 ms 164700 KB Output is correct
13 Correct 36 ms 164692 KB Output is correct
14 Correct 34 ms 164432 KB Output is correct
15 Correct 33 ms 164432 KB Output is correct
16 Correct 39 ms 164780 KB Output is correct
17 Correct 38 ms 164700 KB Output is correct
18 Correct 43 ms 164768 KB Output is correct
19 Correct 34 ms 164528 KB Output is correct
20 Correct 40 ms 164696 KB Output is correct
21 Correct 40 ms 164776 KB Output is correct
22 Correct 48 ms 164780 KB Output is correct
23 Correct 34 ms 164444 KB Output is correct
24 Correct 35 ms 164464 KB Output is correct
25 Correct 42 ms 164584 KB Output is correct
26 Correct 36 ms 164688 KB Output is correct
27 Correct 39 ms 164696 KB Output is correct
28 Correct 34 ms 164496 KB Output is correct
29 Correct 41 ms 164688 KB Output is correct
30 Correct 42 ms 164688 KB Output is correct
31 Correct 41 ms 164700 KB Output is correct
32 Correct 41 ms 164584 KB Output is correct
33 Correct 39 ms 164688 KB Output is correct
34 Correct 42 ms 164616 KB Output is correct
35 Correct 41 ms 164688 KB Output is correct
36 Correct 45 ms 164700 KB Output is correct
37 Correct 41 ms 164896 KB Output is correct
38 Correct 244 ms 193400 KB Output is correct
39 Correct 428 ms 710480 KB Output is correct
40 Correct 267 ms 193616 KB Output is correct
41 Correct 281 ms 193608 KB Output is correct
42 Correct 249 ms 193420 KB Output is correct
43 Correct 235 ms 193020 KB Output is correct
44 Correct 81 ms 169812 KB Output is correct
45 Correct 391 ms 701268 KB Output is correct
46 Correct 392 ms 701252 KB Output is correct
47 Correct 353 ms 705876 KB Output is correct
48 Correct 365 ms 705808 KB Output is correct
49 Correct 376 ms 701536 KB Output is correct
50 Correct 369 ms 701336 KB Output is correct
51 Correct 368 ms 702648 KB Output is correct
52 Correct 378 ms 702436 KB Output is correct
53 Correct 92 ms 203564 KB Output is correct
54 Correct 374 ms 701048 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 164560 KB Output is correct
2 Correct 33 ms 164432 KB Output is correct
3 Correct 34 ms 164616 KB Output is correct
4 Correct 34 ms 164444 KB Output is correct
5 Correct 58 ms 164704 KB Output is correct
6 Correct 36 ms 164700 KB Output is correct
7 Correct 42 ms 164740 KB Output is correct
8 Correct 33 ms 164444 KB Output is correct
9 Correct 35 ms 164444 KB Output is correct
10 Correct 34 ms 164444 KB Output is correct
11 Correct 34 ms 164436 KB Output is correct
12 Correct 41 ms 164700 KB Output is correct
13 Correct 140 ms 165184 KB Output is correct
14 Correct 207 ms 165592 KB Output is correct
15 Correct 167 ms 165204 KB Output is correct
16 Correct 500 ms 704820 KB Output is correct
17 Correct 1113 ms 728504 KB Output is correct
18 Correct 1823 ms 764316 KB Output is correct
19 Correct 619 ms 708948 KB Output is correct
20 Correct 645 ms 708800 KB Output is correct
21 Correct 630 ms 708952 KB Output is correct
22 Correct 1103 ms 724372 KB Output is correct
23 Correct 752 ms 723080 KB Output is correct
24 Correct 813 ms 723272 KB Output is correct
25 Correct 814 ms 723128 KB Output is correct
26 Correct 837 ms 723884 KB Output is correct
27 Correct 1098 ms 739480 KB Output is correct
28 Correct 1104 ms 743940 KB Output is correct
29 Correct 1163 ms 733752 KB Output is correct
30 Correct 809 ms 723824 KB Output is correct
31 Correct 825 ms 726072 KB Output is correct
32 Correct 851 ms 722552 KB Output is correct
33 Correct 866 ms 725176 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 164444 KB Output is correct
2 Correct 33 ms 164696 KB Output is correct
3 Correct 34 ms 164500 KB Output is correct
4 Correct 85 ms 164436 KB Output is correct
5 Correct 169 ms 165432 KB Output is correct
6 Correct 39 ms 164772 KB Output is correct
7 Correct 40 ms 164772 KB Output is correct
8 Correct 42 ms 164844 KB Output is correct
9 Correct 248 ms 192388 KB Output is correct
10 Correct 555 ms 703516 KB Output is correct
11 Correct 58 ms 164708 KB Output is correct
12 Correct 197 ms 165608 KB Output is correct
13 Correct 643 ms 714872 KB Output is correct
14 Correct 623 ms 715276 KB Output is correct
15 Correct 1112 ms 731316 KB Output is correct
16 Correct 2016 ms 783684 KB Output is correct
17 Correct 705 ms 738948 KB Output is correct
18 Correct 643 ms 740520 KB Output is correct
19 Correct 659 ms 734032 KB Output is correct
20 Correct 731 ms 734028 KB Output is correct
21 Correct 714 ms 736080 KB Output is correct
22 Correct 533 ms 718504 KB Output is correct
23 Correct 34 ms 164400 KB Output is correct
24 Correct 34 ms 164612 KB Output is correct
25 Correct 40 ms 164748 KB Output is correct
26 Correct 42 ms 164688 KB Output is correct
27 Correct 39 ms 164692 KB Output is correct
28 Correct 43 ms 164516 KB Output is correct
29 Correct 38 ms 164760 KB Output is correct
30 Correct 42 ms 164688 KB Output is correct
31 Correct 39 ms 164700 KB Output is correct
32 Correct 39 ms 164592 KB Output is correct
33 Correct 37 ms 164588 KB Output is correct
34 Correct 37 ms 164700 KB Output is correct
35 Correct 36 ms 164692 KB Output is correct
36 Correct 34 ms 164432 KB Output is correct
37 Correct 33 ms 164432 KB Output is correct
38 Correct 39 ms 164780 KB Output is correct
39 Correct 38 ms 164700 KB Output is correct
40 Correct 43 ms 164768 KB Output is correct
41 Correct 34 ms 164528 KB Output is correct
42 Correct 40 ms 164696 KB Output is correct
43 Correct 40 ms 164776 KB Output is correct
44 Correct 48 ms 164780 KB Output is correct
45 Correct 34 ms 164444 KB Output is correct
46 Correct 35 ms 164464 KB Output is correct
47 Correct 42 ms 164584 KB Output is correct
48 Correct 36 ms 164688 KB Output is correct
49 Correct 39 ms 164696 KB Output is correct
50 Correct 34 ms 164496 KB Output is correct
51 Correct 41 ms 164688 KB Output is correct
52 Correct 42 ms 164688 KB Output is correct
53 Correct 41 ms 164700 KB Output is correct
54 Correct 41 ms 164584 KB Output is correct
55 Correct 39 ms 164688 KB Output is correct
56 Correct 42 ms 164616 KB Output is correct
57 Correct 41 ms 164688 KB Output is correct
58 Correct 45 ms 164700 KB Output is correct
59 Correct 41 ms 164896 KB Output is correct
60 Correct 244 ms 193400 KB Output is correct
61 Correct 428 ms 710480 KB Output is correct
62 Correct 267 ms 193616 KB Output is correct
63 Correct 281 ms 193608 KB Output is correct
64 Correct 249 ms 193420 KB Output is correct
65 Correct 235 ms 193020 KB Output is correct
66 Correct 81 ms 169812 KB Output is correct
67 Correct 391 ms 701268 KB Output is correct
68 Correct 392 ms 701252 KB Output is correct
69 Correct 353 ms 705876 KB Output is correct
70 Correct 365 ms 705808 KB Output is correct
71 Correct 376 ms 701536 KB Output is correct
72 Correct 369 ms 701336 KB Output is correct
73 Correct 368 ms 702648 KB Output is correct
74 Correct 378 ms 702436 KB Output is correct
75 Correct 92 ms 203564 KB Output is correct
76 Correct 374 ms 701048 KB Output is correct
77 Correct 36 ms 164560 KB Output is correct
78 Correct 33 ms 164432 KB Output is correct
79 Correct 34 ms 164616 KB Output is correct
80 Correct 34 ms 164444 KB Output is correct
81 Correct 58 ms 164704 KB Output is correct
82 Correct 36 ms 164700 KB Output is correct
83 Correct 42 ms 164740 KB Output is correct
84 Correct 33 ms 164444 KB Output is correct
85 Correct 35 ms 164444 KB Output is correct
86 Correct 34 ms 164444 KB Output is correct
87 Correct 34 ms 164436 KB Output is correct
88 Correct 41 ms 164700 KB Output is correct
89 Correct 140 ms 165184 KB Output is correct
90 Correct 207 ms 165592 KB Output is correct
91 Correct 167 ms 165204 KB Output is correct
92 Correct 500 ms 704820 KB Output is correct
93 Correct 1113 ms 728504 KB Output is correct
94 Correct 1823 ms 764316 KB Output is correct
95 Correct 619 ms 708948 KB Output is correct
96 Correct 645 ms 708800 KB Output is correct
97 Correct 630 ms 708952 KB Output is correct
98 Correct 1103 ms 724372 KB Output is correct
99 Correct 752 ms 723080 KB Output is correct
100 Correct 813 ms 723272 KB Output is correct
101 Correct 814 ms 723128 KB Output is correct
102 Correct 837 ms 723884 KB Output is correct
103 Correct 1098 ms 739480 KB Output is correct
104 Correct 1104 ms 743940 KB Output is correct
105 Correct 1163 ms 733752 KB Output is correct
106 Correct 809 ms 723824 KB Output is correct
107 Correct 825 ms 726072 KB Output is correct
108 Correct 851 ms 722552 KB Output is correct
109 Correct 866 ms 725176 KB Output is correct
110 Correct 211 ms 165716 KB Output is correct
111 Correct 145 ms 165200 KB Output is correct
112 Correct 1130 ms 740512 KB Output is correct
113 Correct 593 ms 714612 KB Output is correct
114 Correct 843 ms 725504 KB Output is correct
115 Correct 343 ms 701728 KB Output is correct
116 Correct 727 ms 712952 KB Output is correct
117 Correct 2485 ms 785584 KB Output is correct
118 Correct 436 ms 701316 KB Output is correct
119 Correct 406 ms 701472 KB Output is correct
120 Correct 75 ms 212304 KB Output is correct
121 Correct 806 ms 714892 KB Output is correct
122 Correct 827 ms 714728 KB Output is correct
123 Correct 667 ms 718436 KB Output is correct
124 Correct 632 ms 718160 KB Output is correct
125 Correct 652 ms 719464 KB Output is correct
126 Correct 1983 ms 784796 KB Output is correct
127 Correct 1038 ms 743180 KB Output is correct
128 Correct 757 ms 744104 KB Output is correct
129 Correct 727 ms 741284 KB Output is correct
130 Correct 809 ms 743388 KB Output is correct