답안 #877422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877422 2023-11-23T08:30:44 Z simona1230 Jail (JOI22_jail) C++17
26 / 100
4241 ms 180048 KB
#include <bits/stdc++.h>

using namespace std;
const int maxn=1e6;
int q,n,m;
vector<int> f[200001];
bool test=0;
void read()
{
    cin>>n;
    for(int i=1; i<=n; i++)
        f[i].clear();
    for(int i=1; i<n; i++)
    {
        int x,y;
        cin>>x>>y;
        f[x].push_back(y);
        f[y].push_back(x);
    }
}
int num;
int ts[800001];// number of the vertex corresponding
int te[800001];// to the given tree and segment of the hld
int dw[200001];
int up[200001];

vector<int> v[maxn],o[maxn];

void make_tree(int i,int l,int r)
{
    if(l==r)
    {
        ts[i]=num++;
        dw[l]=ts[i];
        te[i]=num++;
        up[l]=te[i];
        //cout<<l<<" "<<r<<" "<<te[i]<<endl;
        return;
    }
    int mid=(l+r)/2;
    ts[i]=num++;
    te[i]=num++;
    //cout<<l<<" "<<r<<" "<<te[i]<<endl;
    make_tree(i*2,l,mid);
    make_tree(i*2+1,mid+1,r);
    int il=ts[i*2];
    int ir=ts[i*2+1];
    v[ts[i]].push_back(il);
    v[ts[i]].push_back(ir);
    o[il].push_back(ts[i]);
    o[ir].push_back(ts[i]);
    il=te[i*2];
    ir=te[i*2+1];
    v[il].push_back(te[i]);
    v[ir].push_back(te[i]);
    o[te[i]].push_back(il);
    o[te[i]].push_back(ir);
}

