oj.uz

Submission #546941

# Submission time Handle Problem Language Result Execution time Memory
546941 2022-04-09T03:36:25 Z ngrace Jail (JOI22_jail) C++14
61 / 100
 5000 ms 26728 KB 
#include <vector>
#include <iostream>
#include <utility>
#include <set>
#include <algorithm>
using namespace std;
#define v vector
#define pii pair<int,int>
#define fi first
#define se second

int N,M;
int anc=20;
v<v<int>> adj;
v<int> depth;
v<v<int>> par;
void dfs(int cur, int from){
    if(depth[cur]!=-1) return;
    depth[cur]=depth[from]+1;
    par[cur][0]=from;
    for(int it:adj[cur]) dfs(it, cur);
}
bool is_anc(int cur, int other){
    for(int i=anc-1; i>=0; i--){
        if(depth[par[cur][i]]>=depth[other]) cur=par[cur][i];
    }
    if(cur==other) return true;
    return false;
}

int lca(int a, int b){
    if(depth[a]<depth[b]) swap(a,b);
    for(int i=anc-1; i>=0; i--){
        if(depth[par[a][i]]>=depth[b]) a=par[a][i];
    }
    if(a==b) return a;
    for(int i=anc-1; i>=0; i--){
        if(par[a][i]!=par[b][i]){
            a=par[a][i];
            b=par[b][i];
        }
    }
    return par[a][0];
}
bool path(int a, int b, int c){//does c lie on the path of a and b
    int l=lca(a,b);
    if(is_anc(c,l) && (is_anc(a,c)||is_anc(b,c))) return true;
    return false;
}

v<bool> prevrec;
v<bool> vis;
bool find_cycle(int cur){
    if(!vis[cur]){
        vis[cur]=true;
        prevrec[cur]=true;
        for(int it:adj[cur]){
            if(!vis[it] && find_cycle(it)){
                return true;
            }
            else if(prevrec[it]){
                return true;
            }
        }
    }
    prevrec[cur]=false;
    return false;
}

int main(){
    int Q;
    cin>>Q;
    for(int q=0;q<Q;q++){
        cin>>N;
        adj=v<v<int>>(N);
        for(int i=0; i<N-1; i++){
            int a,b;
            cin>>a>>b;
            a--;
            b--;
            adj[a].push_back(b);
            adj[b].push_back(a);
        }

        depth=v<int>(N,-1);
        par=v<v<int>>(N,v<int>(anc,-1));
        dfs(0,0);
        for(int i=1; i<anc; i++){
            for(int j=0; j<N; j++){
                par[j][i]=par[par[j][i-1]][i-1];
            }
        }

        cin>>M;
        v<pii> rooms(M);
        for(int i=0; i<M; i++){
            cin>>rooms[i].fi>>rooms[i].se;
            rooms[i].fi--;
            rooms[i].se--;
        }

        adj = v<v<int>>(M);
        for(int i=0; i<M; i++){
            for(int j=0; j<M; j++){
                if(i==j) continue;
                bool sj=path(rooms[i].fi, rooms[i].se, rooms[j].fi);
                bool ej=path(rooms[i].fi, rooms[i].se, rooms[j].se);

                if(sj) adj[j].push_back(i);
                if(ej) adj[i].push_back(j);
            }
        }


        bool cycle=false;
        vis = v<bool>(M,false);
        prevrec = v<bool>(M,false);
        for(int i=0; i<M; i++){
            if(!vis[i] && find_cycle(i)){
                cycle=true;
                break;
            }
        }

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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 36 ms 256 KB Output is correct
5 Correct 78 ms 212 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 152 ms 392 KB Output is correct
9 Correct 4006 ms 2784 KB Output is correct
10 Correct 339 ms 25088 KB Output is correct
11 Correct 74 ms 296 KB Output is correct
12 Correct 1768 ms 352 KB Output is correct
13 Execution timed out 5051 ms 26728 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 5 ms 352 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 280 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 5 ms 352 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 280 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 5 ms 380 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 5 ms 352 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 280 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 5 ms 380 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 162 ms 492 KB Output is correct
30 Correct 85 ms 372 KB Output is correct
31 Correct 72 ms 468 KB Output is correct
32 Correct 37 ms 340 KB Output is correct
33 Correct 8 ms 340 KB Output is correct
34 Correct 193 ms 348 KB Output is correct
35 Correct 204 ms 368 KB Output is correct
36 Correct 157 ms 332 KB Output is correct
37 Correct 80 ms 340 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 5 ms 352 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 280 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 5 ms 380 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 162 ms 492 KB Output is correct
30 Correct 85 ms 372 KB Output is correct
31 Correct 72 ms 468 KB Output is correct
32 Correct 37 ms 340 KB Output is correct
33 Correct 8 ms 340 KB Output is correct
34 Correct 193 ms 348 KB Output is correct
35 Correct 204 ms 368 KB Output is correct
36 Correct 157 ms 332 KB Output is correct
37 Correct 80 ms 340 KB Output is correct
38 Correct 4043 ms 2764 KB Output is correct
39 Correct 331 ms 25152 KB Output is correct
40 Correct 4562 ms 2128 KB Output is correct
41 Correct 4534 ms 2108 KB Output is correct
42 Correct 4760 ms 2172 KB Output is correct
43 Correct 135 ms 2120 KB Output is correct
44 Correct 4905 ms 600 KB Output is correct
45 Correct 413 ms 21428 KB Output is correct
46 Correct 384 ms 21528 KB Output is correct
47 Correct 551 ms 23372 KB Output is correct
48 Correct 558 ms 23380 KB Output is correct
49 Correct 399 ms 21452 KB Output is correct
50 Correct 419 ms 21544 KB Output is correct
51 Correct 157 ms 21964 KB Output is correct
52 Correct 164 ms 22076 KB Output is correct
53 Correct 3796 ms 2212 KB Output is correct
54 Correct 373 ms 21320 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 66 ms 304 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 252 KB Output is correct
12 Correct 173 ms 336 KB Output is correct
13 Correct 1769 ms 324 KB Output is correct
14 Correct 790 ms 332 KB Output is correct
15 Correct 1535 ms 340 KB Output is correct
16 Execution timed out 5093 ms 21824 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 36 ms 256 KB Output is correct
5 Correct 78 ms 212 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 152 ms 392 KB Output is correct
9 Correct 4006 ms 2784 KB Output is correct
10 Correct 339 ms 25088 KB Output is correct
11 Correct 74 ms 296 KB Output is correct
12 Correct 1768 ms 352 KB Output is correct
13 Execution timed out 5051 ms 26728 KB Time limit exceeded
14 Halted 0 ms 0 KB -