oj.uz

답안 #1040125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040125 2024-07-31T16:44:22 Z Sharky Jail (JOI22_jail) C++17
77 / 100
 5000 ms 418128 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 * 10], rs[N * 10], st[2], vis[N * 10], cyc = 0, col[N * 10];
vector<int> adj[N], g[N * 10];

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 5 ms 41564 KB Output is correct
2 Correct 5 ms 41612 KB Output is correct
3 Correct 6 ms 43608 KB Output is correct
4 Correct 15 ms 43768 KB Output is correct
5 Correct 26 ms 43772 KB Output is correct
6 Correct 7 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 8 ms 41564 KB Output is correct
9 Correct 36 ms 43608 KB Output is correct
10 Correct 82 ms 95872 KB Output is correct
11 Correct 10 ms 41564 KB Output is correct
12 Correct 39 ms 41748 KB Output is correct
13 Correct 140 ms 104532 KB Output is correct
14 Correct 119 ms 105296 KB Output is correct
15 Correct 206 ms 110164 KB Output is correct
16 Correct 426 ms 129876 KB Output is correct
17 Correct 179 ms 114704 KB Output is correct
18 Correct 147 ms 108368 KB Output is correct
19 Correct 172 ms 113720 KB Output is correct
20 Correct 166 ms 114228 KB Output is correct
21 Correct 162 ms 114892 KB Output is correct
22 Correct 101 ms 102736 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41564 KB Output is correct
2 Correct 6 ms 43668 KB Output is correct
3 Correct 7 ms 41564 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 7 ms 41564 KB Output is correct
6 Correct 9 ms 41564 KB Output is correct
7 Correct 7 ms 43612 KB Output is correct
8 Correct 7 ms 41600 KB Output is correct
9 Correct 6 ms 41564 KB Output is correct
10 Correct 6 ms 41660 KB Output is correct
11 Correct 6 ms 41564 KB Output is correct
12 Correct 7 ms 43612 KB Output is correct
13 Correct 7 ms 43612 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41564 KB Output is correct
2 Correct 6 ms 43668 KB Output is correct
3 Correct 7 ms 41564 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 7 ms 41564 KB Output is correct
6 Correct 9 ms 41564 KB Output is correct
7 Correct 7 ms 43612 KB Output is correct
8 Correct 7 ms 41600 KB Output is correct
9 Correct 6 ms 41564 KB Output is correct
10 Correct 6 ms 41660 KB Output is correct
11 Correct 6 ms 41564 KB Output is correct
12 Correct 7 ms 43612 KB Output is correct
13 Correct 7 ms 43612 KB Output is correct
14 Correct 6 ms 41564 KB Output is correct
15 Correct 5 ms 41648 KB Output is correct
16 Correct 6 ms 41564 KB Output is correct
17 Correct 7 ms 41564 KB Output is correct
18 Correct 7 ms 41564 KB Output is correct
19 Correct 7 ms 41704 KB Output is correct
20 Correct 6 ms 41564 KB Output is correct
21 Correct 7 ms 41564 KB Output is correct
22 Correct 8 ms 43724 KB Output is correct
23 Correct 6 ms 41564 KB Output is correct
24 Correct 5 ms 41564 KB Output is correct
25 Correct 7 ms 41564 KB Output is correct
26 Correct 6 ms 41760 KB Output is correct
27 Correct 7 ms 43612 KB Output is correct
28 Correct 6 ms 43612 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41564 KB Output is correct
2 Correct 6 ms 43668 KB Output is correct
3 Correct 7 ms 41564 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 7 ms 41564 KB Output is correct
6 Correct 9 ms 41564 KB Output is correct
7 Correct 7 ms 43612 KB Output is correct
8 Correct 7 ms 41600 KB Output is correct
9 Correct 6 ms 41564 KB Output is correct
10 Correct 6 ms 41660 KB Output is correct
11 Correct 6 ms 41564 KB Output is correct
12 Correct 7 ms 43612 KB Output is correct
13 Correct 7 ms 43612 KB Output is correct
14 Correct 6 ms 41564 KB Output is correct
15 Correct 5 ms 41648 KB Output is correct
16 Correct 6 ms 41564 KB Output is correct
17 Correct 7 ms 41564 KB Output is correct
18 Correct 7 ms 41564 KB Output is correct
19 Correct 7 ms 41704 KB Output is correct
20 Correct 6 ms 41564 KB Output is correct
21 Correct 7 ms 41564 KB Output is correct
22 Correct 8 ms 43724 KB Output is correct
23 Correct 6 ms 41564 KB Output is correct
24 Correct 5 ms 41564 KB Output is correct
25 Correct 7 ms 41564 KB Output is correct
26 Correct 6 ms 41760 KB Output is correct
27 Correct 7 ms 43612 KB Output is correct
28 Correct 6 ms 43612 KB Output is correct
29 Correct 8 ms 41564 KB Output is correct
30 Correct 9 ms 43612 KB Output is correct
31 Correct 9 ms 43868 KB Output is correct
32 Correct 8 ms 43612 KB Output is correct
33 Correct 7 ms 43612 KB Output is correct
34 Correct 9 ms 43612 KB Output is correct
35 Correct 10 ms 43868 KB Output is correct
36 Correct 7 ms 41564 KB Output is correct
37 Correct 6 ms 41564 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41564 KB Output is correct
2 Correct 6 ms 43668 KB Output is correct
3 Correct 7 ms 41564 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 7 ms 41564 KB Output is correct
6 Correct 9 ms 41564 KB Output is correct
7 Correct 7 ms 43612 KB Output is correct
8 Correct 7 ms 41600 KB Output is correct
9 Correct 6 ms 41564 KB Output is correct
10 Correct 6 ms 41660 KB Output is correct
11 Correct 6 ms 41564 KB Output is correct
12 Correct 7 ms 43612 KB Output is correct
13 Correct 7 ms 43612 KB Output is correct
14 Correct 6 ms 41564 KB Output is correct
15 Correct 5 ms 41648 KB Output is correct
16 Correct 6 ms 41564 KB Output is correct
17 Correct 7 ms 41564 KB Output is correct
18 Correct 7 ms 41564 KB Output is correct
19 Correct 7 ms 41704 KB Output is correct
20 Correct 6 ms 41564 KB Output is correct
21 Correct 7 ms 41564 KB Output is correct
22 Correct 8 ms 43724 KB Output is correct
23 Correct 6 ms 41564 KB Output is correct
24 Correct 5 ms 41564 KB Output is correct
25 Correct 7 ms 41564 KB Output is correct
26 Correct 6 ms 41760 KB Output is correct
27 Correct 7 ms 43612 KB Output is correct
28 Correct 6 ms 43612 KB Output is correct
29 Correct 8 ms 41564 KB Output is correct
30 Correct 9 ms 43612 KB Output is correct
31 Correct 9 ms 43868 KB Output is correct
32 Correct 8 ms 43612 KB Output is correct
33 Correct 7 ms 43612 KB Output is correct
34 Correct 9 ms 43612 KB Output is correct
35 Correct 10 ms 43868 KB Output is correct
36 Correct 7 ms 41564 KB Output is correct
37 Correct 6 ms 41564 KB Output is correct
38 Correct 36 ms 43760 KB Output is correct
39 Correct 85 ms 95824 KB Output is correct
40 Correct 247 ms 52816 KB Output is correct
41 Correct 75 ms 43604 KB Output is correct
42 Correct 43 ms 45656 KB Output is correct
43 Correct 30 ms 43352 KB Output is correct
44 Correct 25 ms 44220 KB Output is correct
45 Correct 104 ms 87380 KB Output is correct
46 Correct 101 ms 86740 KB Output is correct
47 Correct 663 ms 129876 KB Output is correct
48 Correct 694 ms 130928 KB Output is correct
49 Correct 136 ms 90200 KB Output is correct
50 Correct 156 ms 89684 KB Output is correct
51 Correct 73 ms 87892 KB Output is correct
52 Correct 68 ms 88400 KB Output is correct
53 Correct 21 ms 43868 KB Output is correct
54 Correct 90 ms 86296 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41560 KB Output is correct
2 Correct 5 ms 41608 KB Output is correct
3 Correct 5 ms 41684 KB Output is correct
4 Correct 6 ms 43868 KB Output is correct
5 Correct 12 ms 41564 KB Output is correct
6 Correct 6 ms 43612 KB Output is correct
7 Correct 6 ms 43652 KB Output is correct
8 Correct 5 ms 41564 KB Output is correct
9 Correct 5 ms 41564 KB Output is correct
10 Correct 6 ms 41564 KB Output is correct
11 Correct 6 ms 43632 KB Output is correct
12 Correct 8 ms 41564 KB Output is correct
13 Correct 35 ms 41624 KB Output is correct
14 Correct 54 ms 41608 KB Output is correct
15 Correct 43 ms 43608 KB Output is correct
16 Correct 144 ms 89748 KB Output is correct
17 Correct 447 ms 103116 KB Output is correct
18 Correct 846 ms 118908 KB Output is correct
19 Correct 248 ms 91960 KB Output is correct
20 Correct 227 ms 92816 KB Output is correct
21 Correct 275 ms 92244 KB Output is correct
22 Correct 436 ms 102348 KB Output is correct
23 Correct 372 ms 102636 KB Output is correct
24 Correct 400 ms 101328 KB Output is correct
25 Correct 371 ms 102288 KB Output is correct
26 Correct 422 ms 101728 KB Output is correct
27 Correct 387 ms 102984 KB Output is correct
28 Correct 330 ms 111180 KB Output is correct
29 Correct 287 ms 102480 KB Output is correct
30 Correct 279 ms 98740 KB Output is correct
31 Correct 269 ms 102096 KB Output is correct
32 Correct 275 ms 98764 KB Output is correct
33 Correct 239 ms 102348 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41564 KB Output is correct
2 Correct 5 ms 41612 KB Output is correct
3 Correct 6 ms 43608 KB Output is correct
4 Correct 15 ms 43768 KB Output is correct
5 Correct 26 ms 43772 KB Output is correct
6 Correct 7 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 8 ms 41564 KB Output is correct
9 Correct 36 ms 43608 KB Output is correct
10 Correct 82 ms 95872 KB Output is correct
11 Correct 10 ms 41564 KB Output is correct
12 Correct 39 ms 41748 KB Output is correct
13 Correct 140 ms 104532 KB Output is correct
14 Correct 119 ms 105296 KB Output is correct
15 Correct 206 ms 110164 KB Output is correct
16 Correct 426 ms 129876 KB Output is correct
17 Correct 179 ms 114704 KB Output is correct
18 Correct 147 ms 108368 KB Output is correct
19 Correct 172 ms 113720 KB Output is correct
20 Correct 166 ms 114228 KB Output is correct
21 Correct 162 ms 114892 KB Output is correct
22 Correct 101 ms 102736 KB Output is correct
23 Correct 6 ms 41564 KB Output is correct
24 Correct 6 ms 43668 KB Output is correct
25 Correct 7 ms 41564 KB Output is correct
26 Correct 7 ms 43612 KB Output is correct
27 Correct 7 ms 41564 KB Output is correct
28 Correct 9 ms 41564 KB Output is correct
29 Correct 7 ms 43612 KB Output is correct
30 Correct 7 ms 41600 KB Output is correct
31 Correct 6 ms 41564 KB Output is correct
32 Correct 6 ms 41660 KB Output is correct
33 Correct 6 ms 41564 KB Output is correct
34 Correct 7 ms 43612 KB Output is correct
35 Correct 7 ms 43612 KB Output is correct
36 Correct 6 ms 41564 KB Output is correct
37 Correct 5 ms 41648 KB Output is correct
38 Correct 6 ms 41564 KB Output is correct
39 Correct 7 ms 41564 KB Output is correct
40 Correct 7 ms 41564 KB Output is correct
41 Correct 7 ms 41704 KB Output is correct
42 Correct 6 ms 41564 KB Output is correct
43 Correct 7 ms 41564 KB Output is correct
44 Correct 8 ms 43724 KB Output is correct
45 Correct 6 ms 41564 KB Output is correct
46 Correct 5 ms 41564 KB Output is correct
47 Correct 7 ms 41564 KB Output is correct
48 Correct 6 ms 41760 KB Output is correct
49 Correct 7 ms 43612 KB Output is correct
50 Correct 6 ms 43612 KB Output is correct
51 Correct 8 ms 41564 KB Output is correct
52 Correct 9 ms 43612 KB Output is correct
53 Correct 9 ms 43868 KB Output is correct
54 Correct 8 ms 43612 KB Output is correct
55 Correct 7 ms 43612 KB Output is correct
56 Correct 9 ms 43612 KB Output is correct
57 Correct 10 ms 43868 KB Output is correct
58 Correct 7 ms 41564 KB Output is correct
59 Correct 6 ms 41564 KB Output is correct
60 Correct 36 ms 43760 KB Output is correct
61 Correct 85 ms 95824 KB Output is correct
62 Correct 247 ms 52816 KB Output is correct
63 Correct 75 ms 43604 KB Output is correct
64 Correct 43 ms 45656 KB Output is correct
65 Correct 30 ms 43352 KB Output is correct
66 Correct 25 ms 44220 KB Output is correct
67 Correct 104 ms 87380 KB Output is correct
68 Correct 101 ms 86740 KB Output is correct
69 Correct 663 ms 129876 KB Output is correct
70 Correct 694 ms 130928 KB Output is correct
71 Correct 136 ms 90200 KB Output is correct
72 Correct 156 ms 89684 KB Output is correct
73 Correct 73 ms 87892 KB Output is correct
74 Correct 68 ms 88400 KB Output is correct
75 Correct 21 ms 43868 KB Output is correct
76 Correct 90 ms 86296 KB Output is correct
77 Correct 6 ms 41560 KB Output is correct
78 Correct 5 ms 41608 KB Output is correct
79 Correct 5 ms 41684 KB Output is correct
80 Correct 6 ms 43868 KB Output is correct
81 Correct 12 ms 41564 KB Output is correct
82 Correct 6 ms 43612 KB Output is correct
83 Correct 6 ms 43652 KB Output is correct
84 Correct 5 ms 41564 KB Output is correct
85 Correct 5 ms 41564 KB Output is correct
86 Correct 6 ms 41564 KB Output is correct
87 Correct 6 ms 43632 KB Output is correct
88 Correct 8 ms 41564 KB Output is correct
89 Correct 35 ms 41624 KB Output is correct
90 Correct 54 ms 41608 KB Output is correct
91 Correct 43 ms 43608 KB Output is correct
92 Correct 144 ms 89748 KB Output is correct
93 Correct 447 ms 103116 KB Output is correct
94 Correct 846 ms 118908 KB Output is correct
95 Correct 248 ms 91960 KB Output is correct
96 Correct 227 ms 92816 KB Output is correct
97 Correct 275 ms 92244 KB Output is correct
98 Correct 436 ms 102348 KB Output is correct
99 Correct 372 ms 102636 KB Output is correct
100 Correct 400 ms 101328 KB Output is correct
101 Correct 371 ms 102288 KB Output is correct
102 Correct 422 ms 101728 KB Output is correct
103 Correct 387 ms 102984 KB Output is correct
104 Correct 330 ms 111180 KB Output is correct
105 Correct 287 ms 102480 KB Output is correct
106 Correct 279 ms 98740 KB Output is correct
107 Correct 269 ms 102096 KB Output is correct
108 Correct 275 ms 98764 KB Output is correct
109 Correct 239 ms 102348 KB Output is correct
110 Correct 52 ms 43856 KB Output is correct
111 Correct 29 ms 43768 KB Output is correct
112 Execution timed out 5043 ms 418128 KB Time limit exceeded
113 Halted 0 ms 0 KB -