oj.uz

답안 #725024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725024 2023-04-16T13:08:32 Z berr Jail (JOI22_jail) C++17
5 / 100
 5000 ms 45688 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, taa=0;


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



    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 || x==-1 || y==-1 ) 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 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;
 
    }

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

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


        while(!ia(x, y)){

            int l=qs[x];
            if (c(i, l)) adj2[i].push_back(l);


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

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


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

            x=par[x][0];
        }

        int l=qs[x];
        if (c(i, l)) adj2[i].push_back(l);


            if(c2(i, l)) flag = 0;
                    l=qe[x];

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

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

         while(!ia(y, x)){
            int l=qs[y];

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


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

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


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

            y=par[y][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 12500 KB Output is correct
2 Correct 6 ms 12480 KB Output is correct
3 Correct 6 ms 12500 KB Output is correct
4 Correct 17 ms 12592 KB Output is correct
5 Correct 28 ms 12588 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 7 ms 12536 KB Output is correct
8 Correct 46 ms 12680 KB Output is correct
9 Correct 1442 ms 15512 KB Output is correct
10 Correct 671 ms 31164 KB Output is correct
11 Correct 26 ms 12500 KB Output is correct
12 Correct 696 ms 12720 KB Output is correct
13 Execution timed out 5052 ms 45688 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 7 ms 12548 KB Output is correct
5 Correct 8 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12556 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 7 ms 12500 KB Output is correct
10 Correct 8 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 7 ms 12500 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 7 ms 12548 KB Output is correct
5 Correct 8 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12556 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 7 ms 12500 KB Output is correct
10 Correct 8 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 7 ms 12500 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 6 ms 12500 KB Output is correct
16 Correct 7 ms 12500 KB Output is correct
17 Correct 8 ms 12532 KB Output is correct
18 Correct 7 ms 12500 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 7 ms 12500 KB Output is correct
21 Correct 7 ms 12500 KB Output is correct
22 Correct 7 ms 12492 KB Output is correct
23 Correct 6 ms 12500 KB Output is correct
24 Incorrect 7 ms 12500 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 7 ms 12548 KB Output is correct
5 Correct 8 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12556 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 7 ms 12500 KB Output is correct
10 Correct 8 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 7 ms 12500 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 6 ms 12500 KB Output is correct
16 Correct 7 ms 12500 KB Output is correct
17 Correct 8 ms 12532 KB Output is correct
18 Correct 7 ms 12500 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 7 ms 12500 KB Output is correct
21 Correct 7 ms 12500 KB Output is correct
22 Correct 7 ms 12492 KB Output is correct
23 Correct 6 ms 12500 KB Output is correct
24 Incorrect 7 ms 12500 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 7 ms 12548 KB Output is correct
5 Correct 8 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12556 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 7 ms 12500 KB Output is correct
10 Correct 8 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 7 ms 12500 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 6 ms 12500 KB Output is correct
16 Correct 7 ms 12500 KB Output is correct
17 Correct 8 ms 12532 KB Output is correct
18 Correct 7 ms 12500 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 7 ms 12500 KB Output is correct
21 Correct 7 ms 12500 KB Output is correct
22 Correct 7 ms 12492 KB Output is correct
23 Correct 6 ms 12500 KB Output is correct
24 Incorrect 7 ms 12500 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12476 KB Output is correct
2 Correct 6 ms 12504 KB Output is correct
3 Correct 7 ms 12500 KB Output is correct
4 Correct 6 ms 12500 KB Output is correct
5 Correct 28 ms 12516 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 7 ms 12500 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 8 ms 12500 KB Output is correct
10 Incorrect 8 ms 12500 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12500 KB Output is correct
2 Correct 6 ms 12480 KB Output is correct
3 Correct 6 ms 12500 KB Output is correct
4 Correct 17 ms 12592 KB Output is correct
5 Correct 28 ms 12588 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 7 ms 12536 KB Output is correct
8 Correct 46 ms 12680 KB Output is correct
9 Correct 1442 ms 15512 KB Output is correct
10 Correct 671 ms 31164 KB Output is correct
11 Correct 26 ms 12500 KB Output is correct
12 Correct 696 ms 12720 KB Output is correct
13 Execution timed out 5052 ms 45688 KB Time limit exceeded
14 Halted 0 ms 0 KB -