// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int lim = 1e5 + 5;
int dep_cnt[lim];
struct disjoint_set {
int head[lim], size[lim], ans[lim];
map<int, int> dep[lim];
disjoint_set() {
memset(head, -1, sizeof(head));
fill(size, size + lim, 1);
memset(ans, 0, sizeof(ans));
}
int fh(int nd) {
while(head[nd] != -1)
nd = head[nd];
return nd;
}
bool merge(int x, int y) {
x = fh(x), y = fh(y);
if(x != y) {
if(size[x] < size[y])
swap(x, y);
size[x] += size[y], head[y] = x;
for(auto i : dep[y]) {
if(dep[x][i.fi]) {
dep[x][i.fi] += i.se;
if(dep[x][i.fi] == dep_cnt[i.fi])
--ans[x];
}
else {
dep[x][i.fi] += i.se;
if(dep[x][i.fi] != dep_cnt[i.fi])
++ans[x];
}
}
}
return x != y;
}
};
vector<int> edges[lim], dep_nd[lim], ans;
bool vis[lim];
int k, depth[lim];
disjoint_set dsu;
void dfs(int nd) {
vis[nd] = 1;
for(auto i : dep_nd[nd]) {
++dsu.dep[nd][i];
if(dep_cnt[i] != 1)
++dsu.ans[nd];
}
for(auto i : edges[nd]) {
if(!vis[i])
depth[i] = depth[nd] + 1, dfs(i), dsu.merge(nd, i);
}
//cout << "ND " << nd << " " << dsu.ans[dsu.fh(nd)] << endl;
if(dsu.ans[dsu.fh(nd)] >= k)
ans.pb(nd);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
// have a tree, find which edges should be constructed
// constructed edges -> use lca, using LCA, we can find what edges should be connected
// LCA of adj edges
// sol 2:
// use subtree count
// in each node, a par edge is used if not all the neighborhoods are in the subtree
// use DSU On Tree, maintaining count of elements and amount of active
// ez
int n, m;
cin >> n >> m >> k;
vector<pair<int, int>> adj;
for(int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
edges[u].pb(v);
edges[v].pb(u);
adj.pb(mp(u, v));
}
for(int i = 1; i <= m; ++i) {
int s;
cin >> s;
dep_cnt[i] = s;
while(s--) {
int x;
cin >> x;
dep_nd[x].pb(i);
}
}
dfs(1);
// yang child di fi
// se jadi number
for(int i = 0; i < adj.size(); ++i) {
if(depth[adj[i].fi] < depth[adj[i].se])
swap(adj[i].fi, adj[i].se);
adj[i].se = i + 1;
}
sort(adj.begin(), adj.end());
vector<int> res;
for(auto i : ans)
res.pb((*lower_bound(adj.begin(), adj.end(), mp(i, 0))).se);
//cout << endl;
sort(res.begin(), res.end());
cout << res.size() << endl;
for(auto i : res)
cout << i << " ";
cout << endl;
return 0;
}
Compilation message
railway.cpp: In function 'int main()':
railway.cpp:112:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
112 | for(int i = 0; i < adj.size(); ++i) {
| ~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
10836 KB |
Output is correct |
2 |
Correct |
10 ms |
11604 KB |
Output is correct |
3 |
Correct |
14 ms |
11608 KB |
Output is correct |
4 |
Correct |
7 ms |
10836 KB |
Output is correct |
5 |
Correct |
7 ms |
10836 KB |
Output is correct |
6 |
Correct |
11 ms |
12372 KB |
Output is correct |
7 |
Correct |
11 ms |
11740 KB |
Output is correct |
8 |
Correct |
10 ms |
11732 KB |
Output is correct |
9 |
Correct |
11 ms |
11732 KB |
Output is correct |
10 |
Correct |
6 ms |
10836 KB |
Output is correct |
11 |
Correct |
8 ms |
10836 KB |
Output is correct |
12 |
Correct |
7 ms |
10904 KB |
Output is correct |
13 |
Correct |
8 ms |
10844 KB |
Output is correct |
14 |
Correct |
6 ms |
10840 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
10836 KB |
Output is correct |
2 |
Correct |
10 ms |
11604 KB |
Output is correct |
3 |
Correct |
14 ms |
11608 KB |
Output is correct |
4 |
Correct |
7 ms |
10836 KB |
Output is correct |
5 |
Correct |
7 ms |
10836 KB |
Output is correct |
6 |
Correct |
11 ms |
12372 KB |
Output is correct |
7 |
Correct |
11 ms |
11740 KB |
Output is correct |
8 |
Correct |
10 ms |
11732 KB |
Output is correct |
9 |
Correct |
11 ms |
11732 KB |
Output is correct |
10 |
Correct |
6 ms |
10836 KB |
Output is correct |
11 |
Correct |
8 ms |
10836 KB |
Output is correct |
12 |
Correct |
7 ms |
10904 KB |
Output is correct |
13 |
Correct |
8 ms |
10844 KB |
Output is correct |
14 |
Correct |
6 ms |
10840 KB |
Output is correct |
15 |
Correct |
51 ms |
18076 KB |
Output is correct |
16 |
Correct |
52 ms |
18240 KB |
Output is correct |
17 |
Correct |
55 ms |
18292 KB |
Output is correct |
18 |
Correct |
13 ms |
12596 KB |
Output is correct |
19 |
Correct |
15 ms |
11816 KB |
Output is correct |
20 |
Correct |
59 ms |
17500 KB |
Output is correct |
21 |
Correct |
50 ms |
17344 KB |
Output is correct |
22 |
Correct |
6 ms |
10964 KB |
Output is correct |
23 |
Correct |
12 ms |
11604 KB |
Output is correct |
24 |
Correct |
11 ms |
11580 KB |
Output is correct |
25 |
Correct |
8 ms |
10880 KB |
Output is correct |
26 |
Correct |
6 ms |
10900 KB |
Output is correct |
27 |
Correct |
15 ms |
12420 KB |
Output is correct |
28 |
Correct |
10 ms |
11700 KB |
Output is correct |
29 |
Correct |
12 ms |
11680 KB |
Output is correct |
30 |
Correct |
13 ms |
11732 KB |
Output is correct |
31 |
Correct |
6 ms |
10820 KB |
Output is correct |
32 |
Correct |
6 ms |
10836 KB |
Output is correct |
33 |
Correct |
6 ms |
10836 KB |
Output is correct |
34 |
Correct |
6 ms |
10832 KB |
Output is correct |
35 |
Correct |
7 ms |
10908 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
143 ms |
41928 KB |
Output is correct |
2 |
Correct |
7 ms |
10848 KB |
Output is correct |
3 |
Correct |
166 ms |
41308 KB |
Output is correct |
4 |
Correct |
144 ms |
40332 KB |
Output is correct |
5 |
Correct |
109 ms |
39924 KB |
Output is correct |
6 |
Correct |
123 ms |
42368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
115 ms |
32448 KB |
Output is correct |
2 |
Correct |
162 ms |
30832 KB |
Output is correct |
3 |
Correct |
182 ms |
36740 KB |
Output is correct |
4 |
Correct |
219 ms |
41896 KB |
Output is correct |
5 |
Correct |
202 ms |
37508 KB |
Output is correct |
6 |
Correct |
114 ms |
32596 KB |
Output is correct |
7 |
Correct |
124 ms |
32392 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
115 ms |
32448 KB |
Output is correct |
2 |
Correct |
162 ms |
30832 KB |
Output is correct |
3 |
Correct |
182 ms |
36740 KB |
Output is correct |
4 |
Correct |
219 ms |
41896 KB |
Output is correct |
5 |
Correct |
202 ms |
37508 KB |
Output is correct |
6 |
Correct |
114 ms |
32596 KB |
Output is correct |
7 |
Correct |
124 ms |
32392 KB |
Output is correct |
8 |
Correct |
125 ms |
32644 KB |
Output is correct |
9 |
Correct |
123 ms |
32484 KB |
Output is correct |
10 |
Correct |
90 ms |
39424 KB |
Output is correct |
11 |
Correct |
93 ms |
39436 KB |
Output is correct |
12 |
Correct |
75 ms |
23796 KB |
Output is correct |
13 |
Correct |
76 ms |
23748 KB |
Output is correct |
14 |
Correct |
159 ms |
32204 KB |
Output is correct |
15 |
Correct |
161 ms |
31856 KB |
Output is correct |
16 |
Correct |
208 ms |
42324 KB |
Output is correct |
17 |
Correct |
239 ms |
42964 KB |
Output is correct |
18 |
Correct |
225 ms |
40848 KB |
Output is correct |
19 |
Correct |
155 ms |
30016 KB |
Output is correct |
20 |
Correct |
118 ms |
33004 KB |
Output is correct |
21 |
Correct |
127 ms |
33120 KB |
Output is correct |
22 |
Correct |
134 ms |
33100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
10836 KB |
Output is correct |
2 |
Correct |
10 ms |
11604 KB |
Output is correct |
3 |
Correct |
14 ms |
11608 KB |
Output is correct |
4 |
Correct |
7 ms |
10836 KB |
Output is correct |
5 |
Correct |
7 ms |
10836 KB |
Output is correct |
6 |
Correct |
11 ms |
12372 KB |
Output is correct |
7 |
Correct |
11 ms |
11740 KB |
Output is correct |
8 |
Correct |
10 ms |
11732 KB |
Output is correct |
9 |
Correct |
11 ms |
11732 KB |
Output is correct |
10 |
Correct |
6 ms |
10836 KB |
Output is correct |
11 |
Correct |
8 ms |
10836 KB |
Output is correct |
12 |
Correct |
7 ms |
10904 KB |
Output is correct |
13 |
Correct |
8 ms |
10844 KB |
Output is correct |
14 |
Correct |
6 ms |
10840 KB |
Output is correct |
15 |
Correct |
51 ms |
18076 KB |
Output is correct |
16 |
Correct |
52 ms |
18240 KB |
Output is correct |
17 |
Correct |
55 ms |
18292 KB |
Output is correct |
18 |
Correct |
13 ms |
12596 KB |
Output is correct |
19 |
Correct |
15 ms |
11816 KB |
Output is correct |
20 |
Correct |
59 ms |
17500 KB |
Output is correct |
21 |
Correct |
50 ms |
17344 KB |
Output is correct |
22 |
Correct |
6 ms |
10964 KB |
Output is correct |
23 |
Correct |
12 ms |
11604 KB |
Output is correct |
24 |
Correct |
11 ms |
11580 KB |
Output is correct |
25 |
Correct |
8 ms |
10880 KB |
Output is correct |
26 |
Correct |
6 ms |
10900 KB |
Output is correct |
27 |
Correct |
15 ms |
12420 KB |
Output is correct |
28 |
Correct |
10 ms |
11700 KB |
Output is correct |
29 |
Correct |
12 ms |
11680 KB |
Output is correct |
30 |
Correct |
13 ms |
11732 KB |
Output is correct |
31 |
Correct |
6 ms |
10820 KB |
Output is correct |
32 |
Correct |
6 ms |
10836 KB |
Output is correct |
33 |
Correct |
6 ms |
10836 KB |
Output is correct |
34 |
Correct |
6 ms |
10832 KB |
Output is correct |
35 |
Correct |
7 ms |
10908 KB |
Output is correct |
36 |
Correct |
143 ms |
41928 KB |
Output is correct |
37 |
Correct |
7 ms |
10848 KB |
Output is correct |
38 |
Correct |
166 ms |
41308 KB |
Output is correct |
39 |
Correct |
144 ms |
40332 KB |
Output is correct |
40 |
Correct |
109 ms |
39924 KB |
Output is correct |
41 |
Correct |
123 ms |
42368 KB |
Output is correct |
42 |
Correct |
115 ms |
32448 KB |
Output is correct |
43 |
Correct |
162 ms |
30832 KB |
Output is correct |
44 |
Correct |
182 ms |
36740 KB |
Output is correct |
45 |
Correct |
219 ms |
41896 KB |
Output is correct |
46 |
Correct |
202 ms |
37508 KB |
Output is correct |
47 |
Correct |
114 ms |
32596 KB |
Output is correct |
48 |
Correct |
124 ms |
32392 KB |
Output is correct |
49 |
Correct |
125 ms |
32644 KB |
Output is correct |
50 |
Correct |
123 ms |
32484 KB |
Output is correct |
51 |
Correct |
90 ms |
39424 KB |
Output is correct |
52 |
Correct |
93 ms |
39436 KB |
Output is correct |
53 |
Correct |
75 ms |
23796 KB |
Output is correct |
54 |
Correct |
76 ms |
23748 KB |
Output is correct |
55 |
Correct |
159 ms |
32204 KB |
Output is correct |
56 |
Correct |
161 ms |
31856 KB |
Output is correct |
57 |
Correct |
208 ms |
42324 KB |
Output is correct |
58 |
Correct |
239 ms |
42964 KB |
Output is correct |
59 |
Correct |
225 ms |
40848 KB |
Output is correct |
60 |
Correct |
155 ms |
30016 KB |
Output is correct |
61 |
Correct |
118 ms |
33004 KB |
Output is correct |
62 |
Correct |
127 ms |
33120 KB |
Output is correct |
63 |
Correct |
134 ms |
33100 KB |
Output is correct |
64 |
Correct |
130 ms |
33408 KB |
Output is correct |
65 |
Correct |
271 ms |
44092 KB |
Output is correct |
66 |
Correct |
207 ms |
38124 KB |
Output is correct |
67 |
Correct |
156 ms |
33548 KB |
Output is correct |
68 |
Correct |
70 ms |
21584 KB |
Output is correct |
69 |
Correct |
73 ms |
21648 KB |
Output is correct |
70 |
Correct |
147 ms |
34876 KB |
Output is correct |
71 |
Correct |
118 ms |
32252 KB |
Output is correct |
72 |
Correct |
6 ms |
10836 KB |
Output is correct |
73 |
Correct |
10 ms |
11604 KB |
Output is correct |
74 |
Correct |
10 ms |
11576 KB |
Output is correct |
75 |
Correct |
5 ms |
10836 KB |
Output is correct |
76 |
Correct |
6 ms |
10836 KB |
Output is correct |
77 |
Correct |
11 ms |
12320 KB |
Output is correct |
78 |
Correct |
9 ms |
11740 KB |
Output is correct |
79 |
Correct |
10 ms |
11680 KB |
Output is correct |
80 |
Correct |
11 ms |
11816 KB |
Output is correct |
81 |
Correct |
6 ms |
10836 KB |
Output is correct |
82 |
Correct |
7 ms |
10900 KB |
Output is correct |
83 |
Correct |
6 ms |
10808 KB |
Output is correct |
84 |
Correct |
6 ms |
10836 KB |
Output is correct |
85 |
Correct |
7 ms |
10908 KB |
Output is correct |
86 |
Correct |
49 ms |
18148 KB |
Output is correct |
87 |
Correct |
48 ms |
18252 KB |
Output is correct |
88 |
Correct |
48 ms |
18252 KB |
Output is correct |
89 |
Correct |
13 ms |
12580 KB |
Output is correct |
90 |
Correct |
11 ms |
11860 KB |
Output is correct |
91 |
Correct |
50 ms |
17432 KB |
Output is correct |
92 |
Correct |
52 ms |
17456 KB |
Output is correct |
93 |
Correct |
6 ms |
10904 KB |
Output is correct |
94 |
Correct |
141 ms |
41944 KB |
Output is correct |
95 |
Correct |
131 ms |
41284 KB |
Output is correct |
96 |
Correct |
119 ms |
40324 KB |
Output is correct |
97 |
Correct |
114 ms |
39876 KB |
Output is correct |
98 |
Correct |
110 ms |
42428 KB |
Output is correct |
99 |
Correct |
219 ms |
43216 KB |
Output is correct |
100 |
Correct |
233 ms |
40984 KB |
Output is correct |
101 |
Correct |
258 ms |
48524 KB |
Output is correct |
102 |
Correct |
149 ms |
31324 KB |
Output is correct |
103 |
Correct |
118 ms |
32584 KB |
Output is correct |
104 |
Correct |
124 ms |
33164 KB |
Output is correct |
105 |
Correct |
116 ms |
32528 KB |
Output is correct |
106 |
Correct |
125 ms |
32596 KB |
Output is correct |
107 |
Correct |
127 ms |
32424 KB |
Output is correct |
108 |
Correct |
104 ms |
39484 KB |
Output is correct |
109 |
Correct |
101 ms |
39516 KB |
Output is correct |
110 |
Correct |
77 ms |
23812 KB |
Output is correct |
111 |
Correct |
100 ms |
23732 KB |
Output is correct |
112 |
Correct |
194 ms |
32480 KB |
Output is correct |
113 |
Correct |
145 ms |
31416 KB |
Output is correct |