oj.uz

답안 #927647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927647 2024-02-15T08:11:25 Z andrei_boaca Jail (JOI22_jail) C++17
100 / 100
 4442 ms 180380 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
int t,n,m,A[120005],B[120005],in[120005],out[120005],timp,par[120005],niv[120005],dp[21][120005],nr[120005];
bool isheavy[120005];
vector<int> muchii[120005];
vector<vector<int>> v;
vector<set<pii>> suf,active;
set<pii> vtm;
vector<vector<set<int>>> arb;
vector<int> tati;
vector<set<int>> emp;
int where[120005],poz[120005];
vector<int> stiva;
bool use[120005];
bool isancestor(int a,int b)
{
    return in[a]<=in[b]&&out[a]>=out[b];
}
int LCA(int a,int b)
{
    if(niv[a]>niv[b])
        swap(a,b);
    if(isancestor(a,b))
        return a;
    for(int i=18;i>=0;i--)
        if(dp[i][a]!=0&&!isancestor(dp[i][a],b))
            a=dp[i][a];
    return par[a];
}
int dist(int a,int b)
{
    int lca=LCA(a,b);
    return niv[a]+niv[b]-2*niv[lca];
}
void initdfs(int nod)
{
    nr[nod]=1;
    timp++;
    in[nod]=timp;
    dp[0][nod]=par[nod];
    for(int i=1;i<=18;i++)
        dp[i][nod]=dp[i-1][dp[i-1][nod]];
    int who=0,maxim=0;
    for(int i:muchii[nod])
        if(i!=par[nod])
        {
            par[i]=nod;
            niv[i]=niv[nod]+1;
            initdfs(i);
            nr[nod]+=nr[i];
            if(nr[i]>maxim)
            {
                maxim=nr[i];
                who=i;
            }
        }
    if(who!=0)
        isheavy[who]=1;
    out[nod]=timp;
}
void buildhld()
{
    for(int i=1;i<=n;i++)
    {
        bool ok=1;
        for(int j:muchii[i])
            if(j!=par[i]&&isheavy[j])
            {
                ok=0;
                break;
            }
        if(ok)
        {
            vector<int> nodes;
            int nod=i;
            while(true)
            {
                nodes.push_back(nod);
                if(!isheavy[nod])
                    break;
                nod=par[nod];
            }
            for(int i=0;i<nodes.size();i++)
            {
                where[nodes[i]]=v.size();
                poz[nodes[i]]=i;
            }
            v.push_back(nodes);
            arb.push_back(emp);
            suf.push_back(vtm);
            active.push_back(vtm);
            int lg=arb.size();
            lg--;
            arb[lg].resize(5*(int)nodes.size()+5);
        }
    }
}
void addnode(int nod,int ind,int add)
{
    int chain=where[nod];
    int p=poz[nod];
    if(add==1)
        active[chain].insert({p,ind});
    else if(active[chain].find({p,ind})!=active[chain].end())
        active[chain].erase({p,ind});
    else
        assert(false);
}
void update(int chain,int nod,int st,int dr,int a,int b,int val,int add)
{
    assert(nod<arb[chain].size());
    if(st>=a&&dr<=b)
    {
        if(add==1)
            arb[chain][nod].insert(val);
        else if(arb[chain][nod].find(val)!=arb[chain][nod].end())
            arb[chain][nod].erase(val);
        else
            assert(false);
        return;
    }
    int mij=(st+dr)/2;
    if(a<=mij)
        update(chain,nod*2,st,mij,a,b,val,add);
    if(b>mij)
        update(chain,nod*2+1,mij+1,dr,a,b,val,add);
}
void query(int chain,int nod,int st,int dr,int p)
{
    assert(nod<arb[chain].size());
    tati.push_back(nod);
    if(st==dr)
        return;
    int mij=(st+dr)/2;
    if(p<=mij)
        query(chain,nod*2,st,mij,p);
    if(p>mij)
        query(chain,nod*2+1,mij+1,dr,p);
}
void addseg(int a,int b,int ind,int add)
{
    int lca=LCA(a,b);
    while(niv[a]>=niv[lca])
    {
        int p=poz[a];
        int chain=where[a];
        int last=v[chain].size();
        last--;
        if(where[a]==where[lca])
            last=poz[lca];
        if(p<=last)
        {
            if(last!=(int)v[chain].size()-1)
            {
                bool ok=0;
                if(ind==2)
                    ok=1;
                update(chain,1,0,(int)v[chain].size()-1,p,last,ind,add);
            }
            else
            {
                pii x={p,ind};
                if(add==1)
                    suf[chain].insert(x);
                else if(suf[chain].find(x)!=suf[chain].end())
                    suf[chain].erase(x);
                else
                    assert(false);
            }
        }
        a=par[v[chain][last]];
    }

    while(niv[b]>niv[lca])
    {
        int p=poz[b];
        int chain=where[b];
        int last=v[chain].size();
        last--;
        if(where[b]==where[lca])
            last=poz[lca]-1;
        if(p<=last)
        {
            if(last!=(int)v[chain].size()-1)
                update(chain,1,0,(int)v[chain].size()-1,p,last,ind,add);
            else
            {
                pii x={p,ind};
                if(add==1)
                    suf[chain].insert(x);
                else if(suf[chain].find(x)!=suf[chain].end())
                    suf[chain].erase(x);
                else
                    assert(false);
            }
        }
        b=par[v[chain][last]];
    }
}
void dfs1(int nod)
{
    use[nod]=1;
    addseg(A[nod],B[nod],nod,-1);
    addnode(B[nod],nod,-1);
    int chain=where[A[nod]];
    int p=poz[A[nod]];
    while(!suf[chain].empty())
    {
        auto it=suf[chain].upper_bound({p,1e9});
        if(it==suf[chain].begin())
            break;
        it=prev(it);
        int x=(*it).second;
        dfs1(x);
    }
    tati.clear();
    query(chain,1,0,v[chain].size()-1,p);
    vector<int> aux=tati;
    for(int x:aux)
    {
        while(!arb[chain][x].empty())
        {
            int y=*arb[chain][x].begin();
            dfs1(y);
        }
    }
    int a=A[nod];
    int b=B[nod];
    int lca=LCA(a,b);
    while(a!=0&&niv[a]>=niv[lca])
    {
        p=poz[a];
        chain=where[a];
        int last=v[chain].size();
        last--;
        if(where[a]==where[lca])
            last=poz[lca];
        while(!active[chain].empty())
        {
            auto it=active[chain].lower_bound({p,0});
            if(it==active[chain].end())
                break;
            if((*it).first>last)
                break;
            int x=(*it).second;
            dfs1(x);
        }
        a=par[v[chain][last]];
    }
    while(b!=0&&niv[b]>niv[lca])
    {
        p=poz[b];
        chain=where[b];
        int last=v[chain].size();
        last--;
        if(where[b]==where[lca])
            last=poz[lca]-1;
        while(!active[chain].empty())
        {
            auto it=active[chain].lower_bound({p,0});
            if(it==active[chain].end())
                break;
            if((*it).first>last)
                break;
            int x=(*it).second;
            dfs1(x);
        }
        b=par[v[chain][last]];
    }
    stiva.push_back(nod);
}
bool bad=0;
void dfs2(int nod)
{
    if(bad)
        return;
    use[nod]=1;
    addseg(A[nod],B[nod],nod,-1);
    addnode(A[nod],nod,-1);
    int chain=where[B[nod]];
    int p=poz[B[nod]];
    while(!suf[chain].empty())
    {
        auto it=suf[chain].upper_bound({p,1e9});
        if(it==suf[chain].begin())
            break;
        it=prev(it);
        int x=(*it).second;
        bad=1;
        return;
        dfs2(x);
    }
    tati.clear();
    query(chain,1,0,v[chain].size()-1,p);
    for(int x:tati)
    {
        while(!arb[chain][x].empty())
        {
            int y=*arb[chain][x].begin();
            bad=1;
            return;
            dfs2(y);
        }
    }
    int a=A[nod];
    int b=B[nod];
    int lca=LCA(a,b);
    while(a!=0&&niv[a]>=niv[lca])
    {
        p=poz[a];
        chain=where[a];
        int last=v[chain].size();
        last--;
        if(where[a]==where[lca])
            last=poz[lca];
        while(!active[chain].empty())
        {
            auto it=active[chain].lower_bound({p,0});
            if(it==active[chain].end())
                break;
            if((*it).first>last)
                break;
            int x=(*it).second;
            bad=1;
            return;
            dfs2(x);
        }
        a=par[v[chain][last]];
    }
    while(b!=0&&niv[b]>niv[lca])
    {
        p=poz[b];
        chain=where[b];
        int last=v[chain].size();
        last--;
        if(where[b]==where[lca])
            last=poz[lca]-1;
        while(!active[chain].empty())
        {
            auto it=active[chain].lower_bound({p,0});
            if(it==active[chain].end())
                break;
            if((*it).first>last)
                break;
            int x=(*it).second;
            bad=1;
            return;
            dfs2(x);
        }
        b=par[v[chain][last]];
    }
}
bool onchain(int x,int a,int b)
{
    return dist(a,x)+dist(x,b)==dist(a,b);
}
int curtest=0;
void solve()
{
    curtest++;
    cin>>n;
    timp=0;
    v.clear();
    suf.clear();
    active.clear();
    arb.clear();
    arb.shrink_to_fit();
    timp=0;
    for(int i=1;i<=n;i++)
    {
        muchii[i].clear();
        isheavy[i]=0;
    }
    for(int i=1;i<n;i++)
    {
        int a,b;
        cin>>a>>b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    niv[1]=1;
    par[1]=0;
    initdfs(1);
    cin>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>A[i]>>B[i];
        use[i]=0;
    }
    buildhld();
    stiva.clear();
    for(int i=1;i<=m;i++)
    {
        addseg(A[i],B[i],i,+1);
        addnode(B[i],i,+1);
    }
    for(int i=1;i<=m;i++)
        if(!use[i])
            dfs1(i);
    reverse(stiva.begin(),stiva.end());
    for(int i=1;i<=m;i++)
    {
        use[i]=0;
        addseg(A[i],B[i],i,+1);
        addnode(A[i],i,+1);
    }
    int nrcomp=0;
    bad=0;
    for(int i:stiva)
    {
        if(!use[i])
            dfs2(i);
        if(bad)
        {
            cout<<"No\n";
            return;
        }
    }
    cout<<"Yes\n";
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>t;
    while(t--)
        solve();
    return 0;
}

