oj.uz

Submission #934501

# Submission time Handle Problem Language Result Execution time Memory
934501 2024-02-27T13:19:53 Z MisterReaper Railway (BOI17_railway) C++17
100 / 100
 98 ms 27340 KB 
#include <bits/stdc++.h>
using i64 = long long;

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;

    std::vector adj(n, std::vector<std::pair<int, int>> ());
    for(int i = 0; i < n - 1; i++) {
        int u, v;
        std::cin >> u >> v;
        adj[--u].emplace_back(--v, i);
        adj[v].emplace_back(u, i);
    }

    const int L = std::__lg(n) + 2;

    int timer = 0;
    std::vector par(n, std::vector<int> (L));
    std::vector<int> tin(n), tout(n), dep(n), val(n), pedge(n);
    auto dfs = [&](auto&& self, int node, int p) -> void {
        tin[node] = timer++;
        par[node][0] = p;
        for(auto [child, idx] : adj[node]) {
            if(child == p) {
                continue;
            }
            pedge[child] = idx;
            dep[child] = dep[node] + 1;
            self(self, child, node);
        }
        tout[node] = timer++;
    };

    dfs(dfs, 0, 0);

    for(int lg = 1; lg < L; lg++) {
        for(int i = 0; i < n; i++) {
            par[i][lg] = par[par[i][lg - 1]][lg - 1];
        }
    }

    std::vector s(m, std::vector<int> ());
    for(int i = 0; i < m; i++) {
        int x;
        std::cin >> x;
        s[i].resize(x);
        for(int j = 0; j < x; j++) {
            std::cin >> s[i][j];
            s[i][j]--;
        }
        std::sort(s[i].begin(), s[i].end(), [&](int lhs, int rhs) -> bool {
            return tin[lhs] < tin[rhs];
        });
        s[i].emplace_back(s[i].front());
    }

    auto get = [&](int node, int l) -> int {
        for(int lg = L - 1; lg >= 0; lg--) {
            if(l >> lg & 1) {
                node = par[node][lg];
            }
        }

        return node;
    };

    auto lca = [&](int a, int b) -> int {
        if(dep[b] > dep[a]) {
            std::swap(a, b);
        }

        a = get(a, dep[a] - dep[b]);
        for(int lg = L - 1; lg >= 0; lg--) {
            if(par[a][lg] != par[b][lg]) {
                a = par[a][lg];
                b = par[b][lg];
            }
        }

        return (a == b ? a : par[a][0]);
    };

    for(int i = 0; i < m; i++) {
        int x = int(s[i].size());
        for(int j = 0; j + 1 < x; j++) {
            int u = s[i][j], v = s[i][j + 1];
            int g = lca(u, v);
            //std::cerr << u << " " << v << " :: " << g << "\n";
            val[u]++;
            val[v]++;
            val[g] -= 2;
        }
    }

    /*
    for(int i = 0; i < n; i++) {
        std::cerr << val[i] << " \n"[i == n - 1];
    }
    */

    auto dfs2 = [&](auto&& self, int node, int p) -> void {
        for(auto [child, idx] : adj[node]) {
            if(child == p) {
                continue;
            }
            self(self, child, node);
            val[node] += val[child];
        }
    };

    dfs2(dfs2, 0, 0);

    std::vector<int> ans;
    for(int i = 0; i < n; i++) {
        //std::cerr << val[i] << " \n"[i == n - 1];
        if(val[i] >= 2 * k) {
            ans.emplace_back(pedge[i]);
        }
    }

    std::sort(ans.begin(), ans.end());
    std::cout << int(ans.size()) << "\n";
    for(int i = 0; i < int(ans.size()); i++) {
        std::cout << ans[i] + 1 << " ";
    }
    
    return;
}

signed main() {
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL); std::cout.tie(NULL);

    int t = 1; //std::cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 2264 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 2516 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2308 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 2264 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 2516 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2308 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 18 ms 3420 KB Output is correct
