oj.uz

Submission #961345

# Submission time Handle Problem Language Result Execution time Memory
961345 2024-04-11T21:46:54 Z biank Railway (BOI17_railway) C++14
100 / 100
 63 ms 25380 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
 
using ii = pair<int, int>; 

const int MAX_N = 1e5 + 9;
const int MAX_K = 18;
 
vector<ii> adj[MAX_N];
int up[MAX_K][MAX_N], d[MAX_N];
int in[MAX_N], t = 0;
int idx[MAX_N];
 
void dfs(int u, int p = 0, int h = 0) {
    in[u] = ++t, up[0][u] = p, d[u] = h;
    for (auto [v, i] : adj[u]) {
        if (v != p) {
            idx[v] = i;
            dfs(v, u, h + 1);
        }
    }
}
 
void init(int n) {
    for (int i = 0; i < MAX_K - 1; i++) {
        for (int j = 1; j <= n; j++) {
            up[i + 1][j] = up[i][up[i][j]];
        }
    }
}
 
int lca(int a, int b) {
    if (d[a] < d[b]) {
        swap(a, b);
    }
    int diff = d[a] - d[b];
    for (int i = 0; i < MAX_K; i++) {
        if (diff >> i & 1) a = up[i][a];
    }
    if (a == b) {
        return a;
    }
    for (int i = MAX_K - 1; i >= 0; i--) {
        if (up[i][a] != up[i][b]) {
            a = up[i][a];
            b = up[i][b];
        }
    }
    return up[0][a];
}
 
int c[MAX_N], k;
vector<int> ans;
 
void dfs2(int u, int p = 0) {
    for (auto [v, i] : adj[u]) {
        if (v != p) {
            dfs2(v, u);
            c[u] += c[v];
        }
    }
    if (c[u] >= k) ans.push_back(idx[u]);
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int n, m;
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].emplace_back(b, i);
        adj[b].emplace_back(a, i);
    }
    dfs(1);
    init(n);
    for (int i = 0; i < m; i++) {
        int s;
        cin >> s;
        vector<int> a(s);
        for (int j = 0; j < s; j++) {
            cin >> a[j];
        }
        sort(all(a), [&](const int &x, const int &y) {
            return in[x] < in[y];
        });
        auto nxt = [&s](int j) {
            if (++j == s) j = 0;
            return j;
        };
        for (int j = 0; j < s; j++) {
            int x = a[j], y = a[nxt(j)];
            c[x]++;
            c[lca(x, y)]--;
        }
    }
    dfs2(1);
    cout << sz(ans) << '\n';
    sort(all(ans));
    for (int i = 0; i < sz(ans); i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
    
    return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int, int)':
