oj.uz

Submission #994096

# Submission time Handle Problem Language Result Execution time Memory
994096 2024-06-07T06:18:07 Z vjudge1 Jail (JOI22_jail) C++17
72 / 100
 2035 ms 1048576 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int logn = 20;
 
vector<vector<int>> g, idxs, g2;
 
vector<vector<int>> lca;
vector<int> in, out;
 
inline bool parent(int a, int b) { return in[a] <= in[b] && out[b] <= out[a]; }
 
int get_lca(int a, int b){
    if(parent(a, b)) return a;
    for(int i = logn-1; i >= 0; i--){
        if(!parent(lca[a][i], b)){
            a = lca[a][i];
        }
    }
    return lca[a][0];
}
 
int ido = 0;
void dfs(int x, int p){
    lca[x][0] = p;
    in[x] = ido++;
    for(int y : g[x]){
        if(y != p){
            dfs(y, x);
        }
    }
    out[x] = ido++;
}
 
void walk_up(int a, int c, int idx){
    while(a != c){
        idxs[a].push_back(idx);
        a = lca[a][0];
    }
}
 
void update(int a, int b, int idx){
    int c = get_lca(a,  b);
    walk_up(a, c, idx);
    walk_up(b, c, idx);
    idxs[c].push_back(idx);
}
 
vector<bool> vis, done;
bool dfs2(int x){
    vis[x] = true;
    bool res = true;
    for(int y : g2[x]){
        if(!vis[y]){
            res = res && dfs2(y);
        } else if(!done[y]){
            return false;
        }
    }
    done[x] = true;
    return res;
}
 
void solve(){
    int n;
    cin>>n;
 
    g.assign(n, vector<int>());
    idxs.assign(n, vector<int>());
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin>>a>>b;
        --a, --b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
 
    lca.assign(n, vector<int>(logn, 0));
    in.assign(n, 0);
    out.assign(n, 0);
    ido = 0;
    dfs(0, 0);
    for(int j = 1; j < 20; j++){
        for(int i = 0; i < n; i++){
            lca[i][j] = lca[lca[i][j-1]][j-1];
        }
    }
 
    int m;
    cin>>m;
    vector<pair<int, int>> query(m);
    g2.assign(m, vector<int>());
    for(int i = 0; i < m; i++){
        int a, b;
        cin>>a>>b;
        --a, --b;
        query[i] = {a, b};
 
        update(a, b, i);
    }
 
    for(int i = 0; i < m; i++){
        for(int x : idxs[query[i].first]){
            if(i != x) g2[x].push_back(i);
        }
        for(int x : idxs[query[i].second]){
            if(i != x) g2[i].push_back(x);
        }
    }
 
    vis.assign(m, false);
    done.assign(m, false);
    bool ok = true;
    for(int i = 0; i < m; i++){
        if(!vis[i]){
            ok = ok && dfs2(i);
        }
    }
 
    cout << (ok ? "Yes" : "No") <<'\n';
}
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int t;
    cin>>t;
    while(t--) solve();
 
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 7 ms 724 KB Output is correct
5 Correct 16 ms 1104 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 104 ms 16980 KB Output is correct
10 Correct 649 ms 275340 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 28 ms 1368 KB Output is correct
13 Correct 159 ms 100948 KB Output is correct
14 Correct 196 ms 131404 KB Output is correct
15 Runtime error 2035 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 548 KB Output is correct
10 Correct 1 ms 548 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 524 KB Output is correct
13 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 548 KB Output is correct
10 Correct 1 ms 548 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 524 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 556 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 692 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 548 KB Output is correct
10 Correct 1 ms 548 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 524 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 556 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 692 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 126 ms 16980 KB Output is correct
39 Correct 670 ms 275536 KB Output is correct
40 Correct 76 ms 9812 KB Output is correct
41 Correct 31 ms 3164 KB Output is correct
42 Correct 40 ms 7248 KB Output is correct
43 Correct 20 ms 2904 KB Output is correct
44 Correct 6 ms 1116 KB Output is correct
45 Correct 54 ms 27004 KB Output is correct
46 Correct 50 ms 26964 KB Output is correct
47 Correct 163 ms 77140 KB Output is correct
48 Correct 177 ms 78160 KB Output is correct
49 Correct 76 ms 29268 KB Output is correct
50 Correct 74 ms 29264 KB Output is correct
51 Correct 44 ms 27224 KB Output is correct
52 Correct 42 ms 27216 KB Output is correct
53 Correct 9 ms 2904 KB Output is correct
54 Correct 57 ms 26452 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 564 KB Output is correct
13 Correct 13 ms 860 KB Output is correct
14 Correct 26 ms 1116 KB Output is correct
15 Correct 16 ms 1116 KB Output is correct
16 Correct 69 ms 28756 KB Output is correct
17 Correct 135 ms 41716 KB Output is correct
18 Correct 273 ms 69412 KB Output is correct
19 Correct 72 ms 30716 KB Output is correct
20 Correct 82 ms 31060 KB Output is correct
21 Correct 79 ms 31052 KB Output is correct
22 Correct 126 ms 43676 KB Output is correct
23 Correct 144 ms 43332 KB Output is correct
24 Correct 112 ms 43336 KB Output is correct
25 Correct 109 ms 43464 KB Output is correct
26 Correct 118 ms 43392 KB Output is correct
27 Correct 142 ms 44012 KB Output is correct
28 Correct 125 ms 45436 KB Output is correct
29 Correct 108 ms 42440 KB Output is correct
30 Correct 115 ms 37172 KB Output is correct
31 Correct 93 ms 37648 KB Output is correct
32 Correct 87 ms 37028 KB Output is correct
33 Correct 94 ms 37836 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 7 ms 724 KB Output is correct
5 Correct 16 ms 1104 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 104 ms 16980 KB Output is correct
10 Correct 649 ms 275340 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 28 ms 1368 KB Output is correct
13 Correct 159 ms 100948 KB Output is correct
14 Correct 196 ms 131404 KB Output is correct
15 Runtime error 2035 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -