oj.uz

답안 #1013283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013283 2024-07-03T11:19:16 Z Aiperiii Jail (JOI22_jail) C++14
21 / 100
 22 ms 25436 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=12e4+5;
vector <int> g[N],g2[N];
int p[N],d[N],jmp[20][N],cl[N];
void dfs(int v,int par){
    p[v]=par;
    jmp[0][v]=par;
    for(auto to : g[v]){
        if(!p[to]){
            d[to]=d[v]+1;
            dfs(to,v);
        }
    }
}
int lca(int v,int u){
    if(d[v]<d[u])swap(v,u);
    for(int k=19;k>=0;k--){
        if(d[jmp[k][v]]>=d[u]){
            v=jmp[k][v];
        }
    }
    if(u==v)return u;
    for(int k=19;k>=0;k--){
        if(jmp[k][v]!=jmp[k][u]){
            v=jmp[k][v];
            u=jmp[k][u];
        }
    }
    return p[v];
}
bool dfs2(int v){
    cl[v]=1;
    for(auto to : g2[v]){
        if(cl[to]==1)return true;
        if(!cl[to]){
            if(dfs2(to))return true;
        }
    }
    cl[v]=2;
    return false;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int q;
    cin>>q;
    while(q--){
        int n;
        cin>>n;
        for(int i=0;i<n-1;i++){
            int u,v;
            cin>>u>>v;
            g[u].pb(v);
            g[v].pb(u);
        }
        int m;
        cin>>m;
        vector <int> s(m+1),t(m+1),st(n+1),ed(n+1);
        for(int i=1;i<=m;i++){
            cin>>s[i]>>t[i];
            st[s[i]]=i;
            ed[t[i]]=i;
        }
        dfs(1,1);
        for(int k=1;k<20;k++){
            for(int i=1;i<=n;i++){
                jmp[k][i]=jmp[k-1][jmp[k-1][i]];
            }
        }
        for(int i=1;i<=m;i++){
            int l=lca(s[i],t[i]);
            int x=s[i];
            while(x!=l){
                if(st[x] && i!=st[x]){
                    g2[st[x]].pb(i);
                }
                else if(ed[x] && i!=ed[x]){
                    g2[i].pb(ed[x]);
                }
                x=p[x];
            }
            x=t[i];
            while(x!=l){
                if(st[x] && i!=st[x]){
                    g2[st[x]].pb(i);
                }
                else if(ed[x] && i!=ed[x]){
                    g2[i].pb(ed[x]);
                }
                x=p[x];
            }
            if(st[l] && st[l]!=i){
                g2[st[l]].pb(i);
            }
            else if(ed[l] && ed[l]!=i){
                g2[i].pb(ed[l]);
            }
        }
        bool ok=1;
        for(int i=1;i<=m;i++){
            if(!cl[i]){
                if(dfs2(i))ok=0;
            }
        }
        if(ok)cout<<"Yes\n";
        else cout<<"No\n";
        for(int i=1;i<=n;i++){
            g[i].clear();
            g2[i].clear();
            p[i]=0;d[i]=0;cl[i]=0;
            for(int k=0;k<20;k++)jmp[k][i]=0;
        }
    }
}



/*
1
8
1 2
2 3
3 4
4 5
5 6
6 7
7 8
2
3 4
4 8
 */

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25436 KB Output is correct
2 Correct 3 ms 17400 KB Output is correct
3 Correct 2 ms 15192 KB Output is correct
4 Incorrect 12 ms 17452 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15188 KB Output is correct
2 Correct 2 ms 15196 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 15372 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 3 ms 15368 KB Output is correct
10 Correct 4 ms 15196 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 2 ms 17244 KB Output is correct
13 Correct 2 ms 15196 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15188 KB Output is correct
2 Correct 2 ms 15196 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 15372 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 3 ms 15368 KB Output is correct
10 Correct 4 ms 15196 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 2 ms 17244 KB Output is correct
13 Correct 2 ms 15196 KB Output is correct
14 Correct 2 ms 17244 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 4 ms 15196 KB Output is correct
17 Correct 5 ms 25436 KB Output is correct
18 Correct 4 ms 19288 KB Output is correct
19 Correct 3 ms 11068 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct
21 Correct 2 ms 11304 KB Output is correct
22 Correct 2 ms 13148 KB Output is correct
23 Correct 3 ms 17244 KB Output is correct
24 Correct 2 ms 15192 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 3 ms 17244 KB Output is correct
27 Correct 2 ms 17244 KB Output is correct
28 Correct 2 ms 5980 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15188 KB Output is correct
2 Correct 2 ms 15196 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 15372 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 3 ms 15368 KB Output is correct
10 Correct 4 ms 15196 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 2 ms 17244 KB Output is correct
13 Correct 2 ms 15196 KB Output is correct
14 Correct 2 ms 17244 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 4 ms 15196 KB Output is correct
17 Correct 5 ms 25436 KB Output is correct
18 Correct 4 ms 19288 KB Output is correct
19 Correct 3 ms 11068 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct
21 Correct 2 ms 11304 KB Output is correct
22 Correct 2 ms 13148 KB Output is correct
23 Correct 3 ms 17244 KB Output is correct
24 Correct 2 ms 15192 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 3 ms 17244 KB Output is correct
27 Correct 2 ms 17244 KB Output is correct
28 Correct 2 ms 5980 KB Output is correct
29 Correct 4 ms 6492 KB Output is correct
30 Correct 4 ms 6316 KB Output is correct
31 Correct 5 ms 6232 KB Output is correct
32 Correct 2 ms 6236 KB Output is correct
33 Incorrect 2 ms 6116 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15188 KB Output is correct
2 Correct 2 ms 15196 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 15372 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 3 ms 15368 KB Output is correct
10 Correct 4 ms 15196 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 2 ms 17244 KB Output is correct
13 Correct 2 ms 15196 KB Output is correct
14 Correct 2 ms 17244 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 4 ms 15196 KB Output is correct
17 Correct 5 ms 25436 KB Output is correct
18 Correct 4 ms 19288 KB Output is correct
19 Correct 3 ms 11068 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct
21 Correct 2 ms 11304 KB Output is correct
22 Correct 2 ms 13148 KB Output is correct
23 Correct 3 ms 17244 KB Output is correct
24 Correct 2 ms 15192 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 3 ms 17244 KB Output is correct
27 Correct 2 ms 17244 KB Output is correct
28 Correct 2 ms 5980 KB Output is correct
29 Correct 4 ms 6492 KB Output is correct
30 Correct 4 ms 6316 KB Output is correct
31 Correct 5 ms 6232 KB Output is correct
32 Correct 2 ms 6236 KB Output is correct
33 Incorrect 2 ms 6116 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 1 ms 15196 KB Output is correct
5 Correct 6 ms 19292 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 7004 KB Output is correct
10 Correct 2 ms 6232 KB Output is correct
11 Correct 3 ms 6236 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Incorrect 22 ms 6744 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25436 KB Output is correct
2 Correct 3 ms 17400 KB Output is correct
3 Correct 2 ms 15192 KB Output is correct
4 Incorrect 12 ms 17452 KB Output isn't correct
5 Halted 0 ms 0 KB -