oj.uz

답안 #725009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725009 2023-04-16T12:52:19 Z berr Jail (JOI22_jail) C++17
61 / 100
 5000 ms 43888 KB 
#include <bits/stdc++.h>
using namespace std; 
const int N = 1e5 + 2e4 + 37;
vector<int> adj[N], adj2[N], adj3[N], s(N), e(N), ti(N), to(N), vis(N), de(N), qe(N, -1), qs(N, -1);
int par[N][18], cnt, flag;


bool ia(int x, int y){
    return ti[x] <= ti[y] && to[x] >= to[y];
}

int d(int x, int y){
    if(x == y || x==-1 || y==-1) return 0;

    int sum = 0;

    if(ia(x, y)) swap(x, y);

    for (int i = 17; i >= 0; i--){
        if(!ia(par[x][i], y)){
            x = par[x][i];
            sum += 1<<i;
        }
    }

    sum++;
    x=par[x][0];



    swap(x, y);

    sum+=de[x]-de[y];
    return sum;
}

bool c(int x, int y){
    if(x==y || x==-1 || y==-1) return 0;

    if( (d(s[x], e[x]) == (d(s[x], e[y])+ d(e[y], e[x])))) return 1;
    swap(x, y);
    return (d(s[x], e[x]) == (d(s[x], s[y])+ d(s[y], e[x])));
}
bool c2(int x, int y){
    if(x==y) return 0;

    if(d(s[x], e[x]) == d(s[x], s[y])+ d(s[y], e[y]) + d(e[y], e[x])) return 1;
    if(d(s[x], e[x]) == d(s[x], e[y])+ d(e[y], s[y]) + d(s[y], e[x])) return 1;
    return 0;
}

void dfs(int v, int p){
    par[v][0] = p;
    de[v]=de[p]+1;
    ti[v] = cnt++;
    
    for (auto i: adj[v]){
        if (i == p) continue;
        dfs(i, v);
    }

    to[v] = cnt++;
}

void dfs2(int v, int z){
    vis[v] = z;

    for (auto i: adj2[v]){
        if (vis[i]==z) flag = 0;
        else if(vis[i]<z) dfs2(i, z);
    }

    vis[v]=z+1;
}

void ssolve(int n, int m){
    for(int i=0;i<m; i++){
        vector<int> path;

        int x=s[i], y=e[i];


        while(!ia(x, y)){
            path.push_back(x);
            x=par[x][0];
        }

        path.push_back(x);

        while(!ia(y, x)){
            path.push_back(y);
            y=par[y][0];
        }
        path.push_back(y);

        for(auto j: path){
            int l=qs[j];

            if (c(i, l)) adj2[i].push_back(l);


            if(c2(i, l)) flag = 0;

            l=qe[j];

            if (c(i, l)) adj2[i].push_back(l);


            if(c2(i, l)) flag = 0;  

        }
    }


    for(int i = 0; i < n; i++){
        if(vis[i]==0) dfs2(i, n*i+1);
    }


    if(flag) cout<<"Yes\n";
    else cout<<"No\n";

    for (int i = 0; i < n; i++){
        adj[i].clear();
        adj2[i].clear();
        vis[i] = 0;
        qs[i]=qe[i]=-1;
    }
}