16 Correct 19 ms 3420 KB Output is correct
17 Correct 19 ms 3420 KB Output is correct
18 Correct 5 ms 2648 KB Output is correct
19 Correct 4 ms 2304 KB Output is correct
20 Correct 19 ms 3676 KB Output is correct
21 Correct 21 ms 3696 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 2396 KB Output is correct
24 Correct 6 ms 2648 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2516 KB Output is correct
28 Correct 4 ms 2392 KB Output is correct
29 Correct 4 ms 2392 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 25576 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 82 ms 25128 KB Output is correct
4 Correct 76 ms 24800 KB Output is correct
5 Correct 77 ms 23920 KB Output is correct
6 Correct 80 ms 24272 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 23120 KB Output is correct
2 Correct 77 ms 21588 KB Output is correct
3 Correct 83 ms 21332 KB Output is correct
4 Correct 76 ms 21536 KB Output is correct
5 Correct 80 ms 21332 KB Output is correct
6 Correct 70 ms 23232 KB Output is correct
7 Correct 74 ms 23376 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 23120 KB Output is correct
2 Correct 77 ms 21588 KB Output is correct
3 Correct 83 ms 21332 KB Output is correct
4 Correct 76 ms 21536 KB Output is correct
5 Correct 80 ms 21332 KB Output is correct
6 Correct 70 ms 23232 KB Output is correct
7 Correct 74 ms 23376 KB Output is correct
8 Correct 73 ms 22356 KB Output is correct
9 Correct 73 ms 22352 KB Output is correct
10 Correct 80 ms 23760 KB Output is correct
11 Correct 90 ms 23760 KB Output is correct
12 Correct 68 ms 19656 KB Output is correct
13 Correct 63 ms 20820 KB Output is correct
14 Correct 75 ms 21236 KB Output is correct
15 Correct 75 ms 21348 KB Output is correct
16 Correct 94 ms 23572 KB Output is correct
17 Correct 79 ms 23032 KB Output is correct
18 Correct 77 ms 23124 KB Output is correct
19 Correct 77 ms 23368 KB Output is correct
20 Correct 71 ms 25428 KB Output is correct
21 Correct 75 ms 25388 KB Output is correct
22 Correct 72 ms 25244 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 2264 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 2516 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2308 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 18 ms 3420 KB Output is correct
16 Correct 19 ms 3420 KB Output is correct
17 Correct 19 ms 3420 KB Output is correct
18 Correct 5 ms 2648 KB Output is correct
19 Correct 4 ms 2304 KB Output is correct
20 Correct 19 ms 3676 KB Output is correct
21 Correct 21 ms 3696 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 2396 KB Output is correct
24 Correct 6 ms 2648 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2516 KB Output is correct
28 Correct 4 ms 2392 KB Output is correct
29 Correct 4 ms 2392 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 83 ms 25576 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 82 ms 25128 KB Output is correct
39 Correct 76 ms 24800 KB Output is correct
40 Correct 77 ms 23920 KB Output is correct
41 Correct 80 ms 24272 KB Output is correct
42 Correct 82 ms 23120 KB Output is correct
43 Correct 77 ms 21588 KB Output is correct
44 Correct 83 ms 21332 KB Output is correct
45 Correct 76 ms 21536 KB Output is correct
46 Correct 80 ms 21332 KB Output is correct
47 Correct 70 ms 23232 KB Output is correct
48 Correct 74 ms 23376 KB Output is correct
49 Correct 73 ms 22356 KB Output is correct
50 Correct 73 ms 22352 KB Output is correct
51 Correct 80 ms 23760 KB Output is correct
52 Correct 90 ms 23760 KB Output is correct
53 Correct 68 ms 19656 KB Output is correct
54 Correct 63 ms 20820 KB Output is correct
55 Correct 75 ms 21236 KB Output is correct
56 Correct 75 ms 21348 KB Output is correct
57 Correct 94 ms 23572 KB Output is correct
58 Correct 79 ms 23032 KB Output is correct
59 Correct 77 ms 23124 KB Output is correct
60 Correct 77 ms 23368 KB Output is correct
61 Correct 71 ms 25428 KB Output is correct
62 Correct 75 ms 25388 KB Output is correct
63 Correct 72 ms 25244 KB Output is correct
64 Correct 80 ms 25168 KB Output is correct
65 Correct 85 ms 23008 KB Output is correct
66 Correct 76 ms 21328 KB Output is correct
67 Correct 77 ms 21400 KB Output is correct
68 Correct 71 ms 20564 KB Output is correct
69 Correct 60 ms 20468 KB Output is correct
70 Correct 86 ms 25548 KB Output is correct
71 Correct 74 ms 23892 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 6 ms 2396 KB Output is correct
74 Correct 4 ms 2396 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 8 ms 2864 KB Output is correct
78 Correct 6 ms 2456 KB Output is correct
79 Correct 4 ms 2392 KB Output is correct
80 Correct 4 ms 2396 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 19 ms 3416 KB Output is correct
87 Correct 18 ms 3672 KB Output is correct
88 Correct 19 ms 3420 KB Output is correct
89 Correct 6 ms 2652 KB Output is correct
90 Correct 5 ms 2396 KB Output is correct
91 Correct 19 ms 3688 KB Output is correct
92 Correct 28 ms 3676 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 95 ms 27340 KB Output is correct
95 Correct 87 ms 27000 KB Output is correct
96 Correct 82 ms 26412 KB Output is correct
97 Correct 82 ms 25668 KB Output is correct
98 Correct 98 ms 26348 KB Output is correct
99 Correct 76 ms 23208 KB Output is correct
100 Correct 76 ms 23120 KB Output is correct
101 Correct 82 ms 23012 KB Output is correct
102 Correct 82 ms 23232 KB Output is correct
103 Correct 68 ms 25172 KB Output is correct
104 Correct 71 ms 25456 KB Output is correct
105 Correct 67 ms 25116 KB Output is correct
106 Correct 74 ms 24328 KB Output is correct
107 Correct 79 ms 24144 KB Output is correct
108 Correct 85 ms 25552 KB Output is correct
109 Correct 81 ms 25484 KB Output is correct
110 Correct 64 ms 20948 KB Output is correct
111 Correct 70 ms 20916 KB Output is correct
112 Correct 76 ms 21180 KB Output is correct
113 Correct 83 ms 21216 KB Output is correct