Submission #877934

# Submission time Handle Problem Language Result Execution time Memory
877934 2023-11-23T22:21:04 Z vivkostov Jail (JOI22_jail) C++14
21 / 100
149 ms 199284 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);
}
int q,n,m,c,d,a[200005],b[200005],child[200005],machild[200005],used[200005],up[200005],bin[200005][30],level[200005],usedl[200005];
vector<int>v[200005],p[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]);
        }
    }
}
int in;
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<=20;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=20;i>=0;i--)
    {
        if(level[bin[y][i]]>=level[x])y=bin[y][i];
    }
    if(x==y)return x;
    for(int i=20;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_heavy1(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_heavy1(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 go_up_heavy2(int beg,int lc,int prisoner)
{
    if(beg==lc)return;
    if(level[up[beg]]==level[lc])
    {
        update(1,n,used[up[beg]]+1,used[beg],1,prisoner,3);
        update(1,n,used[up[beg]]+1,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_heavy2(bin[up[beg]][0],lc,prisoner);
        return;
    }
    update(1,n,used[lc]+1,used[beg],1,prisoner,3);
    update(1,n,used[lc]+1,used[beg],1,prisoner,4);
}
void add_path()
{
    for(int i=1;i<=m;i++)
    {
        int g=lca(a[i],b[i]);
        go_up_heavy1(a[i],g,i);
        go_up_heavy2(b[i],g,i);
    }
}
int brr,brj;
void fill_cycle(int beg)
{
    usedl[beg]=2;
    int w;
    for(int i=0; i<p[beg].size(); i++)
    {
        w=p[beg][i];
        if(usedl[w]!=2)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);
    }
    if(usedl[beg]!=2&&beg<=m)
    {
        fill_cycle(beg);
        brr++;
    }
}
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<=m;i++)
    {
        if(!usedl[i])find_cycle(i);
    }
    /*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!=m)cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    for(int i=0;i<=n*10;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;
        v[i].clear();
        for(int j=0;j<=20;j++)bin[i][j]=0;
    }
    for(int i=0;i<=10*n;i++)p[i].clear();
    in=0;
    brr=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:18:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp: In function 'void heavylight(int, int)':
jail.cpp:36:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i=0;i<v[beg].size();i++)
      |                 ~^~~~~~~~~~~~~~
jail.cpp:35:11: warning: unused variable 'ma' [-Wunused-variable]
   35 |     int w,ma=0;
      |           ^~
jail.cpp: In function 'void fill_cycle(int)':
jail.cpp:171:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  171 |     for(int i=0; i<p[beg].size(); i++)
      |                  ~^~~~~~~~~~~~~~
jail.cpp: In function 'void find_cycle(int)':
jail.cpp:181:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |     for(int i=0; i<p[beg].size(); i++)
      |                  ~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 21 ms 57944 KB Output is correct
2 Correct 13 ms 57944 KB Output is correct
3 Correct 12 ms 57948 KB Output is correct
4 Correct 27 ms 58108 KB Output is correct
5 Correct 45 ms 58708 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 14 ms 57948 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 75 ms 69376 KB Output is correct
10 Runtime error 149 ms 199284 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 12 ms 57948 KB Output is correct
2 Correct 12 ms 57948 KB Output is correct
3 Correct 14 ms 57948 KB Output is correct
4 Correct 14 ms 58120 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 16 ms 58180 KB Output is correct
8 Correct 17 ms 57948 KB Output is correct
9 Correct 14 ms 57944 KB Output is correct
10 Correct 14 ms 57980 KB Output is correct
11 Correct 16 ms 57996 KB Output is correct
12 Correct 13 ms 57948 KB Output is correct
13 Correct 13 ms 57948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 57948 KB Output is correct
2 Correct 12 ms 57948 KB Output is correct
3 Correct 14 ms 57948 KB Output is correct
4 Correct 14 ms 58120 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 16 ms 58180 KB Output is correct
8 Correct 17 ms 57948 KB Output is correct
9 Correct 14 ms 57944 KB Output is correct
10 Correct 14 ms 57980 KB Output is correct
11 Correct 16 ms 57996 KB Output is correct
12 Correct 13 ms 57948 KB Output is correct
13 Correct 13 ms 57948 KB Output is correct
14 Correct 13 ms 58028 KB Output is correct
15 Correct 13 ms 57948 KB Output is correct
16 Correct 16 ms 57948 KB Output is correct
17 Correct 14 ms 57944 KB Output is correct
18 Correct 15 ms 58184 KB Output is correct
19 Correct 13 ms 58096 KB Output is correct
20 Correct 14 ms 58100 KB Output is correct
21 Correct 14 ms 58048 KB Output is correct
22 Correct 14 ms 57948 KB Output is correct
23 Correct 13 ms 58200 KB Output is correct
24 Correct 15 ms 58128 KB Output is correct
25 Correct 18 ms 57948 KB Output is correct
26 Correct 14 ms 57944 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 13 ms 57944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 57948 KB Output is correct
2 Correct 12 ms 57948 KB Output is correct
3 Correct 14 ms 57948 KB Output is correct
4 Correct 14 ms 58120 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 16 ms 58180 KB Output is correct
8 Correct 17 ms 57948 KB Output is correct
9 Correct 14 ms 57944 KB Output is correct
10 Correct 14 ms 57980 KB Output is correct
11 Correct 16 ms 57996 KB Output is correct
12 Correct 13 ms 57948 KB Output is correct
13 Correct 13 ms 57948 KB Output is correct
14 Correct 13 ms 58028 KB Output is correct
15 Correct 13 ms 57948 KB Output is correct
16 Correct 16 ms 57948 KB Output is correct
17 Correct 14 ms 57944 KB Output is correct
18 Correct 15 ms 58184 KB Output is correct
19 Correct 13 ms 58096 KB Output is correct
20 Correct 14 ms 58100 KB Output is correct
21 Correct 14 ms 58048 KB Output is correct
22 Correct 14 ms 57948 KB Output is correct
23 Correct 13 ms 58200 KB Output is correct
24 Correct 15 ms 58128 KB Output is correct
25 Correct 18 ms 57948 KB Output is correct
26 Correct 14 ms 57944 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 13 ms 57944 KB Output is correct
29 Correct 16 ms 58200 KB Output is correct
30 Correct 16 ms 58204 KB Output is correct
31 Correct 15 ms 58200 KB Output is correct
32 Correct 15 ms 58092 KB Output is correct
33 Correct 14 ms 57944 KB Output is correct
34 Correct 17 ms 57992 KB Output is correct
35 Correct 16 ms 58212 KB Output is correct
36 Correct 15 ms 58028 KB Output is correct
37 Incorrect 15 ms 58176 KB Output isn't correct
38 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 12 ms 57948 KB Output is correct
2 Correct 12 ms 57948 KB Output is correct
3 Correct 14 ms 57948 KB Output is correct
4 Correct 14 ms 58120 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 16 ms 58180 KB Output is correct
8 Correct 17 ms 57948 KB Output is correct
9 Correct 14 ms 57944 KB Output is correct
10 Correct 14 ms 57980 KB Output is correct
11 Correct 16 ms 57996 KB Output is correct
12 Correct 13 ms 57948 KB Output is correct
13 Correct 13 ms 57948 KB Output is correct
14 Correct 13 ms 58028 KB Output is correct
15 Correct 13 ms 57948 KB Output is correct
16 Correct 16 ms 57948 KB Output is correct
17 Correct 14 ms 57944 KB Output is correct
18 Correct 15 ms 58184 KB Output is correct
19 Correct 13 ms 58096 KB Output is correct
20 Correct 14 ms 58100 KB Output is correct
21 Correct 14 ms 58048 KB Output is correct
22 Correct 14 ms 57948 KB Output is correct
23 Correct 13 ms 58200 KB Output is correct
24 Correct 15 ms 58128 KB Output is correct
25 Correct 18 ms 57948 KB Output is correct
26 Correct 14 ms 57944 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 13 ms 57944 KB Output is correct
29 Correct 16 ms 58200 KB Output is correct
30 Correct 16 ms 58204 KB Output is correct
31 Correct 15 ms 58200 KB Output is correct
32 Correct 15 ms 58092 KB Output is correct
33 Correct 14 ms 57944 KB Output is correct
34 Correct 17 ms 57992 KB Output is correct
35 Correct 16 ms 58212 KB Output is correct
36 Correct 15 ms 58028 KB Output is correct
37 Incorrect 15 ms 58176 KB Output isn't correct
38 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 12 ms 57944 KB Output is correct
2 Correct 13 ms 57944 KB Output is correct
3 Correct 12 ms 57948 KB Output is correct
4 Correct 12 ms 58092 KB Output is correct
5 Correct 22 ms 57948 KB Output is correct
6 Correct 13 ms 57948 KB Output is correct
7 Correct 13 ms 57948 KB Output is correct
8 Correct 12 ms 57948 KB Output is correct
9 Correct 12 ms 58012 KB Output is correct
10 Correct 12 ms 57948 KB Output is correct
11 Correct 12 ms 58032 KB Output is correct
12 Correct 16 ms 58204 KB Output is correct
13 Incorrect 73 ms 58692 KB Output isn't correct
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 21 ms 57944 KB Output is correct
2 Correct 13 ms 57944 KB Output is correct
3 Correct 12 ms 57948 KB Output is correct
4 Correct 27 ms 58108 KB Output is correct
5 Correct 45 ms 58708 KB Output is correct
6 Correct 14 ms 57944 KB Output is correct
7 Correct 14 ms 57948 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 75 ms 69376 KB Output is correct
10 Runtime error 149 ms 199284 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -