oj.uz

Submission #599371

# Submission time Handle Problem Language Result Execution time Memory
599371 2022-07-19T13:07:21 Z pedroslrey Railway (BOI17_railway) C++17
100 / 100
 213 ms 26832 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;
const int MAXK = 20;

vector<pair<int, int>> graph[MAXN];
int dp[MAXN][MAXK];
int prof[MAXN], sub[MAXN], idx[MAXN], in[MAXN], out[MAXN], order[MAXN];
int tempo;

void dfs_lca(int u, int p) {
    in[u] = ++tempo;
    order[tempo] = u;
    for (auto [v, id]: graph[u]) {
        if (v == p) continue;

        dp[v][0] = u;
        for (int k = 1; k < MAXK; ++k)
            dp[v][k] = dp[dp[v][k-1]][k-1];
        prof[v] = prof[u] + 1;

        dfs_lca(v, u);
    }
    out[u] = tempo;
}

int lca(int a, int b) {
    if (prof[b] > prof[a]) swap(a, b);

    int d = prof[a] - prof[b];
    for (int k = 0; k < MAXK; ++k)
        if (d & (1 << k)) a = dp[a][k];

    if (a == b) return a;

    for (int k = MAXK - 1; k >= 0; --k)
        if (dp[a][k] != dp[b][k]) {
            a = dp[a][k];
            b = dp[b][k];
        }

    return dp[a][0];
}

void dfs_sub(int u, int p) {
    for (auto [v, id]: graph[u])
        if (v != p) {
            idx[v] = id;
            dfs_sub(v, u);
            sub[u] += sub[v];
        }
}

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    for (int i = 1; i <= n-1; ++i) {
        int u, v;
        cin >> u >> v;

        graph[u].emplace_back(v, i);
        graph[v].emplace_back(u, i);
    }

    dfs_lca(1, 1);

    for (int i = 0; i < m; ++i) {
        int s;
        cin >> s;

        vector<int> xs(s);
        for (int &x: xs)
            cin >> x;

        sort(xs.begin(), xs.end(), [&](int a, int b) { return in[a] < in[b]; });

        vector<int> lcas;
        for (int i = 0; i < s-1; ++i)
            lcas.push_back(lca(xs[i], xs[i + 1]));

        sort(lcas.begin(), lcas.end(), [&](int a, int b) { return prof[a] > prof[b]; });
        lcas.erase(unique(lcas.begin(), lcas.end()), lcas.end());

        set<int> atual;
        for (int x: xs)
            atual.insert(in[x]);

        for (int u: lcas) {
            auto beg = atual.lower_bound(in[u]);
            auto ed  = atual.upper_bound(out[u]);

            vector<int> tmp;
            while (beg != ed) {
                ++sub[order[*beg]];
                --sub[u];
                tmp.push_back(*beg);
                ++beg;
            }

            for (int v: tmp)
                atual.erase(v);
            atual.insert(in[u]);
        }
    }

    dfs_sub(1, 1);

    vector<int> ans;
    for (int i = 1; i <= n; ++i)
        if (sub[i] >= k) ans.push_back(idx[i]);
    sort(ans.begin(), ans.end());

    cout << ans.size() << "\n";
    for (int x: ans)
        cout << x << " ";
    cout << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 10 ms 4184 KB Output is correct