railway.cpp:20:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |     for (auto [v, i] : adj[u]) {
      |               ^
railway.cpp: In function 'void dfs2(int, int)':
railway.cpp:60:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |     for (auto [v, i] : adj[u]) {
      |               ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9184 KB Output is correct
6 Correct 5 ms 10152 KB Output is correct
7 Correct 4 ms 9960 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9184 KB Output is correct
6 Correct 5 ms 10152 KB Output is correct
7 Correct 4 ms 9960 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 17 ms 10076 KB Output is correct
16 Correct 17 ms 10328 KB Output is correct
17 Correct 15 ms 10332 KB Output is correct
18 Correct 5 ms 10332 KB Output is correct
19 Correct 7 ms 9816 KB Output is correct
20 Correct 14 ms 10332 KB Output is correct
21 Correct 16 ms 10328 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 5 ms 9820 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 5 ms 10332 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 5 ms 9820 KB Output is correct
31 Correct 2 ms 9180 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9048 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 2 ms 9048 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 23244 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 50 ms 22732 KB Output is correct
4 Correct 47 ms 22176 KB Output is correct
5 Correct 50 ms 23240 KB Output is correct
6 Correct 50 ms 23240 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 18768 KB Output is correct
2 Correct 46 ms 15452 KB Output is correct
3 Correct 49 ms 14932 KB Output is correct
4 Correct 46 ms 14936 KB Output is correct
5 Correct 51 ms 15156 KB Output is correct
6 Correct 44 ms 19036 KB Output is correct
7 Correct 42 ms 18788 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 18768 KB Output is correct
2 Correct 46 ms 15452 KB Output is correct
3 Correct 49 ms 14932 KB Output is correct
4 Correct 46 ms 14936 KB Output is correct
5 Correct 51 ms 15156 KB Output is correct
6 Correct 44 ms 19036 KB Output is correct
7 Correct 42 ms 18788 KB Output is correct
8 Correct 46 ms 18916 KB Output is correct
9 Correct 45 ms 18964 KB Output is correct
10 Correct 48 ms 23212 KB Output is correct
11 Correct 50 ms 23372 KB Output is correct
12 Correct 39 ms 15192 KB Output is correct
13 Correct 38 ms 16616 KB Output is correct
14 Correct 46 ms 16632 KB Output is correct
15 Correct 45 ms 16788 KB Output is correct
16 Correct 52 ms 16928 KB Output is correct
17 Correct 51 ms 17040 KB Output is correct
18 Correct 56 ms 16908 KB Output is correct
19 Correct 47 ms 17212 KB Output is correct
20 Correct 45 ms 21068 KB Output is correct
21 Correct 46 ms 20992 KB Output is correct
22 Correct 46 ms 21060 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9184 KB Output is correct
6 Correct 5 ms 10152 KB Output is correct
7 Correct 4 ms 9960 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 17 ms 10076 KB Output is correct
16 Correct 17 ms 10328 KB Output is correct
17 Correct 15 ms 10332 KB Output is correct
18 Correct 5 ms 10332 KB Output is correct
19 Correct 7 ms 9816 KB Output is correct
20 Correct 14 ms 10332 KB Output is correct
21 Correct 16 ms 10328 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 5 ms 9820 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 5 ms 10332 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 5 ms 9820 KB Output is correct
31 Correct 2 ms 9180 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9048 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 2 ms 9048 KB Output is correct
36 Correct 54 ms 23244 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct
38 Correct 50 ms 22732 KB Output is correct
39 Correct 47 ms 22176 KB Output is correct
40 Correct 50 ms 23240 KB Output is correct
41 Correct 50 ms 23240 KB Output is correct
42 Correct 43 ms 18768 KB Output is correct
43 Correct 46 ms 15452 KB Output is correct
44 Correct 49 ms 14932 KB Output is correct
45 Correct 46 ms 14936 KB Output is correct
46 Correct 51 ms 15156 KB Output is correct
47 Correct 44 ms 19036 KB Output is correct
48 Correct 42 ms 18788 KB Output is correct
49 Correct 46 ms 18916 KB Output is correct
50 Correct 45 ms 18964 KB Output is correct
51 Correct 48 ms 23212 KB Output is correct
52 Correct 50 ms 23372 KB Output is correct
53 Correct 39 ms 15192 KB Output is correct
54 Correct 38 ms 16616 KB Output is correct
55 Correct 46 ms 16632 KB Output is correct
56 Correct 45 ms 16788 KB Output is correct
57 Correct 52 ms 16928 KB Output is correct
58 Correct 51 ms 17040 KB Output is correct
59 Correct 56 ms 16908 KB Output is correct
60 Correct 47 ms 17212 KB Output is correct
61 Correct 45 ms 21068 KB Output is correct
62 Correct 46 ms 20992 KB Output is correct
63 Correct 46 ms 21060 KB Output is correct
64 Correct 49 ms 20940 KB Output is correct
65 Correct 59 ms 17104 KB Output is correct
66 Correct 49 ms 16732 KB Output is correct
67 Correct 46 ms 16716 KB Output is correct
68 Correct 32 ms 16464 KB Output is correct
69 Correct 38 ms 16472 KB Output is correct
70 Correct 54 ms 21164 KB Output is correct
71 Correct 47 ms 20612 KB Output is correct
72 Correct 2 ms 9052 KB Output is correct
73 Correct 4 ms 9872 KB Output is correct
74 Correct 5 ms 9696 KB Output is correct
75 Correct 2 ms 9048 KB Output is correct
76 Correct 2 ms 9052 KB Output is correct
77 Correct 6 ms 10220 KB Output is correct
78 Correct 5 ms 9820 KB Output is correct
79 Correct 4 ms 9704 KB Output is correct
80 Correct 4 ms 9820 KB Output is correct
81 Correct 2 ms 9048 KB Output is correct
82 Correct 2 ms 9052 KB Output is correct
83 Correct 2 ms 9052 KB Output is correct
84 Correct 2 ms 9048 KB Output is correct
85 Correct 2 ms 9052 KB Output is correct
86 Correct 15 ms 10208 KB Output is correct
87 Correct 15 ms 10332 KB Output is correct
88 Correct 15 ms 10332 KB Output is correct
89 Correct 5 ms 10332 KB Output is correct
90 Correct 5 ms 9820 KB Output is correct
91 Correct 14 ms 10364 KB Output is correct
92 Correct 17 ms 10388 KB Output is correct
93 Correct 2 ms 9052 KB Output is correct
94 Correct 59 ms 25036 KB Output is correct
95 Correct 52 ms 24524 KB Output is correct
96 Correct 50 ms 24148 KB Output is correct
97 Correct 48 ms 25004 KB Output is correct
98 Correct 51 ms 25380 KB Output is correct
99 Correct 54 ms 16912 KB Output is correct
100 Correct 47 ms 16740 KB Output is correct
101 Correct 48 ms 16780 KB Output is correct
102 Correct 54 ms 17332 KB Output is correct
103 Correct 43 ms 20816 KB Output is correct
104 Correct 45 ms 21012 KB Output is correct
105 Correct 43 ms 20820 KB Output is correct
106 Correct 52 ms 20856 KB Output is correct
107 Correct 52 ms 20696 KB Output is correct
108 Correct 49 ms 25124 KB Output is correct
109 Correct 59 ms 25036 KB Output is correct
110 Correct 37 ms 16628 KB Output is correct
111 Correct 43 ms 16596 KB Output is correct
112 Correct 63 ms 16736 KB Output is correct
113 Correct 44 ms 16732 KB Output is correct