oj.uz

Submission #872325

# Submission time Handle Problem Language Result Execution time Memory
872325 2023-11-12T21:24:58 Z tvladm2009 Railway (BOI17_railway) C++17
100 / 100
 87 ms 28108 KB 
#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m, k;
    std::cin >> n >> m >> k;
    std::vector<std::vector<std::pair<int, int>>> adj(n + 1);
    for (int i = 1; i < n; i++) {
        int x, y;
        std::cin >> x >> y;
        adj[x].emplace_back(y, i);
        adj[y].emplace_back(x, i);
    }

    constexpr int K = 20;
    std::vector<int> level(n + 1, 0), tin(n + 1, 0), sum(n + 1, 0), ind(n + 1, 0);
    std::vector<std::vector<int>> up(K, std::vector<int> (n + 1, 0));
    int t = 0;

    std::function<void(int, int)> dfs = [&](int u, int p) {
        tin[u] = ++t;
        up[0][u] = p;
        for (int k = 1; k < K; k++) {
            up[k][u] = up[k - 1][up[k - 1][u]];
        }
        level[u] = level[p] + 1;
        for (auto [v, w] : adj[u]) {
            if (v != p) {
                dfs(v, u);
                ind[v] = w;
            }
        }
    };
    dfs(1, 0);

    auto lca = [&] (int x, int y) {
        if (level[x] < level[y]) {
            std::swap(x, y);
        }
        for (int k = K - 1; k >= 0; k--) {
            if (level[x] - (1 << k) >= level[y]) {
                x = up[k][x];
            }
        }
        if (x == y) {
            return x;
        }
        for (int k = K - 1; k >= 0; k--) {
            if (up[k][x] != up[k][y]) {
                x = up[k][x];
                y = up[k][y];
            }
        }
        return up[0][y];
    };

    auto add = [&] (int x, int y) {
        int z = lca(x, y);
        sum[x]++;
        sum[y]++;
        sum[z] -= 2;
    };

    for (int i = 1; i <= m; i++) {
        int s;
        std::cin >> s;
        std::vector<int> x(s);
        for (int j = 0; j < s; j++) {
            std::cin >> x[j];
        }
        std::sort(x.begin(), x.end(), [&] (int x, int y) {
            return tin[x] < tin[y];
        });
        for (int j = 0; j < s; j++) {
            add(x[j], x[(j + 1) % s]);
        }
    };

    std::function<void(int, int)> dfs2 = [&] (int u, int p) {
        for (auto [v, w] : adj[u]) {
            if (v != p) {
                dfs2(v, u);
                sum[u] += sum[v];
            }
        }
    };
    dfs2(1, 0);

    std::vector<int> sol;
    for (int i = 2; i <= n; i++) {
        if (2 * k <= sum[i]) {
            sol.emplace_back(ind[i]);
        }
    }
    std::sort(sol.begin(), sol.end());
    std::cout << sol.size() << "\n";
    for (auto it : sol) {
        std::cout << it << " ";
    }
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 4 ms 2140 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 4 ms 2164 KB Output is correct
8 Correct 3 ms 2140 KB Output is correct
9 Correct 3 ms 2004 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 15 ms 2396 KB Output is correct
16 Correct 15 ms 2428 KB Output is correct
17 Correct 15 ms 2432 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 4 ms 2004 KB Output is correct
20 Correct 15 ms 2652 KB Output is correct
21 Correct 17 ms 2572 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 2000 KB Output is correct
24 Correct 4 ms 2140 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2140 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 0 ms 460 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 456 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 27848 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 73 ms 27072 KB Output is correct
4 Correct 71 ms 26528 KB Output is correct
5 Correct 73 ms 27652 KB Output is correct
6 Correct 69 ms 28108 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 22220 KB Output is correct
2 Correct 63 ms 18216 KB Output is correct
3 Correct 67 ms 17612 KB Output is correct
4 Correct 65 ms 17608 KB Output is correct
5 Correct 70 ms 17608 KB Output is correct
6 Correct 58 ms 22472 KB Output is correct
7 Correct 59 ms 22408 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 22220 KB Output is correct
2 Correct 63 ms 18216 KB Output is correct
3 Correct 67 ms 17612 KB Output is correct
4 Correct 65 ms 17608 KB Output is correct
5 Correct 70 ms 17608 KB Output is correct
6 Correct 58 ms 22472 KB Output is correct
7 Correct 59 ms 22408 KB Output is correct
8 Correct 67 ms 22324 KB Output is correct
9 Correct 74 ms 22512 KB Output is correct
10 Correct 67 ms 27748 KB Output is correct
11 Correct 71 ms 27880 KB Output is correct
12 Correct 53 ms 17488 KB Output is correct
13 Correct 53 ms 17500 KB Output is correct
14 Correct 87 ms 17632 KB Output is correct
15 Correct 67 ms 17592 KB Output is correct
16 Correct 69 ms 17612 KB Output is correct
17 Correct 66 ms 17608 KB Output is correct
18 Correct 72 ms 17612 KB Output is correct
19 Correct 64 ms 17984 KB Output is correct
20 Correct 61 ms 22928 KB Output is correct
21 Correct 62 ms 22732 KB Output is correct
22 Correct 73 ms 22724 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 4 ms 2140 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 4 ms 2164 KB Output is correct
8 Correct 3 ms 2140 KB Output is correct
9 Correct 3 ms 2004 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 15 ms 2396 KB Output is correct
16 Correct 15 ms 2428 KB Output is correct
17 Correct 15 ms 2432 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 4 ms 2004 KB Output is correct
20 Correct 15 ms 2652 KB Output is correct
21 Correct 17 ms 2572 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 2000 KB Output is correct
24 Correct 4 ms 2140 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2140 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 0 ms 460 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 456 KB Output is correct
36 Correct 74 ms 27848 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 73 ms 27072 KB Output is correct
39 Correct 71 ms 26528 KB Output is correct
40 Correct 73 ms 27652 KB Output is correct
41 Correct 69 ms 28108 KB Output is correct
42 Correct 59 ms 22220 KB Output is correct
43 Correct 63 ms 18216 KB Output is correct
44 Correct 67 ms 17612 KB Output is correct
45 Correct 65 ms 17608 KB Output is correct
46 Correct 70 ms 17608 KB Output is correct
47 Correct 58 ms 22472 KB Output is correct
48 Correct 59 ms 22408 KB Output is correct
49 Correct 67 ms 22324 KB Output is correct
50 Correct 74 ms 22512 KB Output is correct
51 Correct 67 ms 27748 KB Output is correct
52 Correct 71 ms 27880 KB Output is correct
53 Correct 53 ms 17488 KB Output is correct
54 Correct 53 ms 17500 KB Output is correct
55 Correct 87 ms 17632 KB Output is correct
56 Correct 67 ms 17592 KB Output is correct
57 Correct 69 ms 17612 KB Output is correct
58 Correct 66 ms 17608 KB Output is correct
59 Correct 72 ms 17612 KB Output is correct
60 Correct 64 ms 17984 KB Output is correct
61 Correct 61 ms 22928 KB Output is correct
62 Correct 62 ms 22732 KB Output is correct
63 Correct 73 ms 22724 KB Output is correct
64 Correct 68 ms 22472 KB Output is correct
65 Correct 68 ms 17760 KB Output is correct
66 Correct 77 ms 17492 KB Output is correct
67 Correct 71 ms 17612 KB Output is correct
68 Correct 59 ms 17488 KB Output is correct
69 Correct 47 ms 17500 KB Output is correct
70 Correct 71 ms 23044 KB Output is correct
71 Correct 66 ms 22176 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 4 ms 2140 KB Output is correct
74 Correct 4 ms 2004 KB Output is correct
75 Correct 0 ms 500 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 4 ms 2652 KB Output is correct
78 Correct 5 ms 2004 KB Output is correct
79 Correct 3 ms 2136 KB Output is correct
80 Correct 3 ms 2136 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 15 ms 2396 KB Output is correct
87 Correct 16 ms 2396 KB Output is correct
88 Correct 15 ms 2396 KB Output is correct
89 Correct 4 ms 2392 KB Output is correct
90 Correct 6 ms 2136 KB Output is correct
91 Correct 14 ms 2652 KB Output is correct
92 Correct 16 ms 2396 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 80 ms 27668 KB Output is correct
95 Correct 78 ms 27084 KB Output is correct
96 Correct 71 ms 26312 KB Output is correct
97 Correct 74 ms 27584 KB Output is correct
98 Correct 69 ms 28104 KB Output is correct
99 Correct 69 ms 17620 KB Output is correct
100 Correct 78 ms 17752 KB Output is correct
101 Correct 68 ms 17612 KB Output is correct
102 Correct 65 ms 18228 KB Output is correct
103 Correct 59 ms 22216 KB Output is correct
104 Correct 68 ms 22852 KB Output is correct
105 Correct 61 ms 22212 KB Output is correct
106 Correct 65 ms 22472 KB Output is correct
107 Correct 64 ms 22220 KB Output is correct
108 Correct 67 ms 28016 KB Output is correct
109 Correct 82 ms 27768 KB Output is correct
110 Correct 56 ms 17500 KB Output is correct
111 Correct 53 ms 17500 KB Output is correct
112 Correct 68 ms 17500 KB Output is correct
113 Correct 78 ms 17500 KB Output is correct