3 Correct 10 ms 4180 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 10 ms 4564 KB Output is correct
7 Correct 10 ms 4308 KB Output is correct
8 Correct 8 ms 4160 KB Output is correct
9 Correct 10 ms 4180 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 3 ms 2664 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 10 ms 4184 KB Output is correct
3 Correct 10 ms 4180 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 10 ms 4564 KB Output is correct
7 Correct 10 ms 4308 KB Output is correct
8 Correct 8 ms 4160 KB Output is correct
9 Correct 10 ms 4180 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 3 ms 2664 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 67 ms 4620 KB Output is correct
16 Correct 67 ms 4532 KB Output is correct
17 Correct 66 ms 4684 KB Output is correct
18 Correct 11 ms 4564 KB Output is correct
19 Correct 11 ms 4228 KB Output is correct
20 Correct 49 ms 4688 KB Output is correct
21 Correct 53 ms 4600 KB Output is correct
22 Correct 2 ms 2664 KB Output is correct
23 Correct 10 ms 4168 KB Output is correct
24 Correct 14 ms 4068 KB Output is correct
25 Correct 2 ms 2656 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 10 ms 4592 KB Output is correct
28 Correct 12 ms 4248 KB Output is correct
29 Correct 8 ms 4180 KB Output is correct
30 Correct 9 ms 4204 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 2 ms 2656 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 25132 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 161 ms 26132 KB Output is correct
4 Correct 150 ms 25488 KB Output is correct
5 Correct 184 ms 26484 KB Output is correct
6 Correct 203 ms 26832 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 20744 KB Output is correct
2 Correct 198 ms 17776 KB Output is correct
3 Correct 166 ms 17428 KB Output is correct
4 Correct 164 ms 17396 KB Output is correct
5 Correct 187 ms 17356 KB Output is correct
6 Correct 144 ms 21388 KB Output is correct
7 Correct 137 ms 21324 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 20744 KB Output is correct
2 Correct 198 ms 17776 KB Output is correct
3 Correct 166 ms 17428 KB Output is correct
4 Correct 164 ms 17396 KB Output is correct
5 Correct 187 ms 17356 KB Output is correct
6 Correct 144 ms 21388 KB Output is correct
7 Correct 137 ms 21324 KB Output is correct
8 Correct 160 ms 21488 KB Output is correct
9 Correct 169 ms 22220 KB Output is correct
10 Correct 202 ms 26584 KB Output is correct
11 Correct 161 ms 26512 KB Output is correct
12 Correct 130 ms 18052 KB Output is correct
13 Correct 174 ms 18092 KB Output is correct
14 Correct 181 ms 18296 KB Output is correct
15 Correct 165 ms 18256 KB Output is correct
16 Correct 151 ms 18252 KB Output is correct
17 Correct 172 ms 18320 KB Output is correct
18 Correct 156 ms 18252 KB Output is correct
19 Correct 151 ms 18624 KB Output is correct
20 Correct 162 ms 22468 KB Output is correct
21 Correct 150 ms 22592 KB Output is correct
22 Correct 141 ms 22524 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 10 ms 4184 KB Output is correct
3 Correct 10 ms 4180 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 10 ms 4564 KB Output is correct
7 Correct 10 ms 4308 KB Output is correct
8 Correct 8 ms 4160 KB Output is correct
9 Correct 10 ms 4180 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 3 ms 2664 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 67 ms 4620 KB Output is correct
16 Correct 67 ms 4532 KB Output is correct
17 Correct 66 ms 4684 KB Output is correct
18 Correct 11 ms 4564 KB Output is correct
19 Correct 11 ms 4228 KB Output is correct
20 Correct 49 ms 4688 KB Output is correct
21 Correct 53 ms 4600 KB Output is correct
22 Correct 2 ms 2664 KB Output is correct
23 Correct 10 ms 4168 KB Output is correct
24 Correct 14 ms 4068 KB Output is correct
25 Correct 2 ms 2656 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 10 ms 4592 KB Output is correct
28 Correct 12 ms 4248 KB Output is correct
29 Correct 8 ms 4180 KB Output is correct
30 Correct 9 ms 4204 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 2 ms 2656 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 179 ms 25132 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 161 ms 26132 KB Output is correct
39 Correct 150 ms 25488 KB Output is correct
40 Correct 184 ms 26484 KB Output is correct
41 Correct 203 ms 26832 KB Output is correct
42 Correct 162 ms 20744 KB Output is correct
43 Correct 198 ms 17776 KB Output is correct
44 Correct 166 ms 17428 KB Output is correct
45 Correct 164 ms 17396 KB Output is correct
46 Correct 187 ms 17356 KB Output is correct
47 Correct 144 ms 21388 KB Output is correct
48 Correct 137 ms 21324 KB Output is correct
49 Correct 160 ms 21488 KB Output is correct
50 Correct 169 ms 22220 KB Output is correct
51 Correct 202 ms 26584 KB Output is correct
52 Correct 161 ms 26512 KB Output is correct
53 Correct 130 ms 18052 KB Output is correct
54 Correct 174 ms 18092 KB Output is correct
55 Correct 181 ms 18296 KB Output is correct
56 Correct 165 ms 18256 KB Output is correct
57 Correct 151 ms 18252 KB Output is correct
58 Correct 172 ms 18320 KB Output is correct
59 Correct 156 ms 18252 KB Output is correct
60 Correct 151 ms 18624 KB Output is correct
61 Correct 162 ms 22468 KB Output is correct
62 Correct 150 ms 22592 KB Output is correct
63 Correct 141 ms 22524 KB Output is correct
64 Correct 164 ms 22428 KB Output is correct
65 Correct 213 ms 18280 KB Output is correct
66 Correct 181 ms 18264 KB Output is correct
67 Correct 189 ms 18196 KB Output is correct
68 Correct 132 ms 18004 KB Output is correct
69 Correct 124 ms 18044 KB Output is correct
70 Correct 152 ms 22736 KB Output is correct
71 Correct 178 ms 22100 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 10 ms 4192 KB Output is correct
74 Correct 10 ms 4144 KB Output is correct
75 Correct 1 ms 2644 KB Output is correct
76 Correct 2 ms 2660 KB Output is correct
77 Correct 10 ms 4564 KB Output is correct
78 Correct 11 ms 4208 KB Output is correct
79 Correct 9 ms 4084 KB Output is correct
80 Correct 10 ms 4152 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2656 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 2 ms 2664 KB Output is correct
86 Correct 89 ms 4428 KB Output is correct
87 Correct 67 ms 4536 KB Output is correct
88 Correct 67 ms 4612 KB Output is correct
89 Correct 11 ms 4596 KB Output is correct
90 Correct 9 ms 4232 KB Output is correct
91 Correct 49 ms 4680 KB Output is correct
92 Correct 65 ms 4604 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 172 ms 26448 KB Output is correct
95 Correct 152 ms 26064 KB Output is correct
96 Correct 163 ms 25584 KB Output is correct
97 Correct 188 ms 26432 KB Output is correct
98 Correct 185 ms 26808 KB Output is correct
99 Correct 157 ms 18380 KB Output is correct
100 Correct 166 ms 18344 KB Output is correct
101 Correct 163 ms 18252 KB Output is correct
102 Correct 151 ms 18700 KB Output is correct
103 Correct 146 ms 22184 KB Output is correct
104 Correct 177 ms 22564 KB Output is correct
105 Correct 136 ms 22096 KB Output is correct
106 Correct 172 ms 22372 KB Output is correct
107 Correct 174 ms 22260 KB Output is correct
108 Correct 161 ms 26672 KB Output is correct
109 Correct 174 ms 26660 KB Output is correct
110 Correct 149 ms 18140 KB Output is correct
111 Correct 128 ms 18176 KB Output is correct
112 Correct 160 ms 18176 KB Output is correct
113 Correct 204 ms 18156 KB Output is correct