int used[200001];
int jump[200001][21];
int sz[200001];
int pos[200001];// new number of vertex i in original graph
int chain[200001];// leader of the chain in which i is
int maxx[200001];
int lvl[200001];
void necessities(int i,int h)
{
    sz[i]=1;
    used[i]=1;
    for(int j=0; j<f[i].size(); j++)
    {
        int nb=f[i][j];
        if(!used[nb])
        {
            necessities(nb,h+1);
            sz[i]+=sz[nb];
            if(sz[maxx[i]]<sz[nb])maxx[i]=nb;
        }
    }
}
int cnt=1;
void hld(int i,int lead,int h)
{
    pos[i]=cnt++;
    chain[pos[i]]=pos[lead];
    lvl[pos[i]]=h;
    if(maxx[i])
    {
        hld(maxx[i],lead,h+1);
        jump[pos[maxx[i]]][0]=pos[i];
    }
    for(int j=0; j<f[i].size(); j++)
    {
        int nb=f[i][j];
        if(pos[nb]==0)
        {
            hld(nb,nb,h+1);
            jump[pos[nb]][0]=pos[i];
        }
    }
}
void prec()
{
    for(int j=1; j<=20; j++)
    {
        for(int i=1; i<=n; i++)
        {
            jump[i][j]=jump[jump[i][j-1]][j-1];
            //cout<<i<<" "<<j<<" "<<jump[i][j]<<endl;
        }
    }
}
int make_jump(int x,int k)
{
    for(int i=20; i>=0; i--)
        if(k&(1<<i))
            x=jump[x][i];
    return x;
}
int lca(int x,int y)
{
    if(lvl[x]>lvl[y])swap(x,y);
    y=make_jump(y,abs(lvl[y]-lvl[x]));
    //cout<<x<<" "<<y<<endl;
    if(x==y)return x;
    for(int i=20; i>=0; i--)
    {
        if(jump[x][i]!=jump[y][i])
        {
            x=jump[x][i];
            y=jump[y][i];
        }
    }
    return jump[x][0];
}
void update(int i,int l,int r,int ql,int qr,int pr)
{
    if(ql>qr)return;
    if(r<ql||l>qr)return;
    if(ql<=l&&r<=qr)
    {
        //cout<<l<<"-"<<r<<endl;
        int idx=ts[i];
        //cout<<idx<<endl;
        v[pr].push_back(idx);
        o[idx].push_back(pr);
        idx=te[i];
        //cout<<idx<<endl;
        v[idx].push_back(pr);
        o[pr].push_back(idx);
        return;
    }
    int mid=(l+r)/2;
    update(i*2,l,mid,ql,qr,pr);
    update(i*2+1,mid+1,r,ql,qr,pr);
}
void make_graph()
{
    /*for(int i=1;i<=n;i++)
        cout<<chain[i]<<" ";
    cout<<endl;*/
    for(int i=1; i<=m; i++)
    {
        int x,y;
        cin>>x>>y;
        x=pos[x];
        y=pos[y];
        //cout<<i<<" "<<dw[pos[x]]<<" "<<up[pos[y]]<<endl;
        v[dw[x]].push_back(i);
        o[i].push_back(dw[x]);
        v[i].push_back(up[y]);
        o[up[y]].push_back(i);
        int ver=lca(x,y);
        //cout<<ver<<endl;
        int c1=x;

        int br = 0;

        while(1)
        {
            int c2=chain[c1];
            if(lvl[c2]<lvl[ver])c2=ver;
            update(1,1,n,c2,c1,i);
            //cout<<c2<<" "<<c1<<endl;
            if(c2==ver)break;
            c1=jump[c2][0];

            br++;
            //if(br >= n + 1) assert(false);

        }
        c1=y;

        br = 0;

        while(1)
        {
            int c2=chain[c1];
            if(lvl[c2]<lvl[ver])c2=ver;
            update(1,1,n,c2,c1,i);
            //cout<<c2<<" "<<c1<<endl;
            if(c2==ver)break;
            c1=jump[c2][0];

            br++;
            //if(br >= n + 1) assert(false);


        }
    }
}
int used1[maxn];
stack<int> st;
void dfs1(int i)
{
    used1[i]=1;
    for(int j=0; j<v[i].size(); j++)
    {
        int nb=v[i][j];
        if(!used1[nb])
        {
            dfs1(nb);
        }
    }
    st.push(i);
}
int used2[maxn];
void dfs2(int i)
{
    used2[i]=1;
    for(int j=0; j<o[i].size(); j++)
    {
        int nb=o[i][j];
        if(!used2[nb])
        {
            dfs2(nb);
        }
    }
}
void check()
{
    for(int i=1;i<=m;i++)
    {
        if(!used1[i])dfs1(i);
    }
    int cnt1=0;
    while(st.size())
    {
        int vr=st.top();
        st.pop();
        if(vr<=m&&!used2[vr])
        {
            cnt1++;
            dfs2(vr);
        }
    }
    if(cnt1==m)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>q;
    while(q--)
    {
        test=0;
        for(int i=1; i<maxn; i++)
        {
            o[i].clear();
            v[i].clear();
        }
        memset(maxx,0,sizeof(maxx));
        memset(used,0,sizeof(used));
        memset(pos,0,sizeof(pos));
        memset(used1,0,sizeof(used1));
        memset(used2,0,sizeof(used2));
        memset(chain,0,sizeof(chain));
        memset(ts,0,sizeof(ts));
        memset(te,0,sizeof(te));
        memset(sz,0,sizeof(sz));
        memset(dw,0,sizeof(dw));
        memset(up,0,sizeof(up));
        memset(lvl,0,sizeof(lvl));

        read();
        for(int i=1;i<=n;i++)
            for(int j=0;j<=20;j++)
                jump[i][j]=0;
        cnt=1;
        necessities(1,1);
        hld(1,1,1);
        prec();
        cin>>m;
        num=m+1;
        make_tree(1,1,n);

        make_graph();

        /*for(int i=1;i<num;i++)
        {
            cout<<i<<": ";
            for(int j=0;j<v[i].size();j++)
                cout<<v[i][j]<<" ";
            cout<<endl;
        }*/
        check();
    }
    return 0;
}

Compilation message