Compilation message

jail.cpp: In function 'void buildhld()':
jail.cpp:85:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             for(int i=0;i<nodes.size();i++)
      |                         ~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from jail.cpp:1:
jail.cpp: In function 'void update(int, int, int, int, int, int, int, int)':
jail.cpp:113:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     assert(nod<arb[chain].size());
      |            ~~~^~~~~~~~~~~~~~~~~~
jail.cpp: In function 'void query(int, int, int, int, int)':
jail.cpp:132:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     assert(nod<arb[chain].size());
      |            ~~~^~~~~~~~~~~~~~~~~~
jail.cpp: In function 'void addseg(int, int, int, int)':
jail.cpp:157:22: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  157 |                 bool ok=0;
      |                      ^~
jail.cpp: In function 'void solve()':
jail.cpp:409:9: warning: unused variable 'nrcomp' [-Wunused-variable]
  409 |     int nrcomp=0;
      |         ^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16732 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 14 ms 16928 KB Output is correct
5 Correct 23 ms 16728 KB Output is correct
6 Correct 3 ms 16884 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 6 ms 17020 KB Output is correct
9 Correct 51 ms 19384 KB Output is correct
10 Correct 52 ms 61172 KB Output is correct
11 Correct 13 ms 16900 KB Output is correct
12 Correct 78 ms 16956 KB Output is correct
13 Correct 207 ms 80624 KB Output is correct
14 Correct 170 ms 79612 KB Output is correct
15 Correct 921 ms 99628 KB Output is correct
16 Correct 2932 ms 158088 KB Output is correct
17 Correct 464 ms 111620 KB Output is correct
18 Correct 297 ms 78952 KB Output is correct
19 Correct 413 ms 106736 KB Output is correct
20 Correct 415 ms 106928 KB Output is correct
21 Correct 477 ms 110068 KB Output is correct
22 Correct 134 ms 69360 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16868 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16868 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 2 ms 16732 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16812 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 4 ms 17040 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 2 ms 16732 KB Output is correct
24 Correct 3 ms 16884 KB Output is correct
25 Correct 3 ms 16988 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16868 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 2 ms 16732 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16812 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 4 ms 17040 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 2 ms 16732 KB Output is correct
24 Correct 3 ms 16884 KB Output is correct
25 Correct 3 ms 16988 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 6 ms 16988 KB Output is correct
30 Correct 6 ms 16988 KB Output is correct
31 Correct 7 ms 16988 KB Output is correct
32 Correct 6 ms 16988 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 9 ms 17064 KB Output is correct
36 Correct 6 ms 16988 KB Output is correct
37 Correct 5 ms 16988 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16868 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 2 ms 16732 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16812 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 4 ms 17040 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 2 ms 16732 KB Output is correct
24 Correct 3 ms 16884 KB Output is correct
25 Correct 3 ms 16988 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 6 ms 16988 KB Output is correct
30 Correct 6 ms 16988 KB Output is correct
31 Correct 7 ms 16988 KB Output is correct
32 Correct 6 ms 16988 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 9 ms 17064 KB Output is correct
36 Correct 6 ms 16988 KB Output is correct
37 Correct 5 ms 16988 KB Output is correct
38 Correct 52 ms 19396 KB Output is correct
39 Correct 45 ms 61168 KB Output is correct
40 Correct 72 ms 20820 KB Output is correct
41 Correct 79 ms 20060 KB Output is correct
42 Correct 65 ms 21560 KB Output is correct
43 Correct 33 ms 19548 KB Output is correct
44 Correct 38 ms 17500 KB Output is correct
45 Correct 87 ms 67868 KB Output is correct
46 Correct 85 ms 68060 KB Output is correct
47 Correct 66 ms 70880 KB Output is correct
48 Correct 65 ms 69916 KB Output is correct
49 Correct 78 ms 68124 KB Output is correct
50 Correct 77 ms 69408 KB Output is correct
51 Correct 65 ms 69584 KB Output is correct
52 Correct 68 ms 69136 KB Output is correct
53 Correct 24 ms 20988 KB Output is correct
54 Correct 111 ms 72664 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16732 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 15 ms 16728 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 3 ms 16868 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16864 KB Output is correct
12 Correct 6 ms 16988 KB Output is correct
13 Correct 63 ms 16968 KB Output is correct
14 Correct 89 ms 16988 KB Output is correct
15 Correct 88 ms 16992 KB Output is correct
16 Correct 242 ms 87992 KB Output is correct
17 Correct 1241 ms 120076 KB Output is correct
18 Correct 2707 ms 158680 KB Output is correct
19 Correct 396 ms 92256 KB Output is correct
20 Correct 429 ms 94280 KB Output is correct
21 Correct 441 ms 92652 KB Output is correct
22 Correct 1132 ms 117596 KB Output is correct
23 Correct 592 ms 118400 KB Output is correct
24 Correct 729 ms 116960 KB Output is correct
25 Correct 774 ms 119268 KB Output is correct
26 Correct 822 ms 121528 KB Output is correct
27 Correct 930 ms 128280 KB Output is correct
28 Correct 712 ms 139416 KB Output is correct
29 Correct 693 ms 132252 KB Output is correct
30 Correct 443 ms 92756 KB Output is correct
31 Correct 381 ms 94216 KB Output is correct
32 Correct 478 ms 90456 KB Output is correct
33 Correct 418 ms 93820 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16732 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 14 ms 16928 KB Output is correct
5 Correct 23 ms 16728 KB Output is correct
6 Correct 3 ms 16884 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 6 ms 17020 KB Output is correct
9 Correct 51 ms 19384 KB Output is correct
10 Correct 52 ms 61172 KB Output is correct
11 Correct 13 ms 16900 KB Output is correct
12 Correct 78 ms 16956 KB Output is correct
13 Correct 207 ms 80624 KB Output is correct
14 Correct 170 ms 79612 KB Output is correct
15 Correct 921 ms 99628 KB Output is correct
16 Correct 2932 ms 158088 KB Output is correct
17 Correct 464 ms 111620 KB Output is correct
18 Correct 297 ms 78952 KB Output is correct
19 Correct 413 ms 106736 KB Output is correct
20 Correct 415 ms 106928 KB Output is correct
21 Correct 477 ms 110068 KB Output is correct
22 Correct 134 ms 69360 KB Output is correct
23 Correct 2 ms 16728 KB Output is correct
24 Correct 3 ms 16732 KB Output is correct
25 Correct 3 ms 16732 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 16868 KB Output is correct
29 Correct 3 ms 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16988 KB Output is correct
33 Correct 3 ms 16988 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 16988 KB Output is correct
36 Correct 2 ms 16732 KB Output is correct
37 Correct 3 ms 16732 KB Output is correct
38 Correct 3 ms 16812 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 3 ms 16732 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 4 ms 17040 KB Output is correct
44 Correct 4 ms 16988 KB Output is correct
45 Correct 2 ms 16732 KB Output is correct
46 Correct 3 ms 16884 KB Output is correct
47 Correct 3 ms 16988 KB Output is correct
48 Correct 3 ms 16732 KB Output is correct
49 Correct 4 ms 16988 KB Output is correct
50 Correct 2 ms 16732 KB Output is correct
51 Correct 6 ms 16988 KB Output is correct
52 Correct 6 ms 16988 KB Output is correct
53 Correct 7 ms 16988 KB Output is correct
54 Correct 6 ms 16988 KB Output is correct
55 Correct 4 ms 16988 KB Output is correct
56 Correct 8 ms 16988 KB Output is correct
57 Correct 9 ms 17064 KB Output is correct
58 Correct 6 ms 16988 KB Output is correct
59 Correct 5 ms 16988 KB Output is correct
60 Correct 52 ms 19396 KB Output is correct
61 Correct 45 ms 61168 KB Output is correct
62 Correct 72 ms 20820 KB Output is correct
63 Correct 79 ms 20060 KB Output is correct
64 Correct 65 ms 21560 KB Output is correct
65 Correct 33 ms 19548 KB Output is correct
66 Correct 38 ms 17500 KB Output is correct
67 Correct 87 ms 67868 KB Output is correct
68 Correct 85 ms 68060 KB Output is correct
69 Correct 66 ms 70880 KB Output is correct
70 Correct 65 ms 69916 KB Output is correct
71 Correct 78 ms 68124 KB Output is correct
72 Correct 77 ms 69408 KB Output is correct
73 Correct 65 ms 69584 KB Output is correct
74 Correct 68 ms 69136 KB Output is correct
75 Correct 24 ms 20988 KB Output is correct
76 Correct 111 ms 72664 KB Output is correct
77 Correct 2 ms 16732 KB Output is correct
78 Correct 2 ms 16732 KB Output is correct
79 Correct 3 ms 16732 KB Output is correct
80 Correct 2 ms 16732 KB Output is correct
81 Correct 15 ms 16728 KB Output is correct
82 Correct 3 ms 16988 KB Output is correct
83 Correct 3 ms 16988 KB Output is correct
84 Correct 3 ms 16868 KB Output is correct
85 Correct 3 ms 16732 KB Output is correct
86 Correct 3 ms 16732 KB Output is correct
87 Correct 3 ms 16864 KB Output is correct
88 Correct 6 ms 16988 KB Output is correct
89 Correct 63 ms 16968 KB Output is correct
90 Correct 89 ms 16988 KB Output is correct
91 Correct 88 ms 16992 KB Output is correct
92 Correct 242 ms 87992 KB Output is correct
93 Correct 1241 ms 120076 KB Output is correct
94 Correct 2707 ms 158680 KB Output is correct
95 Correct 396 ms 92256 KB Output is correct
96 Correct 429 ms 94280 KB Output is correct
97 Correct 441 ms 92652 KB Output is correct
98 Correct 1132 ms 117596 KB Output is correct
99 Correct 592 ms 118400 KB Output is correct
100 Correct 729 ms 116960 KB Output is correct
101 Correct 774 ms 119268 KB Output is correct
102 Correct 822 ms 121528 KB Output is correct
103 Correct 930 ms 128280 KB Output is correct
104 Correct 712 ms 139416 KB Output is correct
105 Correct 693 ms 132252 KB Output is correct
106 Correct 443 ms 92756 KB Output is correct
107 Correct 381 ms 94216 KB Output is correct
108 Correct 478 ms 90456 KB Output is correct
109 Correct 418 ms 93820 KB Output is correct
110 Correct 82 ms 16984 KB Output is correct
111 Correct 43 ms 16984 KB Output is correct
112 Correct 1539 ms 118068 KB Output is correct
113 Correct 541 ms 86460 KB Output is correct
114 Correct 841 ms 113776 KB Output is correct
115 Correct 86 ms 100996 KB Output is correct
116 Correct 496 ms 103420 KB Output is correct
117 Correct 4442 ms 180380 KB Output is correct
118 Correct 107 ms 74008 KB Output is correct
119 Correct 103 ms 74072 KB Output is correct
120 Correct 24 ms 23504 KB Output is correct
121 Correct 696 ms 100860 KB Output is correct
122 Correct 712 ms 98800 KB Output is correct
123 Correct 643 ms 91428 KB Output is correct
124 Correct 528 ms 91432 KB Output is correct
125 Correct 707 ms 94088 KB Output is correct
126 Correct 3860 ms 174716 KB Output is correct
127 Correct 1800 ms 138232 KB Output is correct
128 Correct 1106 ms 138380 KB Output is correct
129 Correct 748 ms 134536 KB Output is correct
130 Correct 1132 ms 138252 KB Output is correct