oj.uz

Submission #1040160

# Submission time Handle Problem Language Result Execution time Memory
1040160 2024-07-31T17:19:07 Z Sharky Jail (JOI22_jail) C++17
100 / 100
 1287 ms 213584 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 120008;
const int LG = 19;

int n, m, sz[N], dep[N], node = 0, pr[N][LG], rt[N], tin[N], pa[N], timer = 0, leaf[N * 3], ls[N * 40], rs[N * 40], st[2], vis[N * 40], cyc = 0, col[N * 40];
vector<int> adj[N], g[N * 40];

void dfs(int u) {
    sz[u] = 1;
    for (int i = 1; i < LG; i++) pr[u][i] = pr[pr[u][i - 1]][i - 1];
    for (auto& v : adj[u]) {
        if (v == pr[u][0]) continue;
        pr[v][0] = u;
        dep[v] = dep[u] + 1;
        pa[v] = u;
        dfs(v);
        sz[u] += sz[v];
        if (sz[v] > sz[adj[u][0]]) swap(v, adj[u][0]);
    }
}

void dfs_hld(int u) {
    tin[u] = ++timer;
    for (int v : adj[u]) {
        if (v == pr[u][0]) continue;
        rt[v] = (v == adj[u][0] ? rt[u] : v);
        dfs_hld(v);
    }
}

int jump(int s, int di) {
    for (int i = LG - 1; i >= 0; i--) 
        if (di & (1 << i)) s = pr[s][i];
    return s;
}

int lca(int u, int v) {
    if (dep[u] > dep[v]) swap(u, v);
    v = jump(v, dep[v] - dep[u]);
    if (u == v) return u;
    for (int i = LG - 1; i >= 0; i--) {
        int ut = pr[u][i], vt = pr[v][i];
        if (ut != vt) u = ut, v = vt;
    }
    return pr[u][0];
}

void build(int l, int r, int id, bool up) {
    if (l == r) {
        leaf[l] = id;
        return;
    }
    int mid = (l + r) / 2;
    if (l != mid || !up) {
        ls[id] = ++node;
        build(l, mid, ls[id], up);
    } else ls[id] = leaf[l];
    if (mid + 1 != r || !up) {
        rs[id] = ++node;
        build(mid + 1, r, rs[id], up);
    } else rs[id] = leaf[r];
    if (!up) {
        g[id].push_back(ls[id]);
        g[id].push_back(rs[id]);
    } else {
        g[ls[id]].push_back(id);
        g[rs[id]].push_back(id);
    }
}

void update(int ql, int qr, int v, int l, int r, int id, bool up) {
    if (qr < l || r < ql) return;
    if (ql <= l && r <= qr) {
        if (!up) {
            // cout << "edge: " << v << "-->" << '[' << l << ", " << r << ']' << "\n";
            g[leaf[v]].push_back(id);
        } else {
            // cout << "edge: " << '[' << l << ", " << r << ']' << " --> " << v << "\n";
            g[id].push_back(leaf[v]);
        }
        return;
    }
    int mid = (l + r) / 2;
    update(ql, qr, v, l, mid, ls[id], up);
    update(ql, qr, v, mid + 1, r, rs[id], up);
}

void pti(int x, int l, int r) {
    update(l, r, x, 1, 2 * n + m, st[0], 0);
}

void itp(int x, int l, int r) {
    update(l, r, x, 1, 2 * n + m, st[1], 1);
}

void path(int x, int u, int v, bool b) {
    // cout << x << " " << u << " " << v << " " << b << "\n";
    for (; rt[u] != rt[v]; v = pa[rt[v]]) {
        if (dep[rt[u]] > dep[rt[v]]) swap(u, v);
        if (!b) pti(x + 2 * n, tin[rt[v]] + n, tin[v] + n);
        else itp(x + 2 * n, tin[rt[v]], tin[v]);
    }
    if (dep[u] > dep[v]) swap(u, v);
    if (!b) pti(x + 2 * n, tin[u] + n, tin[v] + n);
    else itp(x + 2 * n, tin[u], tin[v]);
}

bool DFS(int u) {
    col[u] = 1;
    for (int v : g[u]) {
        if (!col[v]) {
            if (DFS(v)) {
                cyc = 1;
                return true;
            }
        } else if (col[v] == 1) {
            cyc = 1;
            return true;
        }
    }
    col[u] = 2;
    return false;
}

