oj.uz

답안 #1040143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040143 2024-07-31T17:07:34 Z Sharky Jail (JOI22_jail) C++17
77 / 100
 5000 ms 496152 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);
        if (sz[v] > sz[adj[u][0]]) swap(v, adj[u][0]);
        sz[u] += sz[v];
    }
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 34 ms 117588 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 43 ms 117596 KB Output is correct
5 Correct 54 ms 117696 KB Output is correct
6 Correct 37 ms 117592 KB Output is correct
7 Correct 35 ms 117852 KB Output is correct
8 Correct 35 ms 117596 KB Output is correct
9 Correct 65 ms 120608 KB Output is correct
10 Correct 109 ms 175752 KB Output is correct
11 Correct 37 ms 117596 KB Output is correct
12 Correct 72 ms 117536 KB Output is correct
13 Correct 174 ms 186380 KB Output is correct
14 Correct 156 ms 186452 KB Output is correct
15 Correct 261 ms 191212 KB Output is correct
16 Correct 493 ms 213440 KB Output is correct
17 Correct 214 ms 196496 KB Output is correct
18 Correct 216 ms 192336 KB Output is correct
19 Correct 197 ms 195668 KB Output is correct
20 Correct 190 ms 195668 KB Output is correct
21 Correct 210 ms 196260 KB Output is correct
22 Correct 131 ms 183892 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 117580 KB Output is correct
2 Correct 32 ms 117596 KB Output is correct
3 Correct 34 ms 117596 KB Output is correct
4 Correct 33 ms 117596 KB Output is correct
5 Correct 33 ms 117596 KB Output is correct
6 Correct 33 ms 117584 KB Output is correct
7 Correct 35 ms 117584 KB Output is correct
8 Correct 33 ms 117592 KB Output is correct
9 Correct 32 ms 117588 KB Output is correct
10 Correct 33 ms 117588 KB Output is correct
11 Correct 33 ms 117588 KB Output is correct
12 Correct 33 ms 117584 KB Output is correct
13 Correct 33 ms 117588 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 117580 KB Output is correct
2 Correct 32 ms 117596 KB Output is correct
3 Correct 34 ms 117596 KB Output is correct
4 Correct 33 ms 117596 KB Output is correct
5 Correct 33 ms 117596 KB Output is correct
6 Correct 33 ms 117584 KB Output is correct
7 Correct 35 ms 117584 KB Output is correct
8 Correct 33 ms 117592 KB Output is correct
9 Correct 32 ms 117588 KB Output is correct
10 Correct 33 ms 117588 KB Output is correct
11 Correct 33 ms 117588 KB Output is correct
12 Correct 33 ms 117584 KB Output is correct
13 Correct 33 ms 117588 KB Output is correct
14 Correct 31 ms 117584 KB Output is correct
15 Correct 32 ms 117592 KB Output is correct
16 Correct 33 ms 117592 KB Output is correct
17 Correct 33 ms 117596 KB Output is correct
18 Correct 36 ms 117528 KB Output is correct
19 Correct 32 ms 117584 KB Output is correct
20 Correct 34 ms 117588 KB Output is correct
21 Correct 34 ms 117608 KB Output is correct
22 Correct 33 ms 117596 KB Output is correct
23 Correct 32 ms 117596 KB Output is correct
24 Correct 32 ms 117596 KB Output is correct
25 Correct 32 ms 117596 KB Output is correct
26 Correct 32 ms 117596 KB Output is correct
27 Correct 37 ms 117868 KB Output is correct
28 Correct 31 ms 117584 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 117580 KB Output is correct
2 Correct 32 ms 117596 KB Output is correct
3 Correct 34 ms 117596 KB Output is correct
4 Correct 33 ms 117596 KB Output is correct
5 Correct 33 ms 117596 KB Output is correct
6 Correct 33 ms 117584 KB Output is correct
7 Correct 35 ms 117584 KB Output is correct
8 Correct 33 ms 117592 KB Output is correct
9 Correct 32 ms 117588 KB Output is correct
10 Correct 33 ms 117588 KB Output is correct
11 Correct 33 ms 117588 KB Output is correct
12 Correct 33 ms 117584 KB Output is correct
13 Correct 33 ms 117588 KB Output is correct
14 Correct 31 ms 117584 KB Output is correct
15 Correct 32 ms 117592 KB Output is correct
16 Correct 33 ms 117592 KB Output is correct
17 Correct 33 ms 117596 KB Output is correct
18 Correct 36 ms 117528 KB Output is correct
19 Correct 32 ms 117584 KB Output is correct
20 Correct 34 ms 117588 KB Output is correct
21 Correct 34 ms 117608 KB Output is correct
22 Correct 33 ms 117596 KB Output is correct
23 Correct 32 ms 117596 KB Output is correct
24 Correct 32 ms 117596 KB Output is correct
25 Correct 32 ms 117596 KB Output is correct
26 Correct 32 ms 117596 KB Output is correct
27 Correct 37 ms 117868 KB Output is correct
28 Correct 31 ms 117584 KB Output is correct
29 Correct 34 ms 117596 KB Output is correct
30 Correct 34 ms 117584 KB Output is correct
31 Correct 35 ms 117848 KB Output is correct
32 Correct 35 ms 117720 KB Output is correct
33 Correct 34 ms 117596 KB Output is correct
34 Correct 41 ms 117596 KB Output is correct
35 Correct 37 ms 117640 KB Output is correct
36 Correct 33 ms 117596 KB Output is correct
37 Correct 33 ms 117588 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 117580 KB Output is correct
2 Correct 32 ms 117596 KB Output is correct
3 Correct 34 ms 117596 KB Output is correct
4 Correct 33 ms 117596 KB Output is correct
5 Correct 33 ms 117596 KB Output is correct
6 Correct 33 ms 117584 KB Output is correct
7 Correct 35 ms 117584 KB Output is correct
8 Correct 33 ms 117592 KB Output is correct
9 Correct 32 ms 117588 KB Output is correct
10 Correct 33 ms 117588 KB Output is correct
11 Correct 33 ms 117588 KB Output is correct
12 Correct 33 ms 117584 KB Output is correct
13 Correct 33 ms 117588 KB Output is correct
14 Correct 31 ms 117584 KB Output is correct
15 Correct 32 ms 117592 KB Output is correct
16 Correct 33 ms 117592 KB Output is correct
17 Correct 33 ms 117596 KB Output is correct
18 Correct 36 ms 117528 KB Output is correct
19 Correct 32 ms 117584 KB Output is correct
20 Correct 34 ms 117588 KB Output is correct
21 Correct 34 ms 117608 KB Output is correct
22 Correct 33 ms 117596 KB Output is correct
23 Correct 32 ms 117596 KB Output is correct
24 Correct 32 ms 117596 KB Output is correct
25 Correct 32 ms 117596 KB Output is correct
26 Correct 32 ms 117596 KB Output is correct
27 Correct 37 ms 117868 KB Output is correct
28 Correct 31 ms 117584 KB Output is correct
29 Correct 34 ms 117596 KB Output is correct
30 Correct 34 ms 117584 KB Output is correct
31 Correct 35 ms 117848 KB Output is correct
32 Correct 35 ms 117720 KB Output is correct
33 Correct 34 ms 117596 KB Output is correct
34 Correct 41 ms 117596 KB Output is correct
35 Correct 37 ms 117640 KB Output is correct
36 Correct 33 ms 117596 KB Output is correct
37 Correct 33 ms 117588 KB Output is correct
38 Correct 64 ms 120656 KB Output is correct
39 Correct 113 ms 175632 KB Output is correct
40 Correct 272 ms 127796 KB Output is correct
41 Correct 91 ms 120404 KB Output is correct
42 Correct 70 ms 120660 KB Output is correct
43 Correct 57 ms 120148 KB Output is correct
44 Correct 59 ms 118356 KB Output is correct
45 Correct 113 ms 166668 KB Output is correct
46 Correct 124 ms 166740 KB Output is correct
47 Correct 694 ms 209788 KB Output is correct
48 Correct 770 ms 210776 KB Output is correct
49 Correct 169 ms 169556 KB Output is correct
50 Correct 189 ms 169448 KB Output is correct
51 Correct 104 ms 167660 KB Output is correct
52 Correct 98 ms 167708 KB Output is correct
53 Correct 50 ms 120924 KB Output is correct
54 Correct 133 ms 166352 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 117596 KB Output is correct
2 Correct 33 ms 117472 KB Output is correct
3 Correct 32 ms 117680 KB Output is correct
4 Correct 33 ms 117596 KB Output is correct
5 Correct 39 ms 117596 KB Output is correct
6 Correct 33 ms 117588 KB Output is correct
7 Correct 33 ms 117588 KB Output is correct
8 Correct 32 ms 117592 KB Output is correct
9 Correct 34 ms 117500 KB Output is correct
10 Correct 33 ms 117592 KB Output is correct
11 Correct 31 ms 117596 KB Output is correct
12 Correct 36 ms 117596 KB Output is correct
13 Correct 63 ms 117736 KB Output is correct
14 Correct 81 ms 117596 KB Output is correct
15 Correct 71 ms 117596 KB Output is correct
16 Correct 174 ms 169444 KB Output is correct
17 Correct 504 ms 184528 KB Output is correct
18 Correct 905 ms 202812 KB Output is correct
19 Correct 296 ms 172552 KB Output is correct
20 Correct 243 ms 172676 KB Output is correct
21 Correct 302 ms 172628 KB Output is correct
22 Correct 465 ms 183756 KB Output is correct
23 Correct 410 ms 183952 KB Output is correct
24 Correct 439 ms 183244 KB Output is correct
25 Correct 412 ms 183632 KB Output is correct
26 Correct 445 ms 183828 KB Output is correct
27 Correct 421 ms 186952 KB Output is correct
28 Correct 396 ms 195396 KB Output is correct
29 Correct 336 ms 186668 KB Output is correct
30 Correct 323 ms 180832 KB Output is correct
31 Correct 333 ms 183648 KB Output is correct
32 Correct 311 ms 180688 KB Output is correct
33 Correct 277 ms 183816 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 117592 KB Output is correct
2 Correct 34 ms 117588 KB Output is correct
3 Correct 34 ms 117592 KB Output is correct
4 Correct 43 ms 117596 KB Output is correct
5 Correct 54 ms 117696 KB Output is correct
6 Correct 37 ms 117592 KB Output is correct
7 Correct 35 ms 117852 KB Output is correct
8 Correct 35 ms 117596 KB Output is correct
9 Correct 65 ms 120608 KB Output is correct
10 Correct 109 ms 175752 KB Output is correct
11 Correct 37 ms 117596 KB Output is correct
12 Correct 72 ms 117536 KB Output is correct
13 Correct 174 ms 186380 KB Output is correct
14 Correct 156 ms 186452 KB Output is correct
15 Correct 261 ms 191212 KB Output is correct
16 Correct 493 ms 213440 KB Output is correct
17 Correct 214 ms 196496 KB Output is correct
18 Correct 216 ms 192336 KB Output is correct
19 Correct 197 ms 195668 KB Output is correct
20 Correct 190 ms 195668 KB Output is correct
21 Correct 210 ms 196260 KB Output is correct
22 Correct 131 ms 183892 KB Output is correct
23 Correct 33 ms 117580 KB Output is correct
24 Correct 32 ms 117596 KB Output is correct
25 Correct 34 ms 117596 KB Output is correct
26 Correct 33 ms 117596 KB Output is correct
27 Correct 33 ms 117596 KB Output is correct
28 Correct 33 ms 117584 KB Output is correct
29 Correct 35 ms 117584 KB Output is correct
30 Correct 33 ms 117592 KB Output is correct
31 Correct 32 ms 117588 KB Output is correct
32 Correct 33 ms 117588 KB Output is correct
33 Correct 33 ms 117588 KB Output is correct
34 Correct 33 ms 117584 KB Output is correct
35 Correct 33 ms 117588 KB Output is correct
36 Correct 31 ms 117584 KB Output is correct
37 Correct 32 ms 117592 KB Output is correct
38 Correct 33 ms 117592 KB Output is correct
39 Correct 33 ms 117596 KB Output is correct
40 Correct 36 ms 117528 KB Output is correct
41 Correct 32 ms 117584 KB Output is correct
42 Correct 34 ms 117588 KB Output is correct
43 Correct 34 ms 117608 KB Output is correct
44 Correct 33 ms 117596 KB Output is correct
45 Correct 32 ms 117596 KB Output is correct
46 Correct 32 ms 117596 KB Output is correct
47 Correct 32 ms 117596 KB Output is correct
48 Correct 32 ms 117596 KB Output is correct
49 Correct 37 ms 117868 KB Output is correct
50 Correct 31 ms 117584 KB Output is correct
51 Correct 34 ms 117596 KB Output is correct
52 Correct 34 ms 117584 KB Output is correct
53 Correct 35 ms 117848 KB Output is correct
54 Correct 35 ms 117720 KB Output is correct
55 Correct 34 ms 117596 KB Output is correct
56 Correct 41 ms 117596 KB Output is correct
57 Correct 37 ms 117640 KB Output is correct
58 Correct 33 ms 117596 KB Output is correct
59 Correct 33 ms 117588 KB Output is correct
60 Correct 64 ms 120656 KB Output is correct
61 Correct 113 ms 175632 KB Output is correct
62 Correct 272 ms 127796 KB Output is correct
63 Correct 91 ms 120404 KB Output is correct
64 Correct 70 ms 120660 KB Output is correct
65 Correct 57 ms 120148 KB Output is correct
66 Correct 59 ms 118356 KB Output is correct
67 Correct 113 ms 166668 KB Output is correct
68 Correct 124 ms 166740 KB Output is correct
69 Correct 694 ms 209788 KB Output is correct
70 Correct 770 ms 210776 KB Output is correct
71 Correct 169 ms 169556 KB Output is correct
72 Correct 189 ms 169448 KB Output is correct
73 Correct 104 ms 167660 KB Output is correct
74 Correct 98 ms 167708 KB Output is correct
75 Correct 50 ms 120924 KB Output is correct
76 Correct 133 ms 166352 KB Output is correct
77 Correct 31 ms 117596 KB Output is correct
78 Correct 33 ms 117472 KB Output is correct
79 Correct 32 ms 117680 KB Output is correct
80 Correct 33 ms 117596 KB Output is correct
81 Correct 39 ms 117596 KB Output is correct
82 Correct 33 ms 117588 KB Output is correct
83 Correct 33 ms 117588 KB Output is correct
84 Correct 32 ms 117592 KB Output is correct
85 Correct 34 ms 117500 KB Output is correct
86 Correct 33 ms 117592 KB Output is correct
87 Correct 31 ms 117596 KB Output is correct
88 Correct 36 ms 117596 KB Output is correct
89 Correct 63 ms 117736 KB Output is correct
90 Correct 81 ms 117596 KB Output is correct
91 Correct 71 ms 117596 KB Output is correct
92 Correct 174 ms 169444 KB Output is correct
93 Correct 504 ms 184528 KB Output is correct
94 Correct 905 ms 202812 KB Output is correct
95 Correct 296 ms 172552 KB Output is correct
96 Correct 243 ms 172676 KB Output is correct
97 Correct 302 ms 172628 KB Output is correct
98 Correct 465 ms 183756 KB Output is correct
99 Correct 410 ms 183952 KB Output is correct
100 Correct 439 ms 183244 KB Output is correct
101 Correct 412 ms 183632 KB Output is correct
102 Correct 445 ms 183828 KB Output is correct
103 Correct 421 ms 186952 KB Output is correct
104 Correct 396 ms 195396 KB Output is correct
105 Correct 336 ms 186668 KB Output is correct
106 Correct 323 ms 180832 KB Output is correct
107 Correct 333 ms 183648 KB Output is correct
108 Correct 311 ms 180688 KB Output is correct
109 Correct 277 ms 183816 KB Output is correct
110 Correct 77 ms 117844 KB Output is correct
111 Correct 53 ms 117596 KB Output is correct
112 Execution timed out 5092 ms 496152 KB Time limit exceeded
113 Halted 0 ms 0 KB -