oj.uz

Submission #304847

# Submission time Handle Problem Language Result Execution time Memory
304847 2020-09-22T02:31:13 Z penguinhacker Railway (BOI17_railway) C++17
100 / 100
 140 ms 22384 KB 
//source: https://oj.uz/problem/view/BOI17_railway
#include <bits/stdc++.h>
using namespace std;

const int mxN = 100000, K = 17;
int n, m, k, id[mxN];
int tin[mxN], tout[mxN], timer = 0;
int anc[mxN][K];
vector<pair<int, int>> adj[mxN];

void dfs(int u = 0, int p = -1) {
	tin[u] = timer++;
	anc[u][0] = p;
	for (int i = 1; i < K; ++i) {
		anc[u][i] = anc[u][i - 1] == -1 ? -1 : anc[anc[u][i - 1]][i - 1];
	}
	for (pair<int, int> v : adj[u]) {
		if (v.first != p) {
			id[v.first] = v.second;
			dfs(v.first, u);
		}
	}
	tout[u] = timer++;
}

bool is_anc(int a, int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca(int a, int b) {
	//assert(tin[a] <= tin[b]);
	if (is_anc(a, b)) {
		return a;
	}
	//cout << a << " " << b << " ";
	for (int i = K - 1; ~i; --i) {
		if (anc[a][i] != -1 && !is_anc(anc[a][i], b)) {
			a = anc[a][i];
		}
	}
	//cout << a << " " << anc[a][0] << "\n";
	return anc[a][0];
}

/*int bit[2 * mxN + 1];
void upd(int i, int val) {
	for (++i; i <= 2 * n; i += i & -i) {
		bit[i] += val;
	}
}

int qry(int a, int b) {
	int res = 0;
	for (++a; a > 0; a -= a & -a) {
		res += bit[a];
	}
	for (++b; b > 0; b -= b & -b) {
		res -= bit[b];
	}
	return res;
}*/
int cnt[2 * mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> k;
	for (int i = 1; i < n; ++i) {
		int a, b;
		cin >> a >> b, --a, --b;
		adj[a].emplace_back(b, i);
		adj[b].emplace_back(a, i);
	}
	dfs();
	/*for (int i = 0; i < n; ++i) {
		cout << tin[i] << " " << tout[i] << "\n";
	}*/
	for (int i = 0; i < m; ++i) {
		int num;
		cin >> num;
		vector<int> pos(num);
		for (int& i : pos) {
			cin >> i, --i;
		}
		sort(pos.begin(), pos.end(), [](int a, int b) {return tin[a] < tin[b];});
		pos.push_back(pos[0]);
		//cout << "POS: ";
		for (int i = 0; i < num; ++i) {
			//cout << pos[i] << " ";
			//upd(tin[pos[i]], 1);
			//upd(tin[pos[(i + 1) % num]], 1);
			--cnt[tin[pos[i]] + 1];
			--cnt[tin[pos[i + 1]] + 1];
			int l = lca(pos[i], pos[i + 1]);
			//cout << "LCA: " << pos[i] << " " << pos[i + 1] << " " << l << "\n";
			cnt[tin[l] + 1] += 2;
		}
		//cout << "\n";
	}
	for (int i = 1; i < 2 * n; ++i) {
		cnt[i] += cnt[i - 1];
	}
	vector<int> ans;
	for (int i = 1; i < n; ++i) {
		//int num = qry(tin[i], tout[i]);
		int num = cnt[tin[i]] - cnt[tout[i]];
		//cout << num << "\n";
		if (num >= 2 * k) {
			ans.push_back(id[i]);
		}
	}
	sort(ans.begin(), ans.end());
	cout << ans.size() << "\n";
	for (int i : ans) {
		cout << i << " ";
	}
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4352 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 6 ms 4096 KB Output is correct
9 Correct 7 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4352 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 6 ms 4096 KB Output is correct
9 Correct 7 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 22 ms 4480 KB Output is correct
16 Correct 23 ms 4480 KB Output is correct
17 Correct 22 ms 4600 KB Output is correct
18 Correct 8 ms 4352 KB Output is correct
19 Correct 7 ms 4096 KB Output is correct
20 Correct 21 ms 4608 KB Output is correct
21 Correct 24 ms 4608 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 7 ms 4096 KB Output is correct
24 Correct 7 ms 4096 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 9 ms 4480 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 6 ms 4096 KB Output is correct
30 Correct 6 ms 4096 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 21872 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 124 ms 21584 KB Output is correct
4 Correct 120 ms 21112 KB Output is correct
5 Correct 75 ms 21876 KB Output is correct
6 Correct 78 ms 22256 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 19064 KB Output is correct
2 Correct 105 ms 17144 KB Output is correct
3 Correct 110 ms 16888 KB Output is correct
4 Correct 99 ms 16824 KB Output is correct
5 Correct 108 ms 16764 KB Output is correct
6 Correct 95 ms 19320 KB Output is correct
7 Correct 92 ms 19192 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 19064 KB Output is correct
2 Correct 105 ms 17144 KB Output is correct
3 Correct 110 ms 16888 KB Output is correct
4 Correct 99 ms 16824 KB Output is correct
5 Correct 108 ms 16764 KB Output is correct
6 Correct 95 ms 19320 KB Output is correct
7 Correct 92 ms 19192 KB Output is correct
8 Correct 108 ms 19192 KB Output is correct
9 Correct 116 ms 19320 KB Output is correct
10 Correct 74 ms 21924 KB Output is correct
11 Correct 76 ms 21872 KB Output is correct
12 Correct 81 ms 16760 KB Output is correct
13 Correct 81 ms 16888 KB Output is correct
14 Correct 104 ms 16760 KB Output is correct
15 Correct 101 ms 16760 KB Output is correct
16 Correct 122 ms 16888 KB Output is correct
17 Correct 105 ms 16888 KB Output is correct
18 Correct 106 ms 16888 KB Output is correct
19 Correct 106 ms 17016 KB Output is correct
20 Correct 93 ms 19448 KB Output is correct
21 Correct 99 ms 19704 KB Output is correct
22 Correct 93 ms 19448 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4352 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 6 ms 4096 KB Output is correct
9 Correct 7 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 22 ms 4480 KB Output is correct
16 Correct 23 ms 4480 KB Output is correct
17 Correct 22 ms 4600 KB Output is correct
18 Correct 8 ms 4352 KB Output is correct
19 Correct 7 ms 4096 KB Output is correct
20 Correct 21 ms 4608 KB Output is correct
21 Correct 24 ms 4608 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 7 ms 4096 KB Output is correct
24 Correct 7 ms 4096 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 9 ms 4480 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 6 ms 4096 KB Output is correct
30 Correct 6 ms 4096 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 127 ms 21872 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 124 ms 21584 KB Output is correct
39 Correct 120 ms 21112 KB Output is correct
40 Correct 75 ms 21876 KB Output is correct
41 Correct 78 ms 22256 KB Output is correct
42 Correct 95 ms 19064 KB Output is correct
43 Correct 105 ms 17144 KB Output is correct
44 Correct 110 ms 16888 KB Output is correct
45 Correct 99 ms 16824 KB Output is correct
46 Correct 108 ms 16764 KB Output is correct
47 Correct 95 ms 19320 KB Output is correct
48 Correct 92 ms 19192 KB Output is correct
49 Correct 108 ms 19192 KB Output is correct
50 Correct 116 ms 19320 KB Output is correct
51 Correct 74 ms 21924 KB Output is correct
52 Correct 76 ms 21872 KB Output is correct
53 Correct 81 ms 16760 KB Output is correct
54 Correct 81 ms 16888 KB Output is correct
55 Correct 104 ms 16760 KB Output is correct
56 Correct 101 ms 16760 KB Output is correct
57 Correct 122 ms 16888 KB Output is correct
58 Correct 105 ms 16888 KB Output is correct
59 Correct 106 ms 16888 KB Output is correct
60 Correct 106 ms 17016 KB Output is correct
61 Correct 93 ms 19448 KB Output is correct
62 Correct 99 ms 19704 KB Output is correct
63 Correct 93 ms 19448 KB Output is correct
64 Correct 104 ms 19484 KB Output is correct
65 Correct 113 ms 16892 KB Output is correct
66 Correct 108 ms 16760 KB Output is correct
67 Correct 100 ms 16760 KB Output is correct
68 Correct 73 ms 16504 KB Output is correct
69 Correct 70 ms 16504 KB Output is correct
70 Correct 109 ms 19700 KB Output is correct
71 Correct 100 ms 19064 KB Output is correct
72 Correct 3 ms 2688 KB Output is correct
73 Correct 8 ms 4096 KB Output is correct
74 Correct 7 ms 4096 KB Output is correct
75 Correct 2 ms 2688 KB Output is correct
76 Correct 2 ms 2688 KB Output is correct
77 Correct 7 ms 4352 KB Output is correct
78 Correct 7 ms 4096 KB Output is correct
79 Correct 6 ms 4096 KB Output is correct
80 Correct 7 ms 4096 KB Output is correct
81 Correct 2 ms 2688 KB Output is correct
82 Correct 2 ms 2688 KB Output is correct
83 Correct 2 ms 2688 KB Output is correct
84 Correct 2 ms 2688 KB Output is correct
85 Correct 3 ms 2688 KB Output is correct
86 Correct 22 ms 4472 KB Output is correct
87 Correct 22 ms 4480 KB Output is correct
88 Correct 25 ms 4480 KB Output is correct
89 Correct 8 ms 4352 KB Output is correct
90 Correct 7 ms 4096 KB Output is correct
91 Correct 21 ms 4608 KB Output is correct
92 Correct 26 ms 4480 KB Output is correct
93 Correct 2 ms 2688 KB Output is correct
94 Correct 124 ms 21872 KB Output is correct
95 Correct 122 ms 21492 KB Output is correct
96 Correct 117 ms 20988 KB Output is correct
97 Correct 80 ms 21872 KB Output is correct
98 Correct 86 ms 22384 KB Output is correct
99 Correct 107 ms 16888 KB Output is correct
100 Correct 126 ms 16888 KB Output is correct
101 Correct 128 ms 16888 KB Output is correct
102 Correct 140 ms 17016 KB Output is correct
103 Correct 95 ms 19216 KB Output is correct
104 Correct 113 ms 19572 KB Output is correct
105 Correct 93 ms 19192 KB Output is correct
106 Correct 110 ms 19448 KB Output is correct
107 Correct 107 ms 19192 KB Output is correct
108 Correct 75 ms 22000 KB Output is correct
109 Correct 77 ms 21872 KB Output is correct
110 Correct 89 ms 16632 KB Output is correct
111 Correct 77 ms 16692 KB Output is correct
112 Correct 102 ms 16764 KB Output is correct
113 Correct 103 ms 16880 KB Output is correct