void solve() {
    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    cin >> m;
    rt[1] = pr[1][0] = 1;
    dfs(1); dfs_hld(1);
    st[0] = ++node;
    build(1, 2 * n + m, node, 0);
    st[1] = ++node;
    build(1, 2 * n + m, node, 1);
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        int x = lca(u, v);
        g[leaf[n * 2 + i]].push_back(leaf[tin[u]]);
        g[leaf[tin[v] + n]].push_back(leaf[n * 2 + i]);
        // cout << "edge: " << n * 2 + i << " --> " << tin[u] << '\n';
        // cout << "edge: " << tin[v] + n << " --> " << n * 2 + i << '\n';
        int d = max(dep[u], dep[v]) - dep[x] - 1;
        if (u != x) {
            path(i, pa[u], v, 1);
        } else {
            path(i, jump(v, d), v, 1);
        }
        if (v != x) {
            path(i, u, pa[v], 0);
        } else {
            path(i, u, jump(u, d), 0);
        }
    }
    // for (int i = 1; i <= node; i++) for (int j : g[i]) cout << i << " --> " << j << '\n';
    for (int i = 1; i <= node; i++) if (!col[i] && DFS(i)) break;
    cout << (cyc ? "No" : "Yes") << '\n';
    for (int i = 1; i <= n; i++) {
        sz[i] = dep[i] = rt[i] = tin[i] = pa[i] = 0;
        adj[i].clear();
        for (int j = 0; j < LG; j++) pr[i][j] = 0;
    }
    for (int i = 1; i <= n * 3; i++) leaf[i] = 0;
    for (int i = 1; i <= node; i++) {
        g[i].clear();
        ls[i] = rs[i] = col[i] = vis[i] = 0;
    }
    timer = cyc = node = st[0] = st[1] = 0;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int q;
    cin >> q;
    while (q--) solve();   
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 117584 KB Output is correct
2 Correct 34 ms 117592 KB Output is correct
3 Correct 34 ms 117584 KB Output is correct
4 Correct 50 ms 117588 KB Output is correct
5 Correct 56 ms 117588 KB Output is correct
6 Correct 34 ms 117596 KB Output is correct
7 Correct 35 ms 117596 KB Output is correct
8 Correct 35 ms 117596 KB Output is correct
9 Correct 62 ms 120660 KB Output is correct
10 Correct 112 ms 175844 KB Output is correct
11 Correct 37 ms 117584 KB Output is correct
12 Correct 68 ms 117596 KB Output is correct
13 Correct 175 ms 186192 KB Output is correct
14 Correct 155 ms 186456 KB Output is correct
15 Correct 274 ms 191316 KB Output is correct
16 Correct 452 ms 213584 KB Output is correct
17 Correct 216 ms 196688 KB Output is correct
18 Correct 182 ms 192336 KB Output is correct
19 Correct 201 ms 195668 KB Output is correct
20 Correct 193 ms 195664 KB Output is correct
21 Correct 203 ms 196304 KB Output is correct
22 Correct 129 ms 183892 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 39 ms 117584 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 34 ms 117724 KB Output is correct
5 Correct 37 ms 117588 KB Output is correct
6 Correct 38 ms 117588 KB Output is correct
7 Correct 37 ms 117584 KB Output is correct
8 Correct 36 ms 117584 KB Output is correct
9 Correct 38 ms 117596 KB Output is correct
10 Correct 36 ms 117596 KB Output is correct
11 Correct 37 ms 117592 KB Output is correct
12 Correct 39 ms 117680 KB Output is correct
13 Correct 37 ms 117596 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 39 ms 117584 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 34 ms 117724 KB Output is correct
5 Correct 37 ms 117588 KB Output is correct
6 Correct 38 ms 117588 KB Output is correct
7 Correct 37 ms 117584 KB Output is correct
8 Correct 36 ms 117584 KB Output is correct
9 Correct 38 ms 117596 KB Output is correct
10 Correct 36 ms 117596 KB Output is correct
11 Correct 37 ms 117592 KB Output is correct
12 Correct 39 ms 117680 KB Output is correct
13 Correct 37 ms 117596 KB Output is correct
14 Correct 37 ms 117592 KB Output is correct
15 Correct 38 ms 117588 KB Output is correct
16 Correct 39 ms 117592 KB Output is correct
17 Correct 36 ms 117688 KB Output is correct
18 Correct 35 ms 117588 KB Output is correct
19 Correct 35 ms 117512 KB Output is correct
20 Correct 37 ms 117516 KB Output is correct
21 Correct 38 ms 117588 KB Output is correct
22 Correct 36 ms 117584 KB Output is correct
23 Correct 38 ms 117588 KB Output is correct
24 Correct 36 ms 117848 KB Output is correct
25 Correct 38 ms 117588 KB Output is correct
26 Correct 35 ms 117592 KB Output is correct
27 Correct 40 ms 117584 KB Output is correct
28 Correct 38 ms 117588 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 39 ms 117584 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 34 ms 117724 KB Output is correct
5 Correct 37 ms 117588 KB Output is correct
6 Correct 38 ms 117588 KB Output is correct
7 Correct 37 ms 117584 KB Output is correct
8 Correct 36 ms 117584 KB Output is correct
9 Correct 38 ms 117596 KB Output is correct
10 Correct 36 ms 117596 KB Output is correct
11 Correct 37 ms 117592 KB Output is correct
12 Correct 39 ms 117680 KB Output is correct
13 Correct 37 ms 117596 KB Output is correct
14 Correct 37 ms 117592 KB Output is correct
15 Correct 38 ms 117588 KB Output is correct
16 Correct 39 ms 117592 KB Output is correct
17 Correct 36 ms 117688 KB Output is correct
18 Correct 35 ms 117588 KB Output is correct
19 Correct 35 ms 117512 KB Output is correct
20 Correct 37 ms 117516 KB Output is correct
21 Correct 38 ms 117588 KB Output is correct
22 Correct 36 ms 117584 KB Output is correct
23 Correct 38 ms 117588 KB Output is correct
24 Correct 36 ms 117848 KB Output is correct
25 Correct 38 ms 117588 KB Output is correct
26 Correct 35 ms 117592 KB Output is correct
27 Correct 40 ms 117584 KB Output is correct
28 Correct 38 ms 117588 KB Output is correct
29 Correct 36 ms 117592 KB Output is correct
30 Correct 40 ms 117624 KB Output is correct
31 Correct 38 ms 117584 KB Output is correct
32 Correct 38 ms 117588 KB Output is correct
33 Correct 38 ms 117588 KB Output is correct
34 Correct 42 ms 117596 KB Output is correct
35 Correct 38 ms 117596 KB Output is correct
36 Correct 40 ms 117588 KB Output is correct
37 Correct 39 ms 117588 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 39 ms 117584 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 34 ms 117724 KB Output is correct
5 Correct 37 ms 117588 KB Output is correct
6 Correct 38 ms 117588 KB Output is correct
7 Correct 37 ms 117584 KB Output is correct
8 Correct 36 ms 117584 KB Output is correct
9 Correct 38 ms 117596 KB Output is correct
10 Correct 36 ms 117596 KB Output is correct
11 Correct 37 ms 117592 KB Output is correct
12 Correct 39 ms 117680 KB Output is correct
13 Correct 37 ms 117596 KB Output is correct
14 Correct 37 ms 117592 KB Output is correct
15 Correct 38 ms 117588 KB Output is correct
16 Correct 39 ms 117592 KB Output is correct
17 Correct 36 ms 117688 KB Output is correct
18 Correct 35 ms 117588 KB Output is correct
19 Correct 35 ms 117512 KB Output is correct
20 Correct 37 ms 117516 KB Output is correct
21 Correct 38 ms 117588 KB Output is correct
22 Correct 36 ms 117584 KB Output is correct
23 Correct 38 ms 117588 KB Output is correct
24 Correct 36 ms 117848 KB Output is correct
25 Correct 38 ms 117588 KB Output is correct
26 Correct 35 ms 117592 KB Output is correct
27 Correct 40 ms 117584 KB Output is correct
28 Correct 38 ms 117588 KB Output is correct
29 Correct 36 ms 117592 KB Output is correct
30 Correct 40 ms 117624 KB Output is correct
31 Correct 38 ms 117584 KB Output is correct
32 Correct 38 ms 117588 KB Output is correct
33 Correct 38 ms 117588 KB Output is correct
34 Correct 42 ms 117596 KB Output is correct
35 Correct 38 ms 117596 KB Output is correct
36 Correct 40 ms 117588 KB Output is correct
37 Correct 39 ms 117588 KB Output is correct
38 Correct 65 ms 120656 KB Output is correct
39 Correct 117 ms 175716 KB Output is correct
40 Correct 82 ms 120620 KB Output is correct
41 Correct 98 ms 120660 KB Output is correct
42 Correct 76 ms 120660 KB Output is correct
43 Correct 60 ms 120152 KB Output is correct
44 Correct 57 ms 118352 KB Output is correct
45 Correct 119 ms 166480 KB Output is correct
46 Correct 132 ms 166480 KB Output is correct
47 Correct 116 ms 171092 KB Output is correct
48 Correct 113 ms 171092 KB Output is correct
49 Correct 104 ms 166484 KB Output is correct
50 Correct 115 ms 166484 KB Output is correct
51 Correct 106 ms 167760 KB Output is correct
52 Correct 108 ms 167896 KB Output is correct
53 Correct 51 ms 120916 KB Output is correct
54 Correct 134 ms 166228 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 117588 KB Output is correct
2 Correct 38 ms 117596 KB Output is correct
3 Correct 36 ms 117588 KB Output is correct
4 Correct 36 ms 117596 KB Output is correct
5 Correct 42 ms 117532 KB Output is correct
6 Correct 47 ms 117588 KB Output is correct
7 Correct 40 ms 117584 KB Output is correct
8 Correct 38 ms 117596 KB Output is correct
9 Correct 44 ms 117600 KB Output is correct
10 Correct 37 ms 117596 KB Output is correct
11 Correct 38 ms 117588 KB Output is correct
12 Correct 40 ms 117588 KB Output is correct
13 Correct 99 ms 117656 KB Output is correct
14 Correct 87 ms 117588 KB Output is correct
15 Correct 79 ms 117588 KB Output is correct
16 Correct 177 ms 169452 KB Output is correct
17 Correct 514 ms 184528 KB Output is correct
18 Correct 907 ms 202884 KB Output is correct
19 Correct 301 ms 172788 KB Output is correct
20 Correct 258 ms 172784 KB Output is correct
21 Correct 318 ms 172832 KB Output is correct
22 Correct 513 ms 184272 KB Output is correct
23 Correct 403 ms 184296 KB Output is correct
24 Correct 500 ms 183812 KB Output is correct
25 Correct 427 ms 184528 KB Output is correct
26 Correct 475 ms 184388 KB Output is correct
27 Correct 406 ms 186956 KB Output is correct
28 Correct 394 ms 195708 KB Output is correct
29 Correct 347 ms 187212 KB Output is correct
30 Correct 315 ms 180756 KB Output is correct
31 Correct 311 ms 183504 KB Output is correct
32 Correct 316 ms 180824 KB Output is correct
33 Correct 303 ms 183656 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 117584 KB Output is correct
2 Correct 34 ms 117592 KB Output is correct
3 Correct 34 ms 117584 KB Output is correct
4 Correct 50 ms 117588 KB Output is correct
5 Correct 56 ms 117588 KB Output is correct
6 Correct 34 ms 117596 KB Output is correct
7 Correct 35 ms 117596 KB Output is correct
8 Correct 35 ms 117596 KB Output is correct
9 Correct 62 ms 120660 KB Output is correct
10 Correct 112 ms 175844 KB Output is correct
11 Correct 37 ms 117584 KB Output is correct
12 Correct 68 ms 117596 KB Output is correct
13 Correct 175 ms 186192 KB Output is correct
14 Correct 155 ms 186456 KB Output is correct
15 Correct 274 ms 191316 KB Output is correct
16 Correct 452 ms 213584 KB Output is correct
17 Correct 216 ms 196688 KB Output is correct
18 Correct 182 ms 192336 KB Output is correct
19 Correct 201 ms 195668 KB Output is correct
20 Correct 193 ms 195664 KB Output is correct
21 Correct 203 ms 196304 KB Output is correct
22 Correct 129 ms 183892 KB Output is correct
23 Correct 32 ms 117592 KB Output is correct
24 Correct 39 ms 117584 KB Output is correct
25 Correct 34 ms 117592 KB Output is correct
26 Correct 34 ms 117724 KB Output is correct
27 Correct 37 ms 117588 KB Output is correct
28 Correct 38 ms 117588 KB Output is correct
29 Correct 37 ms 117584 KB Output is correct
30 Correct 36 ms 117584 KB Output is correct
31 Correct 38 ms 117596 KB Output is correct
32 Correct 36 ms 117596 KB Output is correct
33 Correct 37 ms 117592 KB Output is correct
34 Correct 39 ms 117680 KB Output is correct
35 Correct 37 ms 117596 KB Output is correct
36 Correct 37 ms 117592 KB Output is correct
37 Correct 38 ms 117588 KB Output is correct
38 Correct 39 ms 117592 KB Output is correct
39 Correct 36 ms 117688 KB Output is correct
40 Correct 35 ms 117588 KB Output is correct
41 Correct 35 ms 117512 KB Output is correct
42 Correct 37 ms 117516 KB Output is correct
43 Correct 38 ms 117588 KB Output is correct
44 Correct 36 ms 117584 KB Output is correct
45 Correct 38 ms 117588 KB Output is correct
46 Correct 36 ms 117848 KB Output is correct
47 Correct 38 ms 117588 KB Output is correct
48 Correct 35 ms 117592 KB Output is correct
49 Correct 40 ms 117584 KB Output is correct
50 Correct 38 ms 117588 KB Output is correct
51 Correct 36 ms 117592 KB Output is correct
52 Correct 40 ms 117624 KB Output is correct
53 Correct 38 ms 117584 KB Output is correct
54 Correct 38 ms 117588 KB Output is correct
55 Correct 38 ms 117588 KB Output is correct
56 Correct 42 ms 117596 KB Output is correct
57 Correct 38 ms 117596 KB Output is correct
58 Correct 40 ms 117588 KB Output is correct
59 Correct 39 ms 117588 KB Output is correct
60 Correct 65 ms 120656 KB Output is correct
61 Correct 117 ms 175716 KB Output is correct
62 Correct 82 ms 120620 KB Output is correct
63 Correct 98 ms 120660 KB Output is correct
64 Correct 76 ms 120660 KB Output is correct
65 Correct 60 ms 120152 KB Output is correct
66 Correct 57 ms 118352 KB Output is correct
67 Correct 119 ms 166480 KB Output is correct
68 Correct 132 ms 166480 KB Output is correct
69 Correct 116 ms 171092 KB Output is correct
70 Correct 113 ms 171092 KB Output is correct
71 Correct 104 ms 166484 KB Output is correct
72 Correct 115 ms 166484 KB Output is correct
73 Correct 106 ms 167760 KB Output is correct
74 Correct 108 ms 167896 KB Output is correct
75 Correct 51 ms 120916 KB Output is correct
76 Correct 134 ms 166228 KB Output is correct
77 Correct 36 ms 117588 KB Output is correct
78 Correct 38 ms 117596 KB Output is correct
79 Correct 36 ms 117588 KB Output is correct
80 Correct 36 ms 117596 KB Output is correct
81 Correct 42 ms 117532 KB Output is correct
82 Correct 47 ms 117588 KB Output is correct
83 Correct 40 ms 117584 KB Output is correct
84 Correct 38 ms 117596 KB Output is correct
85 Correct 44 ms 117600 KB Output is correct
86 Correct 37 ms 117596 KB Output is correct
87 Correct 38 ms 117588 KB Output is correct
88 Correct 40 ms 117588 KB Output is correct
89 Correct 99 ms 117656 KB Output is correct
90 Correct 87 ms 117588 KB Output is correct
91 Correct 79 ms 117588 KB Output is correct
92 Correct 177 ms 169452 KB Output is correct
93 Correct 514 ms 184528 KB Output is correct
94 Correct 907 ms 202884 KB Output is correct
95 Correct 301 ms 172788 KB Output is correct
96 Correct 258 ms 172784 KB Output is correct
97 Correct 318 ms 172832 KB Output is correct
98 Correct 513 ms 184272 KB Output is correct
99 Correct 403 ms 184296 KB Output is correct
100 Correct 500 ms 183812 KB Output is correct
101 Correct 427 ms 184528 KB Output is correct
102 Correct 475 ms 184388 KB Output is correct
103 Correct 406 ms 186956 KB Output is correct
104 Correct 394 ms 195708 KB Output is correct
105 Correct 347 ms 187212 KB Output is correct
106 Correct 315 ms 180756 KB Output is correct
107 Correct 311 ms 183504 KB Output is correct
108 Correct 316 ms 180824 KB Output is correct
109 Correct 303 ms 183656 KB Output is correct
110 Correct 83 ms 117824 KB Output is correct
111 Correct 59 ms 117704 KB Output is correct
112 Correct 327 ms 190320 KB Output is correct
113 Correct 227 ms 179024 KB Output is correct
114 Correct 258 ms 190672 KB Output is correct
115 Correct 127 ms 168388 KB Output is correct
116 Correct 261 ms 177232 KB Output is correct
117 Correct 1287 ms 212932 KB Output is correct
118 Correct 144 ms 167956 KB Output is correct
119 Correct 156 ms 170576 KB Output is correct
120 Correct 59 ms 122656 KB Output is correct
121 Correct 434 ms 183604 KB Output is correct
122 Correct 372 ms 180624 KB Output is correct
123 Correct 266 ms 181720 KB Output is correct
124 Correct 216 ms 181924 KB Output is correct
125 Correct 258 ms 182868 KB Output is correct
126 Correct 601 ms 212516 KB Output is correct
127 Correct 307 ms 195304 KB Output is correct
128 Correct 246 ms 194616 KB Output is correct
129 Correct 277 ms 194488 KB Output is correct
130 Correct 255 ms 193984 KB Output is correct