oj.uz

Submission #931101

# Submission time Handle Problem Language Result Execution time Memory
931101 2024-02-21T08:33:59 Z yellowtoad Railway (BOI17_railway) C++17
100 / 100
 145 ms 24592 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#define f first
#define s second
using namespace std;

int n, m, test, k, pre[100010], d[100010], p[100010][20], lst[100010], cnt, diff[100010];
vector<pair<int,int>> edge[100010], node;
vector<int> stk, ans;

void dfs(int u, int v, int depth, int previd) {
	pre[u] = ++cnt;
	d[u] = depth;
	lst[u] = previd;
	p[u][0] = v;
	for (int i = 1; i < 20; i++) p[u][i] = p[p[u][i-1]][i-1];
	for (int i = 0; i < edge[u].size(); i++) if (edge[u][i].f != v) dfs(edge[u][i].f,u,depth+1,edge[u][i].s);
}

int lca(int u, int v) {
	if (d[u] < d[v]) swap(u,v);
	int i = 19;
	while (i >= 0) {
		if (d[p[u][i]] >= d[v]) u = p[u][i];
		i--;
	}
	if (u == v) return u;
	i = 19;
	while (i >= 0) {
		if (p[u][i] != p[v][i]) u = p[u][i], v = p[v][i];
		i--;
	}
	return p[u][0];
}

void dfs1(int u, int v) {
	for (int i = 0; i < edge[u].size(); i++) {
		if (edge[u][i].f != v) {
			dfs1(edge[u][i].f,u);
			diff[lst[u]] += diff[lst[edge[u][i].f]];
		}
	}
}

int main() {
	cin >> n >> test >> k;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		edge[u].push_back({v,i});
		edge[v].push_back({u,i});
	}
	dfs(1,0,1,0);
	//for (int i = 1; i <= n; i++) cout << pre[i] << endl;
	for (int i = 1; i <= test; i++) {
		cin >> m;
		node.clear(); stk.clear();
		for (int j = 1; j <= m; j++) {
			int x;
			cin >> x;
			node.push_back({pre[x],x});
		}
		sort(node.begin(),node.end());
		stk.push_back(node[0].s);
		for (int j = 1; j < m; j++) {
			int lcaa = lca(stk.back(),node[j].s);
			//cout << lcaa << " " << stk.back() << " " << node[j].s << endl;
			while ((stk.size()) && (d[stk.back()] > d[lcaa])) {
				//cout << stk.back() << endl;
				diff[lst[stk.back()]]++;
				stk.pop_back();
				if ((stk.size()) && (d[stk.back()] > d[lcaa])) diff[lst[stk.back()]]--;
				else diff[lst[lcaa]]--;
			}
			if (!((stk.size()) && (stk.back() == lcaa))) stk.push_back(lcaa);
			if (lcaa != node[j].s) stk.push_back(node[j].s);
		}
		while (stk.size() > 1) {
			diff[lst[stk.back()]]++;
			stk.pop_back();
			diff[lst[stk.back()]]--;
		}
		//cout << endl;
	}
	//for (int i = 1; i < n; i++) cout << diff[i] << endl;
	dfs1(1,0);
	for (int i = 1; i < n; i++) if (diff[i] >= k) ans.push_back(i);
	cout << ans.size() << endl;
	for (int i = 0; i < ans.size(); i++) {
		if (i) cout << " ";
		cout << ans[i];
	}
	if (ans.size()) cout << endl;
}

Compilation message

railway.cpp: In function 'void dfs(int, int, int, int)':
railway.cpp:18:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for (int i = 0; i < edge[u].size(); i++) if (edge[u][i].f != v) dfs(edge[u][i].f,u,depth+1,edge[u][i].s);
      |                  ~~^~~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs1(int, int)':
