oj.uz

답안 #724983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
724983 2023-04-16T12:12:40 Z berr Jail (JOI22_jail) C++17
49 / 100
 5000 ms 25048 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);
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) 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];


    if(x==y) return sum;

    swap(x, y);

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

    sum++;
    return sum;
}

bool c(int x, int y){//  s1 e2    s2 e2
    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(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;
    
    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 (i==z-1) flag = 0;
        else if(vis[i]<z) dfs2(i, z);
    }

}

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

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


}

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);
    }

    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]--;
    }

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

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

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

        }
    }

    for(int i = 0; i < n; i++){


     /*   cout<<i<<" : ";
        for(auto l: adj2[i]) cout<<l<<" ";
            cout<<"\n";
       
*/
        dfs2(i, 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;
    }
}

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 11092 KB Output is correct
2 Correct 8 ms 11092 KB Output is correct
3 Correct 6 ms 11092 KB Output is correct
4 Correct 15 ms 11092 KB Output is correct
5 Correct 27 ms 11800 KB Output is correct
6 Correct 6 ms 11164 KB Output is correct
7 Correct 7 ms 11220 KB Output is correct
8 Correct 148 ms 11292 KB Output is correct
9 Execution timed out 5049 ms 14428 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11092 KB Output is correct
2 Correct 6 ms 11092 KB Output is correct
3 Correct 7 ms 11092 KB Output is correct
4 Correct 7 ms 11180 KB Output is correct
5 Correct 7 ms 11128 KB Output is correct
6 Correct 7 ms 11176 KB Output is correct
7 Correct 7 ms 11268 KB Output is correct
8 Correct 7 ms 11172 KB Output is correct
9 Correct 9 ms 11176 KB Output is correct
10 Correct 7 ms 11220 KB Output is correct
11 Correct 7 ms 11216 KB Output is correct
12 Correct 6 ms 11092 KB Output is correct
13 Correct 6 ms 11172 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11092 KB Output is correct
2 Correct 6 ms 11092 KB Output is correct
3 Correct 7 ms 11092 KB Output is correct
4 Correct 7 ms 11180 KB Output is correct
5 Correct 7 ms 11128 KB Output is correct
6 Correct 7 ms 11176 KB Output is correct
7 Correct 7 ms 11268 KB Output is correct
8 Correct 7 ms 11172 KB Output is correct
9 Correct 9 ms 11176 KB Output is correct
10 Correct 7 ms 11220 KB Output is correct
11 Correct 7 ms 11216 KB Output is correct
12 Correct 6 ms 11092 KB Output is correct
13 Correct 6 ms 11172 KB Output is correct
14 Correct 7 ms 11092 KB Output is correct
15 Correct 7 ms 11160 KB Output is correct
16 Correct 7 ms 11168 KB Output is correct
17 Correct 10 ms 11220 KB Output is correct
18 Correct 9 ms 11172 KB Output is correct
19 Correct 6 ms 11092 KB Output is correct
20 Correct 9 ms 11196 KB Output is correct
21 Correct 9 ms 11172 KB Output is correct
22 Correct 7 ms 11220 KB Output is correct
23 Correct 6 ms 11092 KB Output is correct
24 Correct 7 ms 11084 KB Output is correct
25 Correct 8 ms 11184 KB Output is correct
26 Correct 6 ms 11092 KB Output is correct
27 Correct 7 ms 11220 KB Output is correct
28 Correct 6 ms 11156 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11092 KB Output is correct
2 Correct 6 ms 11092 KB Output is correct
3 Correct 7 ms 11092 KB Output is correct
4 Correct 7 ms 11180 KB Output is correct
5 Correct 7 ms 11128 KB Output is correct
6 Correct 7 ms 11176 KB Output is correct
7 Correct 7 ms 11268 KB Output is correct
8 Correct 7 ms 11172 KB Output is correct
9 Correct 9 ms 11176 KB Output is correct
10 Correct 7 ms 11220 KB Output is correct
11 Correct 7 ms 11216 KB Output is correct
12 Correct 6 ms 11092 KB Output is correct
13 Correct 6 ms 11172 KB Output is correct
14 Correct 7 ms 11092 KB Output is correct
15 Correct 7 ms 11160 KB Output is correct
16 Correct 7 ms 11168 KB Output is correct
17 Correct 10 ms 11220 KB Output is correct
18 Correct 9 ms 11172 KB Output is correct
19 Correct 6 ms 11092 KB Output is correct
20 Correct 9 ms 11196 KB Output is correct
21 Correct 9 ms 11172 KB Output is correct
22 Correct 7 ms 11220 KB Output is correct
23 Correct 6 ms 11092 KB Output is correct
24 Correct 7 ms 11084 KB Output is correct
25 Correct 8 ms 11184 KB Output is correct
26 Correct 6 ms 11092 KB Output is correct
27 Correct 7 ms 11220 KB Output is correct
28 Correct 6 ms 11156 KB Output is correct
29 Correct 152 ms 11240 KB Output is correct
30 Correct 97 ms 11220 KB Output is correct
31 Correct 91 ms 11232 KB Output is correct
32 Correct 78 ms 11220 KB Output is correct
33 Correct 15 ms 11220 KB Output is correct
34 Correct 187 ms 11228 KB Output is correct
35 Correct 194 ms 11260 KB Output is correct
36 Correct 150 ms 11204 KB Output is correct
37 Correct 99 ms 11208 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11092 KB Output is correct
2 Correct 6 ms 11092 KB Output is correct
3 Correct 7 ms 11092 KB Output is correct
4 Correct 7 ms 11180 KB Output is correct
5 Correct 7 ms 11128 KB Output is correct
6 Correct 7 ms 11176 KB Output is correct
7 Correct 7 ms 11268 KB Output is correct
8 Correct 7 ms 11172 KB Output is correct
9 Correct 9 ms 11176 KB Output is correct
10 Correct 7 ms 11220 KB Output is correct
11 Correct 7 ms 11216 KB Output is correct
12 Correct 6 ms 11092 KB Output is correct
13 Correct 6 ms 11172 KB Output is correct
14 Correct 7 ms 11092 KB Output is correct
15 Correct 7 ms 11160 KB Output is correct
16 Correct 7 ms 11168 KB Output is correct
17 Correct 10 ms 11220 KB Output is correct
18 Correct 9 ms 11172 KB Output is correct
19 Correct 6 ms 11092 KB Output is correct
20 Correct 9 ms 11196 KB Output is correct
21 Correct 9 ms 11172 KB Output is correct
22 Correct 7 ms 11220 KB Output is correct
23 Correct 6 ms 11092 KB Output is correct
24 Correct 7 ms 11084 KB Output is correct
25 Correct 8 ms 11184 KB Output is correct
26 Correct 6 ms 11092 KB Output is correct
27 Correct 7 ms 11220 KB Output is correct
28 Correct 6 ms 11156 KB Output is correct
29 Correct 152 ms 11240 KB Output is correct
30 Correct 97 ms 11220 KB Output is correct
31 Correct 91 ms 11232 KB Output is correct
32 Correct 78 ms 11220 KB Output is correct
33 Correct 15 ms 11220 KB Output is correct
34 Correct 187 ms 11228 KB Output is correct
35 Correct 194 ms 11260 KB Output is correct
36 Correct 150 ms 11204 KB Output is correct
37 Correct 99 ms 11208 KB Output is correct
38 Execution timed out 5011 ms 14392 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11092 KB Output is correct
2 Correct 5 ms 11092 KB Output is correct
3 Correct 6 ms 11092 KB Output is correct
4 Correct 5 ms 11084 KB Output is correct
5 Correct 46 ms 11056 KB Output is correct
6 Correct 6 ms 11176 KB Output is correct
7 Correct 7 ms 11092 KB Output is correct
8 Correct 6 ms 11092 KB Output is correct
9 Correct 6 ms 11092 KB Output is correct
10 Correct 7 ms 11092 KB Output is correct
11 Correct 6 ms 11088 KB Output is correct
12 Correct 152 ms 11336 KB Output is correct
13 Correct 1776 ms 11936 KB Output is correct
14 Correct 765 ms 12044 KB Output is correct
15 Correct 1351 ms 11976 KB Output is correct
16 Execution timed out 5043 ms 25048 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11092 KB Output is correct
2 Correct 8 ms 11092 KB Output is correct
3 Correct 6 ms 11092 KB Output is correct
4 Correct 15 ms 11092 KB Output is correct
5 Correct 27 ms 11800 KB Output is correct
6 Correct 6 ms 11164 KB Output is correct
7 Correct 7 ms 11220 KB Output is correct
8 Correct 148 ms 11292 KB Output is correct
9 Execution timed out 5049 ms 14428 KB Time limit exceeded
10 Halted 0 ms 0 KB -