oj.uz

Submission #953506

# Submission time Handle Problem Language Result Execution time Memory
953506 2024-03-26T04:53:27 Z eysbutno Railway (BOI17_railway) C++17
100 / 100
 103 ms 20936 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define f first 
#define s second 

template<class T> bool smin(T& a, T b) {
    return b < a ? a = b, 1 : 0;
}
template<class T> bool smax(T& a, T b) {
    return b > a ? a = b, 1 : 0;
}
template<class T> class FenwickTree {
    private:
        int sz; vector<T> arr;
    public:
        FenwickTree(int n) {
            sz = n + 1, arr.resize(n + 1);
        }
        FenwickTree() {} // empty init
        T prefix(int idx) {
            T tot = 0;
            for (++idx; idx >= 1; idx -= idx & -idx) {
                tot += arr[idx];
            }
            return tot;
        }
        T query(int l, int r) {
            return prefix(r) - prefix(l - 1);
        }
        void update(int idx, T dx) {
            for (++idx; idx < sz; idx += idx & -idx) {
                arr[idx] += dx;
            }
        }
};
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<pii>> adj(n);
    for (int i = 1; i < n; i++) {
        int u, v; cin >> u >> v;
        adj[--u].push_back({--v, i});
        adj[v].push_back({u, i});
    }
    int timer = 0, LOG = 17;
    vector<int> tin(n), tout(n), 
                taken(n);
    vector up(LOG, vector(n, 0));
    auto tour = [&](int u, int p, auto&& tour) -> void {
        tin[u] = timer++;
        for (int i = 1; i < LOG; i++) {
            up[i][u] = up[i - 1][up[i - 1][u]];
        }
        for (auto [v, id] : adj[u]) if (v != p) {
            // might need more stuff, just this for now.
            up[0][v] = u, taken[v] = id;
            tour(v, u, tour);
        }
        tout[u] = timer - 1;
    }; tour(0, -1, tour);
    auto isAncestor = [&](int a, int b) -> bool {
        return tin[a] <= tin[b] && tout[a] >= tout[b];
    };
    auto lca = [&](int u, int v) -> int {
        if (isAncestor(u, v)) return u;
        for (int i = LOG - 1; i >= 0; i--) {
            if (!isAncestor(up[i][u], v)) {
                u = up[i][u];
            }
        }
        return up[0][u];
    };
    FenwickTree<int> added(timer);
    for (int i = 0; i < m; i++) {
        int z; cin >> z;
        vector<int> cur(z);
        for (int &i : cur) {
            cin >> i, --i;
        }
        sort(all(cur), [&](int x, int y) {
            return tin[x] < tin[y];
        });
        cur.push_back(cur[0]);
        for (int j = 0; j < z; j++) {
            int anc = lca(cur[j], cur[j + 1]);
            added.update(tin[cur[j]], 1);
            added.update(tin[cur[j + 1]], 1);
            added.update(tin[anc], -2);
        }
    }
    vector<int> res;
    for (int i = 1; i < n; i++) {
        if (added.query(tin[i], tout[i]) >= k * 2) {
            res.push_back(taken[i]);
        }
    }
    sort(all(res));
    cout << sz(res) << "\n";
    for (int i = 0; i < sz(res); i++) {
        cout << res[i] << " \n"[i == sz(res) - 1];
    }
}
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1; // cin >> t;
    while (t--) solve();
}
/**
 * TASK: Railway (BOI)
 * For each deputy minister:
 * Note that if we sort the nodes by their Euler Tour "start"
 * time and loop back at the end, that we do our entire traversal
 * in the correct order (while using each edge twice). For every
 * pair of nodes in the traversal then, increment them. However, any node
 * "above" or equal to the LCA will not have an edge, so then we subtract 2
 * at the LCA. Use a fenwick tree to do this.
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 4 ms 1876 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 4 ms 2100 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 4 ms 2008 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 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 1 ms 344 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 4 ms 1876 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 4 ms 2100 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 4 ms 2008 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 23 ms 2136 KB Output is correct
16 Correct 23 ms 2396 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 6 ms 2140 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 31 ms 2444 KB Output is correct
21 Correct 39 ms 2408 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 1880 KB Output is correct
24 Correct 4 ms 1880 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2336 KB Output is correct
28 Correct 4 ms 1880 KB Output is correct
29 Correct 4 ms 1884 KB Output is correct
30 Correct 4 ms 1884 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 20584 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 90 ms 19808 KB Output is correct
4 Correct 88 ms 19148 KB Output is correct
5 Correct 66 ms 20484 KB Output is correct
6 Correct 65 ms 20936 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 18124 KB Output is correct
2 Correct 76 ms 16720 KB Output is correct
3 Correct 85 ms 16472 KB Output is correct
4 Correct 85 ms 16328 KB Output is correct
5 Correct 93 ms 16444 KB Output is correct
6 Correct 73 ms 18124 KB Output is correct
7 Correct 70 ms 18124 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 18124 KB Output is correct
2 Correct 76 ms 16720 KB Output is correct
3 Correct 85 ms 16472 KB Output is correct
4 Correct 85 ms 16328 KB Output is correct
5 Correct 93 ms 16444 KB Output is correct
6 Correct 73 ms 18124 KB Output is correct
7 Correct 70 ms 18124 KB Output is correct
8 Correct 82 ms 18120 KB Output is correct
9 Correct 90 ms 18124 KB Output is correct
10 Correct 64 ms 20580 KB Output is correct
11 Correct 64 ms 20540 KB Output is correct
12 Correct 81 ms 16332 KB Output is correct
13 Correct 99 ms 16244 KB Output is correct
14 Correct 81 ms 16328 KB Output is correct
15 Correct 82 ms 16424 KB Output is correct
16 Correct 85 ms 16580 KB Output is correct
17 Correct 86 ms 16564 KB Output is correct
18 Correct 95 ms 16428 KB Output is correct
19 Correct 79 ms 16584 KB Output is correct
20 Correct 74 ms 18352 KB Output is correct
21 Correct 74 ms 18608 KB Output is correct
22 Correct 82 ms 18376 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 4 ms 1876 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 4 ms 2100 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 4 ms 2008 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 23 ms 2136 KB Output is correct
16 Correct 23 ms 2396 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 6 ms 2140 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 31 ms 2444 KB Output is correct
21 Correct 39 ms 2408 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 1880 KB Output is correct
24 Correct 4 ms 1880 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2336 KB Output is correct
28 Correct 4 ms 1880 KB Output is correct
29 Correct 4 ms 1884 KB Output is correct
30 Correct 4 ms 1884 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 91 ms 20584 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 90 ms 19808 KB Output is correct
39 Correct 88 ms 19148 KB Output is correct
40 Correct 66 ms 20484 KB Output is correct
41 Correct 65 ms 20936 KB Output is correct
42 Correct 74 ms 18124 KB Output is correct
43 Correct 76 ms 16720 KB Output is correct
44 Correct 85 ms 16472 KB Output is correct
45 Correct 85 ms 16328 KB Output is correct
46 Correct 93 ms 16444 KB Output is correct
47 Correct 73 ms 18124 KB Output is correct
48 Correct 70 ms 18124 KB Output is correct
49 Correct 82 ms 18120 KB Output is correct
50 Correct 90 ms 18124 KB Output is correct
51 Correct 64 ms 20580 KB Output is correct
52 Correct 64 ms 20540 KB Output is correct
53 Correct 81 ms 16332 KB Output is correct
54 Correct 99 ms 16244 KB Output is correct
55 Correct 81 ms 16328 KB Output is correct
56 Correct 82 ms 16424 KB Output is correct
57 Correct 85 ms 16580 KB Output is correct
58 Correct 86 ms 16564 KB Output is correct
59 Correct 95 ms 16428 KB Output is correct
60 Correct 79 ms 16584 KB Output is correct
61 Correct 74 ms 18352 KB Output is correct
62 Correct 74 ms 18608 KB Output is correct
63 Correct 82 ms 18376 KB Output is correct
64 Correct 79 ms 18404 KB Output is correct
65 Correct 99 ms 16536 KB Output is correct
66 Correct 92 ms 16332 KB Output is correct
67 Correct 103 ms 16584 KB Output is correct
68 Correct 76 ms 16208 KB Output is correct
69 Correct 69 ms 16072 KB Output is correct
70 Correct 82 ms 18632 KB Output is correct
71 Correct 75 ms 17872 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 4 ms 1884 KB Output is correct
74 Correct 4 ms 1884 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 600 KB Output is correct
77 Correct 4 ms 2140 KB Output is correct
78 Correct 4 ms 1884 KB Output is correct
79 Correct 4 ms 1968 KB Output is correct
80 Correct 4 ms 1884 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 25 ms 2204 KB Output is correct
87 Correct 23 ms 2352 KB Output is correct
88 Correct 23 ms 2384 KB Output is correct
89 Correct 4 ms 2140 KB Output is correct
90 Correct 4 ms 2000 KB Output is correct
91 Correct 29 ms 2392 KB Output is correct
92 Correct 34 ms 2420 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 91 ms 20444 KB Output is correct
95 Correct 91 ms 19916 KB Output is correct
96 Correct 85 ms 19296 KB Output is correct
97 Correct 64 ms 20424 KB Output is correct
98 Correct 67 ms 20828 KB Output is correct
99 Correct 89 ms 16328 KB Output is correct
100 Correct 83 ms 16332 KB Output is correct
101 Correct 88 ms 16556 KB Output is correct
102 Correct 78 ms 16600 KB Output is correct
103 Correct 79 ms 18120 KB Output is correct
104 Correct 75 ms 18636 KB Output is correct
105 Correct 73 ms 18124 KB Output is correct
106 Correct 76 ms 18436 KB Output is correct
107 Correct 79 ms 18120 KB Output is correct
108 Correct 62 ms 20680 KB Output is correct
109 Correct 61 ms 20440 KB Output is correct
110 Correct 86 ms 16124 KB Output is correct
111 Correct 82 ms 16140 KB Output is correct
112 Correct 85 ms 16332 KB Output is correct
113 Correct 83 ms 16424 KB Output is correct