jail.cpp: In function 'void necessities(int, int)':
jail.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for(int j=0; j<f[i].size(); j++)
      |                  ~^~~~~~~~~~~~
jail.cpp: In function 'void hld(int, int, int)':
jail.cpp:93:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(int j=0; j<f[i].size(); j++)
      |                  ~^~~~~~~~~~~~
jail.cpp: In function 'void dfs1(int)':
jail.cpp:218:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |     for(int j=0; j<v[i].size(); j++)
      |                  ~^~~~~~~~~~~~
jail.cpp: In function 'void dfs2(int)':
jail.cpp:232:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  232 |     for(int j=0; j<o[i].size(); j++)
      |                  ~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 74332 KB Output is correct
2 Correct 25 ms 74332 KB Output is correct
3 Correct 18 ms 74328 KB Output is correct
4 Correct 1869 ms 74580 KB Output is correct
5 Correct 4054 ms 74584 KB Output is correct
6 Correct 93 ms 74584 KB Output is correct
7 Correct 93 ms 74588 KB Output is correct
8 Correct 99 ms 74640 KB Output is correct
9 Correct 152 ms 76924 KB Output is correct
10 Correct 118 ms 121684 KB Output is correct
11 Correct 4094 ms 74540 KB Output is correct
12 Correct 4241 ms 74856 KB Output is correct
13 Correct 240 ms 132740 KB Output is correct
14 Correct 235 ms 133288 KB Output is correct
15 Correct 565 ms 142780 KB Output is correct
16 Correct 1076 ms 180048 KB Output is correct
17 Correct 299 ms 148424 KB Output is correct
18 Correct 248 ms 142144 KB Output is correct
19 Correct 276 ms 144724 KB Output is correct
20 Correct 279 ms 144740 KB Output is correct
21 Correct 343 ms 147036 KB Output is correct
22 Correct 186 ms 129876 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74332 KB Output is correct
2 Correct 17 ms 74328 KB Output is correct
3 Correct 95 ms 74588 KB Output is correct
4 Correct 93 ms 74588 KB Output is correct
5 Correct 96 ms 74588 KB Output is correct
6 Correct 96 ms 74584 KB Output is correct
7 Correct 93 ms 74596 KB Output is correct
8 Correct 93 ms 74588 KB Output is correct
9 Correct 94 ms 74588 KB Output is correct
10 Correct 99 ms 74584 KB Output is correct
11 Correct 82 ms 74588 KB Output is correct
12 Correct 95 ms 74584 KB Output is correct
13 Correct 95 ms 74556 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74332 KB Output is correct
2 Correct 17 ms 74328 KB Output is correct
3 Correct 95 ms 74588 KB Output is correct
4 Correct 93 ms 74588 KB Output is correct
5 Correct 96 ms 74588 KB Output is correct
6 Correct 96 ms 74584 KB Output is correct
7 Correct 93 ms 74596 KB Output is correct
8 Correct 93 ms 74588 KB Output is correct
9 Correct 94 ms 74588 KB Output is correct
10 Correct 99 ms 74584 KB Output is correct
11 Correct 82 ms 74588 KB Output is correct
12 Correct 95 ms 74584 KB Output is correct
13 Correct 95 ms 74556 KB Output is correct
14 Correct 21 ms 74332 KB Output is correct
15 Correct 25 ms 74332 KB Output is correct
16 Correct 95 ms 74604 KB Output is correct
17 Correct 96 ms 74584 KB Output is correct
18 Correct 96 ms 74588 KB Output is correct
19 Correct 94 ms 74332 KB Output is correct
20 Correct 98 ms 74596 KB Output is correct
21 Correct 96 ms 74588 KB Output is correct
22 Correct 93 ms 74584 KB Output is correct
23 Correct 94 ms 74340 KB Output is correct
24 Correct 96 ms 74536 KB Output is correct
25 Correct 98 ms 74592 KB Output is correct
26 Correct 94 ms 74556 KB Output is correct
27 Correct 96 ms 74584 KB Output is correct
28 Correct 95 ms 74328 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74332 KB Output is correct
2 Correct 17 ms 74328 KB Output is correct
3 Correct 95 ms 74588 KB Output is correct
4 Correct 93 ms 74588 KB Output is correct
5 Correct 96 ms 74588 KB Output is correct
6 Correct 96 ms 74584 KB Output is correct
7 Correct 93 ms 74596 KB Output is correct
8 Correct 93 ms 74588 KB Output is correct
9 Correct 94 ms 74588 KB Output is correct
10 Correct 99 ms 74584 KB Output is correct
11 Correct 82 ms 74588 KB Output is correct
12 Correct 95 ms 74584 KB Output is correct
13 Correct 95 ms 74556 KB Output is correct
14 Correct 21 ms 74332 KB Output is correct
15 Correct 25 ms 74332 KB Output is correct
16 Correct 95 ms 74604 KB Output is correct
17 Correct 96 ms 74584 KB Output is correct
18 Correct 96 ms 74588 KB Output is correct
19 Correct 94 ms 74332 KB Output is correct
20 Correct 98 ms 74596 KB Output is correct
21 Correct 96 ms 74588 KB Output is correct
22 Correct 93 ms 74584 KB Output is correct
23 Correct 94 ms 74340 KB Output is correct
24 Correct 96 ms 74536 KB Output is correct
25 Correct 98 ms 74592 KB Output is correct
26 Correct 94 ms 74556 KB Output is correct
27 Correct 96 ms 74584 KB Output is correct
28 Correct 95 ms 74328 KB Output is correct
29 Correct 101 ms 74904 KB Output is correct
30 Correct 102 ms 74640 KB Output is correct
31 Correct 98 ms 74588 KB Output is correct
32 Correct 99 ms 74584 KB Output is correct
33 Correct 97 ms 74592 KB Output is correct
34 Correct 105 ms 74836 KB Output is correct
35 Correct 102 ms 74588 KB Output is correct
36 Correct 97 ms 74584 KB Output is correct
37 Incorrect 100 ms 74548 KB Output isn't correct
38 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74332 KB Output is correct
2 Correct 17 ms 74328 KB Output is correct
3 Correct 95 ms 74588 KB Output is correct
4 Correct 93 ms 74588 KB Output is correct
5 Correct 96 ms 74588 KB Output is correct
6 Correct 96 ms 74584 KB Output is correct
7 Correct 93 ms 74596 KB Output is correct
8 Correct 93 ms 74588 KB Output is correct
9 Correct 94 ms 74588 KB Output is correct
10 Correct 99 ms 74584 KB Output is correct
11 Correct 82 ms 74588 KB Output is correct
12 Correct 95 ms 74584 KB Output is correct
13 Correct 95 ms 74556 KB Output is correct
14 Correct 21 ms 74332 KB Output is correct
15 Correct 25 ms 74332 KB Output is correct
16 Correct 95 ms 74604 KB Output is correct
17 Correct 96 ms 74584 KB Output is correct
18 Correct 96 ms 74588 KB Output is correct
19 Correct 94 ms 74332 KB Output is correct
20 Correct 98 ms 74596 KB Output is correct
21 Correct 96 ms 74588 KB Output is correct
22 Correct 93 ms 74584 KB Output is correct
23 Correct 94 ms 74340 KB Output is correct
24 Correct 96 ms 74536 KB Output is correct
25 Correct 98 ms 74592 KB Output is correct
26 Correct 94 ms 74556 KB Output is correct
27 Correct 96 ms 74584 KB Output is correct
28 Correct 95 ms 74328 KB Output is correct
29 Correct 101 ms 74904 KB Output is correct
30 Correct 102 ms 74640 KB Output is correct
31 Correct 98 ms 74588 KB Output is correct
32 Correct 99 ms 74584 KB Output is correct
33 Correct 97 ms 74592 KB Output is correct
34 Correct 105 ms 74836 KB Output is correct
35 Correct 102 ms 74588 KB Output is correct
36 Correct 97 ms 74584 KB Output is correct
37 Incorrect 100 ms 74548 KB Output isn't correct
38 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74332 KB Output is correct
2 Correct 21 ms 74492 KB Output is correct
3 Correct 25 ms 74328 KB Output is correct
4 Correct 17 ms 74332 KB Output is correct
5 Correct 4085 ms 74544 KB Output is correct
6 Correct 93 ms 74580 KB Output is correct
7 Correct 95 ms 74588 KB Output is correct
8 Correct 97 ms 74332 KB Output is correct
9 Correct 98 ms 74332 KB Output is correct
10 Correct 96 ms 74328 KB Output is correct
11 Correct 101 ms 74332 KB Output is correct
12 Correct 94 ms 74620 KB Output is correct
13 Incorrect 4069 ms 75048 KB Output isn't correct
14 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 74332 KB Output is correct
2 Correct 25 ms 74332 KB Output is correct
3 Correct 18 ms 74328 KB Output is correct
4 Correct 1869 ms 74580 KB Output is correct
5 Correct 4054 ms 74584 KB Output is correct
6 Correct 93 ms 74584 KB Output is correct
7 Correct 93 ms 74588 KB Output is correct
8 Correct 99 ms 74640 KB Output is correct
9 Correct 152 ms 76924 KB Output is correct
10 Correct 118 ms 121684 KB Output is correct
11 Correct 4094 ms 74540 KB Output is correct
12 Correct 4241 ms 74856 KB Output is correct
13 Correct 240 ms 132740 KB Output is correct
14 Correct 235 ms 133288 KB Output is correct
15 Correct 565 ms 142780 KB Output is correct
16 Correct 1076 ms 180048 KB Output is correct
17 Correct 299 ms 148424 KB Output is correct
18 Correct 248 ms 142144 KB Output is correct
19 Correct 276 ms 144724 KB Output is correct
20 Correct 279 ms 144740 KB Output is correct
21 Correct 343 ms 147036 KB Output is correct
22 Correct 186 ms 129876 KB Output is correct
23 Correct 17 ms 74332 KB Output is correct
24 Correct 17 ms 74328 KB Output is correct
25 Correct 95 ms 74588 KB Output is correct
26 Correct 93 ms 74588 KB Output is correct
27 Correct 96 ms 74588 KB Output is correct
28 Correct 96 ms 74584 KB Output is correct
29 Correct 93 ms 74596 KB Output is correct
30 Correct 93 ms 74588 KB Output is correct
31 Correct 94 ms 74588 KB Output is correct
32 Correct 99 ms 74584 KB Output is correct
33 Correct 82 ms 74588 KB Output is correct
34 Correct 95 ms 74584 KB Output is correct
35 Correct 95 ms 74556 KB Output is correct
36 Correct 21 ms 74332 KB Output is correct
37 Correct 25 ms 74332 KB Output is correct
38 Correct 95 ms 74604 KB Output is correct
39 Correct 96 ms 74584 KB Output is correct
40 Correct 96 ms 74588 KB Output is correct
41 Correct 94 ms 74332 KB Output is correct
42 Correct 98 ms 74596 KB Output is correct
43 Correct 96 ms 74588 KB Output is correct
44 Correct 93 ms 74584 KB Output is correct
45 Correct 94 ms 74340 KB Output is correct
46 Correct 96 ms 74536 KB Output is correct
47 Correct 98 ms 74592 KB Output is correct
48 Correct 94 ms 74556 KB Output is correct
49 Correct 96 ms 74584 KB Output is correct
50 Correct 95 ms 74328 KB Output is correct
51 Correct 101 ms 74904 KB Output is correct
52 Correct 102 ms 74640 KB Output is correct
53 Correct 98 ms 74588 KB Output is correct
54 Correct 99 ms 74584 KB Output is correct
55 Correct 97 ms 74592 KB Output is correct
56 Correct 105 ms 74836 KB Output is correct
57 Correct 102 ms 74588 KB Output is correct
58 Correct 97 ms 74584 KB Output is correct
59 Incorrect 100 ms 74548 KB Output isn't correct
60 Halted 0 ms 0 KB -