oj.uz

Submission #697545

# Submission time Handle Problem Language Result Execution time Memory
697545 2023-02-10T09:59:35 Z d4xn Railway (BOI17_railway) C++17
100 / 100
 232 ms 41312 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+5, L = 20;

int n, m, k, tim, dep[N], sz[N], pre[N], pos[N], upId[N], up[L][N];
vector<pair<int, int>> adj[N];
vector<int> End[N];
set<int> st[N];

void dfs(int u, int par, int id, int d) {
	pre[u] = tim;
  pos[tim] = u;
  tim++;
  
  dep[u] = d;
	sz[u] = 1;
	upId[u] = id;
	up[0][u] = par;
	for (auto& [v, idx] : adj[u]) {
		if (v == par) continue;
		dfs(v, u, idx, d + 1);
		sz[u] += sz[v];
	}
}

int lca(int x, int y) {
	if (dep[x] < dep[y]) swap(x, y);
	int dif = dep[x] - dep[y];
	for (int b = 0; b < L; b++) {
		if (dif & (1 << b))
			x = up[b][x];
	}
	if (x == y) return x;

	for (int b = L - 1; b >= 0; b--) {
		if (up[b][x] == up[b][y]) continue;
		x = up[b][x];
		y = up[b][y];
	}
	return up[0][x];
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> m >> k;
	for (int i = 0; i < n - 1; i++) {
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		adj[x].push_back(make_pair(y, i));
		adj[y].push_back(make_pair(x, i));
	}
	tim = 0;
	dfs(0, 0, -1, 0);

	for (int j = 1; j < L; j++) {
		for (int i = 0; i < n; i++) {
			up[j][i] = up[j - 1][up[j - 1][i]];
		}
	}

	while (m--) {
		int x;
		cin >> x;

		vector<int> v(x), ord(x);
		for (int i = 0; i < x; i++) {
			cin >> v[i];
			v[i]--;
			ord[i] = pre[v[i]];
		}
		sort(ord.begin(), ord.end());

		for (int i = 0; i < x; i++) {
			int y = v[i];
      /*
			auto l = upper_bound(ord.begin(), ord.end(), pre[y]);
			if (l != ord.end() && *l < pre[y] + sz[y]) continue;
      */
			st[y].insert(m);
		}

    int l = pos[ord[0]];
    int r = pos[ord.back()];
    End[lca(l, r)].push_back(m);
    //cerr << lca(l, r)+1 << endl;
	}

	vector<pair<int, int>> ord(n);
	for (int i = 0; i < n; i++) {
		ord[i] = make_pair(dep[i], i);
	}
	sort(ord.rbegin(), ord.rend());

	vector<int> ans;
	for (int i = 0; i < n-1; i++) {
		int x = ord[i].second;
    //cerr << x+1 << " " << st[x].size() << endl;
    for (int& y : End[x]) st[x].erase(y);
    //cerr << x+1 << " " << st[x].size() << endl;

		if (st[x].size() >= k) ans.push_back(upId[x]);

		int p = up[0][x];
		if (st[x].size() > st[p].size()) swap(st[x], st[p]);
		for (int y : st[x]) st[p].insert(y);
		st[x].clear();
	}
	sort(ans.begin(), ans.end());

	cout << ans.size() << "\n";
	for (int &i : ans) {
		cout << i+1 << " ";
	}
	cout << "\n";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:107:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |   if (st[x].size() >= k) ans.push_back(upId[x]);
      |       ~~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 11 ms 11348 KB Output is correct
3 Correct 11 ms 11348 KB Output is correct
4 Correct 6 ms 9732 KB Output is correct
5 Correct 6 ms 9724 KB Output is correct
6 Correct 12 ms 11860 KB Output is correct
7 Correct 11 ms 11532 KB Output is correct
8 Correct 10 ms 11348 KB Output is correct
9 Correct 11 ms 11476 KB Output is correct
10 Correct 6 ms 9724 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 5 ms 9812 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 11 ms 11348 KB Output is correct
3 Correct 11 ms 11348 KB Output is correct
4 Correct 6 ms 9732 KB Output is correct
5 Correct 6 ms 9724 KB Output is correct
6 Correct 12 ms 11860 KB Output is correct
7 Correct 11 ms 11532 KB Output is correct
8 Correct 10 ms 11348 KB Output is correct
9 Correct 11 ms 11476 KB Output is correct
10 Correct 6 ms 9724 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 5 ms 9812 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct
15 Correct 45 ms 15352 KB Output is correct
16 Correct 55 ms 15284 KB Output is correct
17 Correct 49 ms 15384 KB Output is correct
18 Correct 12 ms 11988 KB Output is correct
19 Correct 11 ms 11564 KB Output is correct
20 Correct 42 ms 16540 KB Output is correct
21 Correct 46 ms 16456 KB Output is correct
22 Correct 5 ms 9812 KB Output is correct
23 Correct 12 ms 11460 KB Output is correct
24 Correct 13 ms 11412 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 7 ms 9724 KB Output is correct
27 Correct 11 ms 11848 KB Output is correct
28 Correct 11 ms 11476 KB Output is correct
29 Correct 9 ms 11476 KB Output is correct
30 Correct 10 ms 11404 KB Output is correct
31 Correct 5 ms 9812 KB Output is correct
32 Correct 6 ms 9812 KB Output is correct
33 Correct 6 ms 9736 KB Output is correct
34 Correct 5 ms 9732 KB Output is correct
35 Correct 6 ms 9812 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 38056 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 182 ms 38104 KB Output is correct
4 Correct 137 ms 37468 KB Output is correct
5 Correct 97 ms 37428 KB Output is correct
6 Correct 139 ms 40444 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 32840 KB Output is correct
2 Correct 156 ms 31072 KB Output is correct
3 Correct 190 ms 30356 KB Output is correct
4 Correct 174 ms 30496 KB Output is correct
5 Correct 199 ms 30556 KB Output is correct
6 Correct 129 ms 34032 KB Output is correct
7 Correct 136 ms 33908 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 32840 KB Output is correct
2 Correct 156 ms 31072 KB Output is correct
3 Correct 190 ms 30356 KB Output is correct
4 Correct 174 ms 30496 KB Output is correct
5 Correct 199 ms 30556 KB Output is correct
6 Correct 129 ms 34032 KB Output is correct
7 Correct 136 ms 33908 KB Output is correct
8 Correct 133 ms 33512 KB Output is correct
9 Correct 110 ms 34652 KB Output is correct
10 Correct 78 ms 38724 KB Output is correct
11 Correct 84 ms 38676 KB Output is correct
12 Correct 81 ms 30276 KB Output is correct
13 Correct 76 ms 30276 KB Output is correct
14 Correct 122 ms 30380 KB Output is correct
15 Correct 136 ms 30544 KB Output is correct
16 Correct 172 ms 31224 KB Output is correct
17 Correct 174 ms 31144 KB Output is correct
18 Correct 179 ms 31208 KB Output is correct
19 Correct 159 ms 31868 KB Output is correct
20 Correct 131 ms 35148 KB Output is correct
21 Correct 129 ms 35108 KB Output is correct
22 Correct 150 ms 35060 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 11 ms 11348 KB Output is correct
3 Correct 11 ms 11348 KB Output is correct
4 Correct 6 ms 9732 KB Output is correct
5 Correct 6 ms 9724 KB Output is correct
6 Correct 12 ms 11860 KB Output is correct
7 Correct 11 ms 11532 KB Output is correct
8 Correct 10 ms 11348 KB Output is correct
9 Correct 11 ms 11476 KB Output is correct
10 Correct 6 ms 9724 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 5 ms 9812 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct
15 Correct 45 ms 15352 KB Output is correct
16 Correct 55 ms 15284 KB Output is correct
17 Correct 49 ms 15384 KB Output is correct
18 Correct 12 ms 11988 KB Output is correct
19 Correct 11 ms 11564 KB Output is correct
20 Correct 42 ms 16540 KB Output is correct
21 Correct 46 ms 16456 KB Output is correct
22 Correct 5 ms 9812 KB Output is correct
23 Correct 12 ms 11460 KB Output is correct
24 Correct 13 ms 11412 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 7 ms 9724 KB Output is correct
27 Correct 11 ms 11848 KB Output is correct
28 Correct 11 ms 11476 KB Output is correct
29 Correct 9 ms 11476 KB Output is correct
30 Correct 10 ms 11404 KB Output is correct
31 Correct 5 ms 9812 KB Output is correct
32 Correct 6 ms 9812 KB Output is correct
33 Correct 6 ms 9736 KB Output is correct
34 Correct 5 ms 9732 KB Output is correct
35 Correct 6 ms 9812 KB Output is correct
36 Correct 156 ms 38056 KB Output is correct
37 Correct 6 ms 9732 KB Output is correct
38 Correct 182 ms 38104 KB Output is correct
39 Correct 137 ms 37468 KB Output is correct
40 Correct 97 ms 37428 KB Output is correct
41 Correct 139 ms 40444 KB Output is correct
42 Correct 122 ms 32840 KB Output is correct
43 Correct 156 ms 31072 KB Output is correct
44 Correct 190 ms 30356 KB Output is correct
45 Correct 174 ms 30496 KB Output is correct
46 Correct 199 ms 30556 KB Output is correct
47 Correct 129 ms 34032 KB Output is correct
48 Correct 136 ms 33908 KB Output is correct
49 Correct 133 ms 33512 KB Output is correct
50 Correct 110 ms 34652 KB Output is correct
51 Correct 78 ms 38724 KB Output is correct
52 Correct 84 ms 38676 KB Output is correct
53 Correct 81 ms 30276 KB Output is correct
54 Correct 76 ms 30276 KB Output is correct
55 Correct 122 ms 30380 KB Output is correct
56 Correct 136 ms 30544 KB Output is correct
57 Correct 172 ms 31224 KB Output is correct
58 Correct 174 ms 31144 KB Output is correct
59 Correct 179 ms 31208 KB Output is correct
60 Correct 159 ms 31868 KB Output is correct
61 Correct 131 ms 35148 KB Output is correct
62 Correct 129 ms 35108 KB Output is correct
63 Correct 150 ms 35060 KB Output is correct
64 Correct 132 ms 35324 KB Output is correct
65 Correct 232 ms 30864 KB Output is correct
66 Correct 156 ms 30456 KB Output is correct
67 Correct 133 ms 30476 KB Output is correct
68 Correct 76 ms 28288 KB Output is correct
69 Correct 77 ms 28252 KB Output is correct
70 Correct 142 ms 35896 KB Output is correct
71 Correct 107 ms 34408 KB Output is correct
72 Correct 5 ms 9812 KB Output is correct
73 Correct 12 ms 11404 KB Output is correct
74 Correct 10 ms 11348 KB Output is correct
75 Correct 5 ms 9812 KB Output is correct
76 Correct 6 ms 9812 KB Output is correct
77 Correct 10 ms 11916 KB Output is correct
78 Correct 11 ms 11476 KB Output is correct
79 Correct 10 ms 11404 KB Output is correct
80 Correct 11 ms 11472 KB Output is correct
81 Correct 5 ms 9812 KB Output is correct
82 Correct 5 ms 9724 KB Output is correct
83 Correct 5 ms 9812 KB Output is correct
84 Correct 6 ms 9812 KB Output is correct
85 Correct 5 ms 9812 KB Output is correct
86 Correct 45 ms 15344 KB Output is correct
87 Correct 42 ms 15376 KB Output is correct
88 Correct 48 ms 15388 KB Output is correct
89 Correct 12 ms 11912 KB Output is correct
90 Correct 11 ms 11540 KB Output is correct
91 Correct 40 ms 16604 KB Output is correct
92 Correct 46 ms 16408 KB Output is correct
93 Correct 5 ms 9812 KB Output is correct
94 Correct 154 ms 39728 KB Output is correct
95 Correct 163 ms 39484 KB Output is correct
96 Correct 144 ms 38788 KB Output is correct
97 Correct 94 ms 38704 KB Output is correct
98 Correct 104 ms 41312 KB Output is correct
99 Correct 190 ms 31188 KB Output is correct
100 Correct 186 ms 31304 KB Output is correct
101 Correct 175 ms 31176 KB Output is correct
102 Correct 159 ms 31456 KB Output is correct
103 Correct 130 ms 34780 KB Output is correct
104 Correct 126 ms 35152 KB Output is correct
105 Correct 123 ms 34664 KB Output is correct
106 Correct 110 ms 34704 KB Output is correct
107 Correct 105 ms 34508 KB Output is correct
108 Correct 83 ms 38652 KB Output is correct
109 Correct 86 ms 38724 KB Output is correct
110 Correct 76 ms 30264 KB Output is correct
111 Correct 73 ms 30264 KB Output is correct
112 Correct 125 ms 30432 KB Output is correct
113 Correct 132 ms 30412 KB Output is correct