void solve(){
    int n; cin >> n;
    cnt = 0;

    for (int i = 1; i < n; i++){
        int x, y; cin >> x >> y;
        x--; y--;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    de[0]=-1;
    dfs(0, 0);

    for (int i = 1; i < 18; i++){
        for(int l = 0; l < n; l++){
            par[l][i] = par[par[l][i-1]][i-1];
        }
    }

    flag = 1;

    int m; cin >> m;


    for (int i = 0; i < m; i++){
        cin >> s[i] >> e[i];
        s[i]--; e[i]--;
        qs[s[i]]=i;
        qe[e[i]]=i;

    }
    if(m>500){
        ssolve(n, m);
        return ;
    }
    else{

    for (int i = 0; i < m; i++){
        for (int l = 0; l < m; l++){
            if (c(i, l)) adj2[i].push_back(l);


            if(c2(i, l)) flag = 0;
            

        }
    }

    for(int i = 0; i < n; i++){
        if(vis[i]==0) dfs2(i, n*i+1);
    }


    if(flag) cout << "Yes\n";
    else cout << "No\n";

    for (int i = 0; i < n; i++){
        adj[i].clear();
        adj2[i].clear();
        vis[i] = 0;
        qs[i]=qe[i]=-1;
    }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
        
    int t; cin>>t;

    while(t--){
        solve();
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12560 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 18 ms 12592 KB Output is correct
5 Correct 27 ms 12592 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 8 ms 12500 KB Output is correct
8 Correct 143 ms 12612 KB Output is correct
9 Correct 4819 ms 14512 KB Output is correct
10 Correct 243 ms 31064 KB Output is correct
11 Correct 43 ms 12580 KB Output is correct
12 Correct 1496 ms 12652 KB Output is correct
13 Execution timed out 5075 ms 43888 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 7 ms 12500 KB Output is correct
3 Correct 9 ms 12500 KB Output is correct
4 Correct 7 ms 12500 KB Output is correct
5 Correct 7 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12500 KB Output is correct
8 Correct 7 ms 12500 KB Output is correct
9 Correct 7 ms 12580 KB Output is correct
10 Correct 7 ms 12500 KB Output is correct
11 Correct 7 ms 12500 KB Output is correct
12 Correct 7 ms 12500 KB Output is correct
13 Correct 6 ms 12500 KB Output is correct
14 Correct 7 ms 12500 KB Output is correct
15 Correct 7 ms 12500 KB Output is correct
16 Correct 8 ms 12500 KB Output is correct
17 Correct 7 ms 12500 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 7 ms 12500 KB Output is correct
20 Correct 8 ms 12576 KB Output is correct
21 Correct 8 ms 12540 KB Output is correct
22 Correct 8 ms 12500 KB Output is correct
23 Correct 7 ms 12500 KB Output is correct
24 Correct 7 ms 12500 KB Output is correct
25 Correct 7 ms 12500 KB Output is correct
26 Correct 7 ms 12528 KB Output is correct
27 Correct 8 ms 12500 KB Output is correct
28 Correct 7 ms 12500 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 7 ms 12500 KB Output is correct
3 Correct 9 ms 12500 KB Output is correct
4 Correct 7 ms 12500 KB Output is correct
5 Correct 7 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12500 KB Output is correct
8 Correct 7 ms 12500 KB Output is correct
9 Correct 7 ms 12580 KB Output is correct
10 Correct 7 ms 12500 KB Output is correct
11 Correct 7 ms 12500 KB Output is correct
12 Correct 7 ms 12500 KB Output is correct
13 Correct 6 ms 12500 KB Output is correct
14 Correct 7 ms 12500 KB Output is correct
15 Correct 7 ms 12500 KB Output is correct
16 Correct 8 ms 12500 KB Output is correct
17 Correct 7 ms 12500 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 7 ms 12500 KB Output is correct
20 Correct 8 ms 12576 KB Output is correct
21 Correct 8 ms 12540 KB Output is correct
22 Correct 8 ms 12500 KB Output is correct
23 Correct 7 ms 12500 KB Output is correct
24 Correct 7 ms 12500 KB Output is correct
25 Correct 7 ms 12500 KB Output is correct
26 Correct 7 ms 12528 KB Output is correct
27 Correct 8 ms 12500 KB Output is correct
28 Correct 7 ms 12500 KB Output is correct
29 Correct 140 ms 12780 KB Output is correct
30 Correct 58 ms 12604 KB Output is correct
31 Correct 58 ms 12620 KB Output is correct
32 Correct 31 ms 12584 KB Output is correct
33 Correct 11 ms 12584 KB Output is correct
34 Correct 97 ms 12600 KB Output is correct
35 Correct 118 ms 12644 KB Output is correct
36 Correct 90 ms 12584 KB Output is correct
37 Correct 58 ms 12600 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 7 ms 12500 KB Output is correct
3 Correct 9 ms 12500 KB Output is correct
4 Correct 7 ms 12500 KB Output is correct
5 Correct 7 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12500 KB Output is correct
8 Correct 7 ms 12500 KB Output is correct
9 Correct 7 ms 12580 KB Output is correct
10 Correct 7 ms 12500 KB Output is correct
11 Correct 7 ms 12500 KB Output is correct
12 Correct 7 ms 12500 KB Output is correct
13 Correct 6 ms 12500 KB Output is correct
14 Correct 7 ms 12500 KB Output is correct
15 Correct 7 ms 12500 KB Output is correct
16 Correct 8 ms 12500 KB Output is correct
17 Correct 7 ms 12500 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 7 ms 12500 KB Output is correct
20 Correct 8 ms 12576 KB Output is correct
21 Correct 8 ms 12540 KB Output is correct
22 Correct 8 ms 12500 KB Output is correct
23 Correct 7 ms 12500 KB Output is correct
24 Correct 7 ms 12500 KB Output is correct
25 Correct 7 ms 12500 KB Output is correct
26 Correct 7 ms 12528 KB Output is correct
27 Correct 8 ms 12500 KB Output is correct
28 Correct 7 ms 12500 KB Output is correct
29 Correct 140 ms 12780 KB Output is correct
30 Correct 58 ms 12604 KB Output is correct
31 Correct 58 ms 12620 KB Output is correct
32 Correct 31 ms 12584 KB Output is correct
33 Correct 11 ms 12584 KB Output is correct
34 Correct 97 ms 12600 KB Output is correct
35 Correct 118 ms 12644 KB Output is correct
36 Correct 90 ms 12584 KB Output is correct
37 Correct 58 ms 12600 KB Output is correct
38 Correct 4886 ms 14552 KB Output is correct
39 Correct 258 ms 31076 KB Output is correct
40 Correct 3773 ms 14284 KB Output is correct
41 Correct 2896 ms 13448 KB Output is correct
42 Correct 2684 ms 14644 KB Output is correct
43 Correct 64 ms 13268 KB Output is correct
44 Correct 2268 ms 12880 KB Output is correct
45 Correct 288 ms 24928 KB Output is correct
46 Correct 269 ms 24812 KB Output is correct
47 Correct 428 ms 27580 KB Output is correct
48 Correct 492 ms 27596 KB Output is correct
49 Correct 381 ms 25052 KB Output is correct
50 Correct 379 ms 25036 KB Output is correct
51 Correct 96 ms 25660 KB Output is correct
52 Correct 99 ms 25732 KB Output is correct
53 Correct 1967 ms 13388 KB Output is correct
54 Correct 268 ms 24712 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 8 ms 12500 KB Output is correct
4 Correct 7 ms 12500 KB Output is correct
5 Correct 47 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12628 KB Output is correct
8 Correct 6 ms 12500 KB Output is correct
9 Correct 6 ms 12500 KB Output is correct
10 Correct 7 ms 12500 KB Output is correct
11 Correct 6 ms 12500 KB Output is correct
12 Correct 87 ms 12588 KB Output is correct
13 Correct 1047 ms 12620 KB Output is correct
14 Correct 431 ms 12580 KB Output is correct
15 Correct 800 ms 12592 KB Output is correct
16 Correct 131 ms 25096 KB Output is correct
17 Execution timed out 5086 ms 28168 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12560 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 18 ms 12592 KB Output is correct
5 Correct 27 ms 12592 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 8 ms 12500 KB Output is correct
8 Correct 143 ms 12612 KB Output is correct
9 Correct 4819 ms 14512 KB Output is correct
10 Correct 243 ms 31064 KB Output is correct
11 Correct 43 ms 12580 KB Output is correct
12 Correct 1496 ms 12652 KB Output is correct
13 Execution timed out 5075 ms 43888 KB Time limit exceeded
14 Halted 0 ms 0 KB -