oj.uz

답안 #632665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632665 2022-08-20T14:22:06 Z Mahdi Jail (JOI22_jail) C++17
72 / 100
 3906 ms 1048580 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef pair<int, int> pii;
typedef long long ll;
const int N=12e4+5;
int n, m, nm, sq, s[N], t[N], dis[N], pr[N][18];
vector<int>g[N], h[3*N], nd;
bool mk[3*N];
pii st[N];
     
void dfs(const int &v, const int &p=-1){
    for(int u: g[v]){
        if(u!=p){
            pr[u][0]=v;
            for(int i=1;i<17;++i)
                pr[u][i]=pr[pr[u][i-1]][i-1];
            dis[u]=dis[v]+1;
            dfs(u, v);
        }   
    }
}
     
inline int par(int v, int p){
    for(int i=0;p>0;++i){
        if(p&1)
            v=pr[v][i];
        p>>=1;
    }
    return v;
}
     
inline int lca(int u, int v){
    u=par(u, dis[u]-dis[v]);
    v=par(v, dis[v]-dis[u]);
    if(u==v)
        return v;
    for(int i=16;i>=0;--i){
        if(pr[u][i]!=pr[v][i]){
            v=pr[v][i];
            u=pr[u][i];
        }
    }
    return pr[v][0];
}
     
void pre(){
    nm=2*n+m;
    for(int i=0;i<nm;++i)
        h[i].clear();
    for(int v=0;v<n;++v){
        int u=v, w=par(v, sq);
        while(u!=w){
            if(s[u]!=-1)
                h[s[u]+2*n].push_back(v);
            if(t[u]!=-1)
                h[v+n].push_back(t[u]+2*n);
            u=pr[u][0];
        }
    }
}
     
inline void opr(int i, int v, int u){
    int w=lca(u, v);
    int x=pr[v][0];
    int y=par(x, sq);
    while(dis[y]>=dis[w]){
        h[x].push_back(i);
        x=y;
        y=par(x, sq);
        if(x==w)
            break;
    }
    for(;dis[x]>=dis[w];x=pr[x][0]){
        if(s[x]!=-1)
            h[s[x]+2*n].push_back(i);
        if(x==w)
            break;
    }
    x=v;
    y=par(v, sq);
    while(dis[y]>=dis[w]){
        h[i].push_back(x+n);
        x=y;
        y=par(x, sq);
        if(x==w)
            break;
    }
    for(;dis[x]>=dis[w];x=pr[x][0]){
        if(t[x]!=-1)
            h[i].push_back(t[x]+2*n);
        if(x==w)
            break;
    }
    x=pr[u][0];
    y=par(x, sq);
    while(dis[y]>=dis[w]){
        h[i].push_back(x+n);
        x=y;
        y=par(x, sq);
        if(x==w)
            break;
    }
    for(;dis[x]>dis[w];x=pr[x][0]){
        if(t[x]!=-1)
            h[i].push_back(t[x]+2*n);
    }
    x=u;
    y=par(x, sq);
    while(dis[y]>=dis[w]){
        h[x].push_back(i);
        x=y;
        y=par(x, sq);
        if(x==w)
        break;
    }
    for(;dis[x]>dis[w];x=pr[x][0]){
        if(s[x]!=-1)
            h[s[x]+2*n].push_back(i);
    }
}
     
void sfd(const int &v){
    mk[v]=1;
    for(int u: h[v]){
        if(!mk[u])
            sfd(u);
    }
    nd.push_back(v);
}
     
