oj.uz

Submission #1040162

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

const int N = 120008;
const int LG = 17;

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 * 12], rs[N * 12], st[2], vis[N * 12], cyc = 0, col[N * 12];
vector<int> adj[N], g[N * 12];

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 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 49776 KB Output is correct
4 Correct 16 ms 49928 KB Output is correct
5 Correct 27 ms 49756 KB Output is correct
6 Correct 7 ms 47932 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 37 ms 49924 KB Output is correct
10 Correct 83 ms 100180 KB Output is correct
11 Correct 12 ms 47704 KB Output is correct
12 Correct 40 ms 47896 KB Output is correct
13 Correct 138 ms 111108 KB Output is correct
14 Correct 117 ms 112236 KB Output is correct
15 Correct 219 ms 117076 KB Output is correct
16 Correct 422 ms 139048 KB Output is correct
17 Correct 172 ms 120916 KB Output is correct
18 Correct 152 ms 116820 KB Output is correct
19 Correct 179 ms 120200 KB Output is correct
20 Correct 157 ms 121120 KB Output is correct
21 Correct 163 ms 121828 KB Output is correct
22 Correct 99 ms 109396 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47704 KB Output is correct
2 Correct 7 ms 49756 KB Output is correct
3 Correct 8 ms 47932 KB Output is correct
4 Correct 7 ms 49756 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47772 KB Output is correct
7 Correct 8 ms 49892 KB Output is correct
8 Correct 8 ms 47704 KB Output is correct
9 Correct 8 ms 47916 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 49764 KB Output is correct
13 Correct 7 ms 50008 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47704 KB Output is correct
2 Correct 7 ms 49756 KB Output is correct
3 Correct 8 ms 47932 KB Output is correct
4 Correct 7 ms 49756 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47772 KB Output is correct
7 Correct 8 ms 49892 KB Output is correct
8 Correct 8 ms 47704 KB Output is correct
9 Correct 8 ms 47916 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 49764 KB Output is correct
13 Correct 7 ms 50008 KB Output is correct
14 Correct 6 ms 47708 KB Output is correct
15 Correct 6 ms 47756 KB Output is correct
16 Correct 8 ms 47928 KB Output is correct
17 Correct 7 ms 47704 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 7 ms 47708 KB Output is correct
20 Correct 8 ms 47920 KB Output is correct
21 Correct 8 ms 47704 KB Output is correct
22 Correct 7 ms 49756 KB Output is correct
23 Correct 6 ms 47708 KB Output is correct
24 Correct 6 ms 47876 KB Output is correct
25 Correct 8 ms 47708 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 8 ms 49756 KB Output is correct
28 Correct 7 ms 49752 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47704 KB Output is correct
2 Correct 7 ms 49756 KB Output is correct
3 Correct 8 ms 47932 KB Output is correct
4 Correct 7 ms 49756 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47772 KB Output is correct
7 Correct 8 ms 49892 KB Output is correct
8 Correct 8 ms 47704 KB Output is correct
9 Correct 8 ms 47916 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 49764 KB Output is correct
13 Correct 7 ms 50008 KB Output is correct
14 Correct 6 ms 47708 KB Output is correct
15 Correct 6 ms 47756 KB Output is correct
16 Correct 8 ms 47928 KB Output is correct
17 Correct 7 ms 47704 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 7 ms 47708 KB Output is correct
20 Correct 8 ms 47920 KB Output is correct
21 Correct 8 ms 47704 KB Output is correct
22 Correct 7 ms 49756 KB Output is correct
23 Correct 6 ms 47708 KB Output is correct
24 Correct 6 ms 47876 KB Output is correct
25 Correct 8 ms 47708 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 8 ms 49756 KB Output is correct
28 Correct 7 ms 49752 KB Output is correct
29 Correct 8 ms 47708 KB Output is correct
30 Correct 9 ms 49756 KB Output is correct
31 Correct 8 ms 49756 KB Output is correct
32 Correct 8 ms 49956 KB Output is correct
33 Correct 9 ms 49812 KB Output is correct
34 Correct 9 ms 49908 KB Output is correct
35 Correct 9 ms 49752 KB Output is correct
36 Correct 8 ms 47708 KB Output is correct
37 Correct 8 ms 47708 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47704 KB Output is correct
2 Correct 7 ms 49756 KB Output is correct
3 Correct 8 ms 47932 KB Output is correct
4 Correct 7 ms 49756 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47772 KB Output is correct
7 Correct 8 ms 49892 KB Output is correct
8 Correct 8 ms 47704 KB Output is correct
9 Correct 8 ms 47916 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 49764 KB Output is correct
13 Correct 7 ms 50008 KB Output is correct
14 Correct 6 ms 47708 KB Output is correct
15 Correct 6 ms 47756 KB Output is correct
16 Correct 8 ms 47928 KB Output is correct
17 Correct 7 ms 47704 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 7 ms 47708 KB Output is correct
20 Correct 8 ms 47920 KB Output is correct
21 Correct 8 ms 47704 KB Output is correct
22 Correct 7 ms 49756 KB Output is correct
23 Correct 6 ms 47708 KB Output is correct
24 Correct 6 ms 47876 KB Output is correct
25 Correct 8 ms 47708 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 8 ms 49756 KB Output is correct
28 Correct 7 ms 49752 KB Output is correct
29 Correct 8 ms 47708 KB Output is correct
30 Correct 9 ms 49756 KB Output is correct
31 Correct 8 ms 49756 KB Output is correct
32 Correct 8 ms 49956 KB Output is correct
33 Correct 9 ms 49812 KB Output is correct
34 Correct 9 ms 49908 KB Output is correct
35 Correct 9 ms 49752 KB Output is correct
36 Correct 8 ms 47708 KB Output is correct
37 Correct 8 ms 47708 KB Output is correct
38 Correct 37 ms 49752 KB Output is correct
39 Correct 85 ms 100180 KB Output is correct
40 Correct 61 ms 51592 KB Output is correct
41 Correct 65 ms 49748 KB Output is correct
42 Correct 42 ms 51804 KB Output is correct
43 Correct 30 ms 49540 KB Output is correct
44 Correct 26 ms 50264 KB Output is correct
45 Correct 87 ms 91984 KB Output is correct
46 Correct 93 ms 90964 KB Output is correct
47 Correct 80 ms 95572 KB Output is correct
48 Correct 90 ms 95512 KB Output is correct
49 Correct 75 ms 92228 KB Output is correct
50 Correct 87 ms 90964 KB Output is correct
51 Correct 76 ms 92240 KB Output is correct
52 Correct 67 ms 93264 KB Output is correct
53 Correct 23 ms 50012 KB Output is correct
54 Correct 99 ms 90704 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 6 ms 47708 KB Output is correct
4 Correct 7 ms 49756 KB Output is correct
5 Correct 11 ms 47708 KB Output is correct
6 Correct 7 ms 49752 KB Output is correct
7 Correct 7 ms 49756 KB Output is correct
8 Correct 7 ms 47704 KB Output is correct
9 Correct 9 ms 47764 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 6 ms 49752 KB Output is correct
12 Correct 8 ms 47708 KB Output is correct
13 Correct 36 ms 47908 KB Output is correct
14 Correct 55 ms 47904 KB Output is correct
15 Correct 45 ms 49756 KB Output is correct
16 Correct 132 ms 94672 KB Output is correct
17 Correct 462 ms 110028 KB Output is correct
18 Correct 834 ms 128328 KB Output is correct
19 Correct 257 ms 98384 KB Output is correct
20 Correct 210 ms 99664 KB Output is correct
21 Correct 256 ms 98640 KB Output is correct
22 Correct 441 ms 109696 KB Output is correct
23 Correct 349 ms 109580 KB Output is correct
24 Correct 432 ms 108020 KB Output is correct
25 Correct 376 ms 110032 KB Output is correct
26 Correct 407 ms 108812 KB Output is correct
27 Correct 364 ms 111484 KB Output is correct
28 Correct 326 ms 120904 KB Output is correct
29 Correct 287 ms 111948 KB Output is correct
30 Correct 277 ms 105032 KB Output is correct
31 Correct 275 ms 109004 KB Output is correct
32 Correct 273 ms 105168 KB Output is correct
33 Correct 247 ms 109264 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 49776 KB Output is correct
4 Correct 16 ms 49928 KB Output is correct
5 Correct 27 ms 49756 KB Output is correct
6 Correct 7 ms 47932 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 37 ms 49924 KB Output is correct
10 Correct 83 ms 100180 KB Output is correct
11 Correct 12 ms 47704 KB Output is correct
12 Correct 40 ms 47896 KB Output is correct
13 Correct 138 ms 111108 KB Output is correct
14 Correct 117 ms 112236 KB Output is correct
15 Correct 219 ms 117076 KB Output is correct
16 Correct 422 ms 139048 KB Output is correct
17 Correct 172 ms 120916 KB Output is correct
18 Correct 152 ms 116820 KB Output is correct
19 Correct 179 ms 120200 KB Output is correct
20 Correct 157 ms 121120 KB Output is correct
21 Correct 163 ms 121828 KB Output is correct
22 Correct 99 ms 109396 KB Output is correct
23 Correct 7 ms 47704 KB Output is correct
24 Correct 7 ms 49756 KB Output is correct
25 Correct 8 ms 47932 KB Output is correct
26 Correct 7 ms 49756 KB Output is correct
27 Correct 7 ms 47708 KB Output is correct
28 Correct 7 ms 47772 KB Output is correct
29 Correct 8 ms 49892 KB Output is correct
30 Correct 8 ms 47704 KB Output is correct
31 Correct 8 ms 47916 KB Output is correct
32 Correct 7 ms 47708 KB Output is correct
33 Correct 7 ms 47708 KB Output is correct
34 Correct 7 ms 49764 KB Output is correct
35 Correct 7 ms 50008 KB Output is correct
36 Correct 6 ms 47708 KB Output is correct
37 Correct 6 ms 47756 KB Output is correct
38 Correct 8 ms 47928 KB Output is correct
39 Correct 7 ms 47704 KB Output is correct
40 Correct 8 ms 47708 KB Output is correct
41 Correct 7 ms 47708 KB Output is correct
42 Correct 8 ms 47920 KB Output is correct
43 Correct 8 ms 47704 KB Output is correct
44 Correct 7 ms 49756 KB Output is correct
45 Correct 6 ms 47708 KB Output is correct
46 Correct 6 ms 47876 KB Output is correct
47 Correct 8 ms 47708 KB Output is correct
48 Correct 7 ms 47708 KB Output is correct
49 Correct 8 ms 49756 KB Output is correct
50 Correct 7 ms 49752 KB Output is correct
51 Correct 8 ms 47708 KB Output is correct
52 Correct 9 ms 49756 KB Output is correct
53 Correct 8 ms 49756 KB Output is correct
54 Correct 8 ms 49956 KB Output is correct
55 Correct 9 ms 49812 KB Output is correct
56 Correct 9 ms 49908 KB Output is correct
57 Correct 9 ms 49752 KB Output is correct
58 Correct 8 ms 47708 KB Output is correct
59 Correct 8 ms 47708 KB Output is correct
60 Correct 37 ms 49752 KB Output is correct
61 Correct 85 ms 100180 KB Output is correct
62 Correct 61 ms 51592 KB Output is correct
63 Correct 65 ms 49748 KB Output is correct
64 Correct 42 ms 51804 KB Output is correct
65 Correct 30 ms 49540 KB Output is correct
66 Correct 26 ms 50264 KB Output is correct
67 Correct 87 ms 91984 KB Output is correct
68 Correct 93 ms 90964 KB Output is correct
69 Correct 80 ms 95572 KB Output is correct
70 Correct 90 ms 95512 KB Output is correct
71 Correct 75 ms 92228 KB Output is correct
72 Correct 87 ms 90964 KB Output is correct
73 Correct 76 ms 92240 KB Output is correct
74 Correct 67 ms 93264 KB Output is correct
75 Correct 23 ms 50012 KB Output is correct
76 Correct 99 ms 90704 KB Output is correct
77 Correct 6 ms 47708 KB Output is correct
78 Correct 6 ms 47708 KB Output is correct
79 Correct 6 ms 47708 KB Output is correct
80 Correct 7 ms 49756 KB Output is correct
81 Correct 11 ms 47708 KB Output is correct
82 Correct 7 ms 49752 KB Output is correct
83 Correct 7 ms 49756 KB Output is correct
84 Correct 7 ms 47704 KB Output is correct
85 Correct 9 ms 47764 KB Output is correct
86 Correct 7 ms 47708 KB Output is correct
87 Correct 6 ms 49752 KB Output is correct
88 Correct 8 ms 47708 KB Output is correct
89 Correct 36 ms 47908 KB Output is correct
90 Correct 55 ms 47904 KB Output is correct
91 Correct 45 ms 49756 KB Output is correct
92 Correct 132 ms 94672 KB Output is correct
93 Correct 462 ms 110028 KB Output is correct
94 Correct 834 ms 128328 KB Output is correct
95 Correct 257 ms 98384 KB Output is correct
96 Correct 210 ms 99664 KB Output is correct
97 Correct 256 ms 98640 KB Output is correct
98 Correct 441 ms 109696 KB Output is correct
99 Correct 349 ms 109580 KB Output is correct
100 Correct 432 ms 108020 KB Output is correct
101 Correct 376 ms 110032 KB Output is correct
102 Correct 407 ms 108812 KB Output is correct
103 Correct 364 ms 111484 KB Output is correct
104 Correct 326 ms 120904 KB Output is correct
105 Correct 287 ms 111948 KB Output is correct
106 Correct 277 ms 105032 KB Output is correct
107 Correct 275 ms 109004 KB Output is correct
108 Correct 273 ms 105168 KB Output is correct
109 Correct 247 ms 109264 KB Output is correct
110 Correct 51 ms 49988 KB Output is correct
111 Correct 28 ms 49804 KB Output is correct
112 Correct 284 ms 115284 KB Output is correct
113 Correct 173 ms 103248 KB Output is correct
114 Correct 221 ms 114128 KB Output is correct
115 Correct 90 ms 91596 KB Output is correct
116 Correct 217 ms 99664 KB Output is correct
117 Correct 1087 ms 135428 KB Output is correct
118 Correct 99 ms 90964 KB Output is correct
119 Correct 86 ms 91952 KB Output is correct
120 Correct 20 ms 51036 KB Output is correct
121 Correct 290 ms 102992 KB Output is correct
122 Correct 289 ms 102992 KB Output is correct
123 Correct 182 ms 105928 KB Output is correct
124 Correct 152 ms 106836 KB Output is correct
125 Correct 180 ms 107856 KB Output is correct
126 Correct 413 ms 135084 KB Output is correct
127 Correct 232 ms 117920 KB Output is correct
128 Correct 191 ms 117816 KB Output is correct
129 Correct 234 ms 116700 KB Output is correct
130 Correct 201 ms 117304 KB Output is correct