railway.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for (int i = 0; i < edge[u].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:90:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |  for (int i = 0; i < ans.size(); i++) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4712 KB Output is correct
2 Correct 8 ms 5152 KB Output is correct
3 Correct 9 ms 5208 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 9 ms 5468 KB Output is correct
7 Correct 8 ms 5212 KB Output is correct
8 Correct 6 ms 5212 KB Output is correct
9 Correct 7 ms 5244 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4852 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4712 KB Output is correct
2 Correct 8 ms 5152 KB Output is correct
3 Correct 9 ms 5208 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 9 ms 5468 KB Output is correct
7 Correct 8 ms 5212 KB Output is correct
8 Correct 6 ms 5212 KB Output is correct
9 Correct 7 ms 5244 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4852 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 34 ms 5468 KB Output is correct
16 Correct 35 ms 5468 KB Output is correct
17 Correct 35 ms 5468 KB Output is correct
18 Correct 8 ms 5468 KB Output is correct
19 Correct 8 ms 5212 KB Output is correct
20 Correct 40 ms 5748 KB Output is correct
21 Correct 48 ms 5692 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 9 ms 5244 KB Output is correct
24 Correct 7 ms 5248 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 9 ms 5468 KB Output is correct
28 Correct 8 ms 5304 KB Output is correct
29 Correct 7 ms 5212 KB Output is correct
30 Correct 6 ms 5304 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 24116 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 116 ms 23856 KB Output is correct
4 Correct 130 ms 23504 KB Output is correct
5 Correct 121 ms 24044 KB Output is correct
6 Correct 140 ms 24592 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 20796 KB Output is correct
2 Correct 106 ms 17980 KB Output is correct
3 Correct 109 ms 17540 KB Output is correct
4 Correct 112 ms 17492 KB Output is correct
5 Correct 108 ms 17492 KB Output is correct
6 Correct 116 ms 20812 KB Output is correct
7 Correct 117 ms 20564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 20796 KB Output is correct
2 Correct 106 ms 17980 KB Output is correct
3 Correct 109 ms 17540 KB Output is correct
4 Correct 112 ms 17492 KB Output is correct
5 Correct 108 ms 17492 KB Output is correct
6 Correct 116 ms 20812 KB Output is correct
7 Correct 117 ms 20564 KB Output is correct
8 Correct 117 ms 20816 KB Output is correct
9 Correct 110 ms 20652 KB Output is correct
10 Correct 119 ms 24328 KB Output is correct
11 Correct 111 ms 24272 KB Output is correct
12 Correct 91 ms 17236 KB Output is correct
13 Correct 89 ms 17240 KB Output is correct
14 Correct 115 ms 17492 KB Output is correct
15 Correct 111 ms 17420 KB Output is correct
16 Correct 113 ms 17616 KB Output is correct
17 Correct 123 ms 17548 KB Output is correct
18 Correct 118 ms 17452 KB Output is correct
19 Correct 106 ms 17924 KB Output is correct
20 Correct 108 ms 21060 KB Output is correct
21 Correct 105 ms 21164 KB Output is correct
22 Correct 112 ms 20956 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4712 KB Output is correct
2 Correct 8 ms 5152 KB Output is correct
3 Correct 9 ms 5208 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 9 ms 5468 KB Output is correct
7 Correct 8 ms 5212 KB Output is correct
8 Correct 6 ms 5212 KB Output is correct
9 Correct 7 ms 5244 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4852 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 34 ms 5468 KB Output is correct
16 Correct 35 ms 5468 KB Output is correct
17 Correct 35 ms 5468 KB Output is correct
18 Correct 8 ms 5468 KB Output is correct
19 Correct 8 ms 5212 KB Output is correct
20 Correct 40 ms 5748 KB Output is correct
21 Correct 48 ms 5692 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 9 ms 5244 KB Output is correct
24 Correct 7 ms 5248 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 9 ms 5468 KB Output is correct
28 Correct 8 ms 5304 KB Output is correct
29 Correct 7 ms 5212 KB Output is correct
30 Correct 6 ms 5304 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 121 ms 24116 KB Output is correct
37 Correct 1 ms 4696 KB Output is correct
38 Correct 116 ms 23856 KB Output is correct
39 Correct 130 ms 23504 KB Output is correct
40 Correct 121 ms 24044 KB Output is correct
41 Correct 140 ms 24592 KB Output is correct
42 Correct 108 ms 20796 KB Output is correct
43 Correct 106 ms 17980 KB Output is correct
44 Correct 109 ms 17540 KB Output is correct
45 Correct 112 ms 17492 KB Output is correct
46 Correct 108 ms 17492 KB Output is correct
47 Correct 116 ms 20812 KB Output is correct
48 Correct 117 ms 20564 KB Output is correct
49 Correct 117 ms 20816 KB Output is correct
50 Correct 110 ms 20652 KB Output is correct
51 Correct 119 ms 24328 KB Output is correct
52 Correct 111 ms 24272 KB Output is correct
53 Correct 91 ms 17236 KB Output is correct
54 Correct 89 ms 17240 KB Output is correct
55 Correct 115 ms 17492 KB Output is correct
56 Correct 111 ms 17420 KB Output is correct
57 Correct 113 ms 17616 KB Output is correct
58 Correct 123 ms 17548 KB Output is correct
59 Correct 118 ms 17452 KB Output is correct
60 Correct 106 ms 17924 KB Output is correct
61 Correct 108 ms 21060 KB Output is correct
62 Correct 105 ms 21164 KB Output is correct
63 Correct 112 ms 20956 KB Output is correct
64 Correct 138 ms 20852 KB Output is correct
65 Correct 114 ms 17532 KB Output is correct
66 Correct 118 ms 17488 KB Output is correct
67 Correct 123 ms 17632 KB Output is correct
68 Correct 88 ms 17388 KB Output is correct
69 Correct 85 ms 17276 KB Output is correct
70 Correct 114 ms 21196 KB Output is correct
71 Correct 109 ms 20580 KB Output is correct
72 Correct 2 ms 4696 KB Output is correct
73 Correct 7 ms 5212 KB Output is correct
74 Correct 7 ms 5212 KB Output is correct
75 Correct 1 ms 4720 KB Output is correct
76 Correct 1 ms 4700 KB Output is correct
77 Correct 8 ms 5576 KB Output is correct
78 Correct 9 ms 5332 KB Output is correct
79 Correct 6 ms 5212 KB Output is correct
80 Correct 7 ms 5212 KB Output is correct
81 Correct 1 ms 4700 KB Output is correct
82 Correct 1 ms 4700 KB Output is correct
83 Correct 1 ms 4700 KB Output is correct
84 Correct 1 ms 4852 KB Output is correct
85 Correct 1 ms 4700 KB Output is correct
86 Correct 34 ms 5468 KB Output is correct
87 Correct 34 ms 5468 KB Output is correct
88 Correct 37 ms 5464 KB Output is correct
89 Correct 9 ms 5468 KB Output is correct
90 Correct 7 ms 5212 KB Output is correct
91 Correct 39 ms 5756 KB Output is correct
92 Correct 40 ms 5724 KB Output is correct
93 Correct 1 ms 4700 KB Output is correct
94 Correct 121 ms 24184 KB Output is correct
95 Correct 145 ms 23860 KB Output is correct
96 Correct 111 ms 23124 KB Output is correct
97 Correct 128 ms 24272 KB Output is correct
98 Correct 129 ms 24468 KB Output is correct
99 Correct 116 ms 17488 KB Output is correct
100 Correct 107 ms 17452 KB Output is correct
101 Correct 113 ms 17672 KB Output is correct
102 Correct 108 ms 17828 KB Output is correct
103 Correct 106 ms 20564 KB Output is correct
104 Correct 106 ms 21072 KB Output is correct
105 Correct 110 ms 20672 KB Output is correct
106 Correct 115 ms 21020 KB Output is correct
107 Correct 110 ms 20564 KB Output is correct
108 Correct 115 ms 24268 KB Output is correct
109 Correct 124 ms 24172 KB Output is correct
110 Correct 94 ms 17392 KB Output is correct
111 Correct 95 ms 17312 KB Output is correct
112 Correct 110 ms 17496 KB Output is correct
113 Correct 128 ms 17496 KB Output is correct