void sol(){
    cin>>n;
    sq=2*sqrt(n);
    for(int i=0;i<n;++i)
        g[i].clear();
    for(int i=1;i<n;++i){
        int u, v;
        cin>>u>>v;
        g[--v].push_back(--u);
        g[u].push_back(v);
    }
    cin>>m;
    memset(s, -1, 4*n);
    memset(t, -1, 4*n);
    for(int i=0;i<m;++i){
        int u, v;
        cin>>u>>v;
        s[--u]=i;
        t[--v]=i;
        st[i]={u, v};
    }
    dfs(0);
    pre();    
    for(int i=0;i<m;++i)
        opr(2*n+i, st[i].F, st[i].S);
    nd.clear();
    memset(mk, 0, nm);
    for(int i=0;i<nm;++i){
        if(!mk[i])
            sfd(i);
    }
    memset(mk, 0, nm);
    for(int i=0;i<nm;++i){
        mk[nd[i]]=1;
        for(int u: h[nd[i]]){
            if(!mk[u]){
                cout<<"No\n";
                return;
            }
        }
    }
    cout<<"Yes\n";
}
     
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T;
    cin>>T;
    while(T--)
        sol();
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 8 ms 11604 KB Output is correct
3 Correct 7 ms 11604 KB Output is correct
4 Correct 25 ms 11652 KB Output is correct
5 Correct 44 ms 11604 KB Output is correct
6 Correct 8 ms 11604 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 9 ms 11744 KB Output is correct
9 Correct 136 ms 15560 KB Output is correct
10 Correct 335 ms 44524 KB Output is correct
11 Correct 13 ms 11604 KB Output is correct
12 Correct 70 ms 11660 KB Output is correct
13 Correct 1277 ms 481500 KB Output is correct
14 Correct 1145 ms 490476 KB Output is correct
15 Correct 3906 ms 674540 KB Output is correct
16 Runtime error 3491 ms 1048580 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 6 ms 11604 KB Output is correct
3 Correct 8 ms 11604 KB Output is correct
4 Correct 9 ms 11672 KB Output is correct
5 Correct 7 ms 11604 KB Output is correct
6 Correct 7 ms 11668 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 8 ms 11604 KB Output is correct
9 Correct 10 ms 11640 KB Output is correct
10 Correct 10 ms 11604 KB Output is correct
11 Correct 7 ms 11604 KB Output is correct
12 Correct 6 ms 11604 KB Output is correct
13 Correct 6 ms 11604 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 6 ms 11604 KB Output is correct
3 Correct 8 ms 11604 KB Output is correct
4 Correct 9 ms 11672 KB Output is correct
5 Correct 7 ms 11604 KB Output is correct
6 Correct 7 ms 11668 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 8 ms 11604 KB Output is correct
9 Correct 10 ms 11640 KB Output is correct
10 Correct 10 ms 11604 KB Output is correct
11 Correct 7 ms 11604 KB Output is correct
12 Correct 6 ms 11604 KB Output is correct
13 Correct 6 ms 11604 KB Output is correct
14 Correct 6 ms 11604 KB Output is correct
15 Correct 6 ms 11604 KB Output is correct
16 Correct 8 ms 11576 KB Output is correct
17 Correct 8 ms 11604 KB Output is correct
18 Correct 10 ms 11592 KB Output is correct
19 Correct 6 ms 11604 KB Output is correct
20 Correct 8 ms 11604 KB Output is correct
21 Correct 8 ms 11676 KB Output is correct
22 Correct 8 ms 11604 KB Output is correct
23 Correct 7 ms 11604 KB Output is correct
24 Correct 6 ms 11604 KB Output is correct
25 Correct 8 ms 11552 KB Output is correct
26 Correct 6 ms 11604 KB Output is correct
27 Correct 7 ms 11604 KB Output is correct
28 Correct 6 ms 11604 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 6 ms 11604 KB Output is correct
3 Correct 8 ms 11604 KB Output is correct
4 Correct 9 ms 11672 KB Output is correct
5 Correct 7 ms 11604 KB Output is correct
6 Correct 7 ms 11668 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 8 ms 11604 KB Output is correct
9 Correct 10 ms 11640 KB Output is correct
10 Correct 10 ms 11604 KB Output is correct
11 Correct 7 ms 11604 KB Output is correct
12 Correct 6 ms 11604 KB Output is correct
13 Correct 6 ms 11604 KB Output is correct
14 Correct 6 ms 11604 KB Output is correct
15 Correct 6 ms 11604 KB Output is correct
16 Correct 8 ms 11576 KB Output is correct
17 Correct 8 ms 11604 KB Output is correct
18 Correct 10 ms 11592 KB Output is correct
19 Correct 6 ms 11604 KB Output is correct
20 Correct 8 ms 11604 KB Output is correct
21 Correct 8 ms 11676 KB Output is correct
22 Correct 8 ms 11604 KB Output is correct
23 Correct 7 ms 11604 KB Output is correct
24 Correct 6 ms 11604 KB Output is correct
25 Correct 8 ms 11552 KB Output is correct
26 Correct 6 ms 11604 KB Output is correct
27 Correct 7 ms 11604 KB Output is correct
28 Correct 6 ms 11604 KB Output is correct
29 Correct 10 ms 11732 KB Output is correct
30 Correct 8 ms 11676 KB Output is correct
31 Correct 10 ms 11732 KB Output is correct
32 Correct 8 ms 11604 KB Output is correct
33 Correct 7 ms 11604 KB Output is correct
34 Correct 7 ms 11604 KB Output is correct
35 Correct 8 ms 11604 KB Output is correct
36 Correct 7 ms 11604 KB Output is correct
37 Correct 7 ms 11604 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 6 ms 11604 KB Output is correct
3 Correct 8 ms 11604 KB Output is correct
4 Correct 9 ms 11672 KB Output is correct
5 Correct 7 ms 11604 KB Output is correct
6 Correct 7 ms 11668 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 8 ms 11604 KB Output is correct
9 Correct 10 ms 11640 KB Output is correct
10 Correct 10 ms 11604 KB Output is correct
11 Correct 7 ms 11604 KB Output is correct
12 Correct 6 ms 11604 KB Output is correct
13 Correct 6 ms 11604 KB Output is correct
14 Correct 6 ms 11604 KB Output is correct
15 Correct 6 ms 11604 KB Output is correct
16 Correct 8 ms 11576 KB Output is correct
17 Correct 8 ms 11604 KB Output is correct
18 Correct 10 ms 11592 KB Output is correct
19 Correct 6 ms 11604 KB Output is correct
20 Correct 8 ms 11604 KB Output is correct
21 Correct 8 ms 11676 KB Output is correct
22 Correct 8 ms 11604 KB Output is correct
23 Correct 7 ms 11604 KB Output is correct
24 Correct 6 ms 11604 KB Output is correct
25 Correct 8 ms 11552 KB Output is correct
26 Correct 6 ms 11604 KB Output is correct
27 Correct 7 ms 11604 KB Output is correct
28 Correct 6 ms 11604 KB Output is correct
29 Correct 10 ms 11732 KB Output is correct
30 Correct 8 ms 11676 KB Output is correct
31 Correct 10 ms 11732 KB Output is correct
32 Correct 8 ms 11604 KB Output is correct
33 Correct 7 ms 11604 KB Output is correct
34 Correct 7 ms 11604 KB Output is correct
35 Correct 8 ms 11604 KB Output is correct
36 Correct 7 ms 11604 KB Output is correct
37 Correct 7 ms 11604 KB Output is correct
38 Correct 146 ms 15528 KB Output is correct
39 Correct 337 ms 44684 KB Output is correct
40 Correct 97 ms 14576 KB Output is correct
41 Correct 45 ms 12736 KB Output is correct
42 Correct 52 ms 14180 KB Output is correct
43 Correct 89 ms 12948 KB Output is correct
44 Correct 18 ms 11860 KB Output is correct
45 Correct 220 ms 27740 KB Output is correct
46 Correct 201 ms 27596 KB Output is correct
47 Correct 448 ms 32712 KB Output is correct
48 Correct 470 ms 32752 KB Output is correct
49 Correct 689 ms 27964 KB Output is correct
50 Correct 718 ms 27332 KB Output is correct
51 Correct 629 ms 31644 KB Output is correct
52 Correct 612 ms 32372 KB Output is correct
53 Correct 19 ms 13140 KB Output is correct
54 Correct 144 ms 26752 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 7 ms 11604 KB Output is correct
3 Correct 6 ms 11604 KB Output is correct
4 Correct 6 ms 11604 KB Output is correct
5 Correct 18 ms 11624 KB Output is correct
6 Correct 7 ms 11604 KB Output is correct
7 Correct 7 ms 11604 KB Output is correct
8 Correct 6 ms 11600 KB Output is correct
9 Correct 6 ms 11604 KB Output is correct
10 Correct 8 ms 11660 KB Output is correct
11 Correct 6 ms 11604 KB Output is correct
12 Correct 8 ms 11604 KB Output is correct
13 Correct 33 ms 11732 KB Output is correct
14 Correct 40 ms 11664 KB Output is correct
15 Correct 37 ms 11668 KB Output is correct
16 Correct 107 ms 29816 KB Output is correct
17 Correct 241 ms 40864 KB Output is correct
18 Correct 427 ms 59200 KB Output is correct
19 Correct 116 ms 28372 KB Output is correct
20 Correct 116 ms 29284 KB Output is correct
21 Correct 109 ms 29288 KB Output is correct
22 Correct 160 ms 39632 KB Output is correct
23 Correct 197 ms 39216 KB Output is correct
24 Correct 166 ms 39148 KB Output is correct
25 Correct 149 ms 39376 KB Output is correct
26 Correct 172 ms 39464 KB Output is correct
27 Correct 199 ms 37396 KB Output is correct
28 Correct 175 ms 39996 KB Output is correct
29 Correct 177 ms 38180 KB Output is correct
30 Correct 149 ms 35000 KB Output is correct
31 Correct 129 ms 35708 KB Output is correct
32 Correct 162 ms 33068 KB Output is correct
33 Correct 144 ms 33860 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 8 ms 11604 KB Output is correct
3 Correct 7 ms 11604 KB Output is correct
4 Correct 25 ms 11652 KB Output is correct
5 Correct 44 ms 11604 KB Output is correct
6 Correct 8 ms 11604 KB Output is correct
7 Correct 8 ms 11604 KB Output is correct
8 Correct 9 ms 11744 KB Output is correct
9 Correct 136 ms 15560 KB Output is correct
10 Correct 335 ms 44524 KB Output is correct
11 Correct 13 ms 11604 KB Output is correct
12 Correct 70 ms 11660 KB Output is correct
13 Correct 1277 ms 481500 KB Output is correct
14 Correct 1145 ms 490476 KB Output is correct
15 Correct 3906 ms 674540 KB Output is correct
16 Runtime error 3491 ms 1048580 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -