oj.uz

Submission #666718

# Submission time Handle Problem Language Result Execution time Memory
666718 2022-11-29T12:24:07 Z Eae02 Railway (BOI17_railway) C++17
100 / 100
 237 ms 22644 KB 
#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
using namespace std;
using ll = long long;

struct HLD {
	vector<ll> depth, parent, arridx, hpLeaf, hpRoot, hchild;
	HLD(const vector<vector<ll>>& t) { // t is an adjacency list, or a child list for a tree rooted in node 0
		parent = hchild = vector<ll>(t.size(), -1);
		depth = arridx = hpLeaf = hpRoot = vector<ll>(t.size());
		vector<ll> sts(t.size(), 1), ci(t.size()), st{0}, trav{0};
		while (!st.empty()) {
			ll cur = st.back(), nx;
			if (ci[cur] == (ll)t[cur].size()) {
				st.pop_back();
				if (st.empty()) continue;
				sts[st.back()] += sts[cur];
				if (hchild[st.back()] == -1 || sts[cur] > sts[hchild[st.back()]])
					hchild[st.back()] = cur;
			} else if ((nx = t[cur][ci[cur]++]) != parent[cur]) {
				depth[nx] = depth[cur] + 1;
				parent[nx] = cur;
				st.push_back(nx);
				trav.push_back(nx);
			}
		}
		iota(all(hpRoot), 0);
		iota(all(hpLeaf), 0);
		ll nai = 0;
		for (ll cur : trav) {
			if (hchild[cur] == -1) {
				arridx[cur] = nai;
				nai += depth[cur] - depth[hpRoot[cur]] + 1;
			}
			else
				hpRoot[hchild[cur]] = hpRoot[cur];
		}
		for (ll i = trav.size() - 1; i >= 0; i--) {
			if (hchild[trav[i]] == -1) continue;
			arridx[trav[i]] = arridx[hchild[trav[i]]] + 1;
			hpLeaf[trav[i]] = hpLeaf[hchild[trav[i]]];
		}
	}
	ll lca(ll a, ll b, vector<pair<ll, ll>>* llv = nullptr, bool llvIncludeLCA = true) {
		auto sdepth = [&] (ll i) { return i == -1 ? -1 : depth[i]; };
		auto addi = [&] (ll lo, ll hi) { if (llv && lo != hi) llv->emplace_back(lo, hi); };
		while (hpRoot[a] != hpRoot[b]) {
			ll nxa = parent[hpRoot[a]];
			ll nxb = parent[hpRoot[b]];
			if (sdepth(nxa) > sdepth(nxb)) {
				addi(arridx[a], arridx[hpRoot[a]] + 1);
				a = nxa;
			} else {
				addi(arridx[b], arridx[hpRoot[b]] + 1);
				b = nxb;
			}
		}
		if (depth[a] > depth[b])
			swap(a, b);
		addi(arridx[b], arridx[a] + llvIncludeLCA);
		return a;
	}
};

int main() {
	ll numNodes, numMinist, reqMinist;
	cin >> numNodes >> numMinist >> reqMinist;
	
	vector<vector<ll>> adj(numNodes);
	adj.resize(numNodes);
	
	map<pair<ll, ll>, ll> trackIds;
	
	for (ll i = 0; i < numNodes - 1; i++) {
		ll a, b;
		cin >> a >> b;
		a--;
		b--;
		trackIds.emplace(make_pair(min(a, b), max(a, b)), i+1);
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	
	HLD hld(adj);
	
	vector<ll> v(numNodes + 1);
	
	for (ll i = 0; i < numMinist; i++) {
		ll s, sel0;
		cin >> s >> sel0;
		
		if (s == 2) {
			ll sel1;
			cin >> sel1;
			vector<pair<ll, ll>> intv;
			hld.lca(sel0-1, sel1-1, &intv, false);
			for (auto [lo, hi] : intv) {
				v[lo]++;
				v[hi]--;
			}
		} else {
			vector<pair<ll, ll>> pts;
			for (ll j = 1; j < s; j++) {
				ll node;
				cin >> node;
				vector<pair<ll, ll>> intv;
				hld.lca(sel0-1, node-1, &intv, false);
				for (auto [lo, hi] : intv) {
					pts.emplace_back(lo, 1);
					pts.emplace_back(hi, -1);
				}
			}
			sort(all(pts));
			
			ll depth = 0;
			for (auto [x, d] : pts) {
				if (depth == 0) v[x]++;
				depth += d;
				if (depth == 0) v[x]--;
			}
		}
	}
	
	vector<ll> vps(numNodes + 1);
	for (ll i = 0; i < numNodes; i++)
		vps[i+1] = vps[i] + v[i];
	
	vector<ll> reqTracks;
	for (ll i = 1; i < numNodes; i++) {
		if (vps[hld.arridx[i]+1] >= reqMinist) {
			ll p = hld.parent[i];
			reqTracks.push_back(trackIds[{min(i, p), max(i, p)}]);
		}
	}
	
	sort(reqTracks.begin(), reqTracks.end());
	
	cout << reqTracks.size() << "\n";
	for (ll t : reqTracks) {
		cout << t << " ";
	}
	cout << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 2388 KB Output is correct
3 Correct 10 ms 2480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 2488 KB Output is correct
7 Correct 9 ms 2444 KB Output is correct
8 Correct 10 ms 2516 KB Output is correct
9 Correct 8 ms 2388 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 2388 KB Output is correct
3 Correct 10 ms 2480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 2488 KB Output is correct
7 Correct 9 ms 2444 KB Output is correct
8 Correct 10 ms 2516 KB Output is correct
9 Correct 8 ms 2388 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 67 ms 2748 KB Output is correct
16 Correct 71 ms 2692 KB Output is correct
17 Correct 71 ms 2780 KB Output is correct
18 Correct 11 ms 2468 KB Output is correct
19 Correct 9 ms 2388 KB Output is correct
20 Correct 46 ms 2812 KB Output is correct
21 Correct 58 ms 2816 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 10 ms 2432 KB Output is correct
24 Correct 9 ms 2352 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 0 ms 304 KB Output is correct
27 Correct 10 ms 2516 KB Output is correct
28 Correct 9 ms 2432 KB Output is correct
29 Correct 7 ms 2472 KB Output is correct
30 Correct 8 ms 2488 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 304 KB Output is correct
35 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 22172 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 131 ms 21512 KB Output is correct
4 Correct 126 ms 21516 KB Output is correct
5 Correct 143 ms 22176 KB Output is correct
6 Correct 155 ms 22644 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 21828 KB Output is correct
2 Correct 159 ms 21476 KB Output is correct
3 Correct 145 ms 21352 KB Output is correct
4 Correct 149 ms 21288 KB Output is correct
5 Correct 150 ms 21244 KB Output is correct
6 Correct 130 ms 21800 KB Output is correct
7 Correct 129 ms 21824 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 21828 KB Output is correct
2 Correct 159 ms 21476 KB Output is correct
3 Correct 145 ms 21352 KB Output is correct
4 Correct 149 ms 21288 KB Output is correct
5 Correct 150 ms 21244 KB Output is correct
6 Correct 130 ms 21800 KB Output is correct
7 Correct 129 ms 21824 KB Output is correct
8 Correct 141 ms 21740 KB Output is correct
9 Correct 136 ms 21932 KB Output is correct
10 Correct 147 ms 22416 KB Output is correct
11 Correct 137 ms 22288 KB Output is correct
12 Correct 148 ms 21192 KB Output is correct
13 Correct 143 ms 21288 KB Output is correct
14 Correct 212 ms 21344 KB Output is correct
15 Correct 209 ms 21252 KB Output is correct
16 Correct 159 ms 21356 KB Output is correct
17 Correct 150 ms 21260 KB Output is correct
18 Correct 147 ms 21328 KB Output is correct
19 Correct 146 ms 21404 KB Output is correct
20 Correct 130 ms 21756 KB Output is correct
21 Correct 132 ms 21824 KB Output is correct
22 Correct 130 ms 21780 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 2388 KB Output is correct
3 Correct 10 ms 2480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 2488 KB Output is correct
7 Correct 9 ms 2444 KB Output is correct
8 Correct 10 ms 2516 KB Output is correct
9 Correct 8 ms 2388 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 67 ms 2748 KB Output is correct
16 Correct 71 ms 2692 KB Output is correct
17 Correct 71 ms 2780 KB Output is correct
18 Correct 11 ms 2468 KB Output is correct
19 Correct 9 ms 2388 KB Output is correct
20 Correct 46 ms 2812 KB Output is correct
21 Correct 58 ms 2816 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 10 ms 2432 KB Output is correct
24 Correct 9 ms 2352 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 0 ms 304 KB Output is correct
27 Correct 10 ms 2516 KB Output is correct
28 Correct 9 ms 2432 KB Output is correct
29 Correct 7 ms 2472 KB Output is correct
30 Correct 8 ms 2488 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 304 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 138 ms 22172 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 131 ms 21512 KB Output is correct
39 Correct 126 ms 21516 KB Output is correct
40 Correct 143 ms 22176 KB Output is correct
41 Correct 155 ms 22644 KB Output is correct
42 Correct 125 ms 21828 KB Output is correct
43 Correct 159 ms 21476 KB Output is correct
44 Correct 145 ms 21352 KB Output is correct
45 Correct 149 ms 21288 KB Output is correct
46 Correct 150 ms 21244 KB Output is correct
47 Correct 130 ms 21800 KB Output is correct
48 Correct 129 ms 21824 KB Output is correct
49 Correct 141 ms 21740 KB Output is correct
50 Correct 136 ms 21932 KB Output is correct
51 Correct 147 ms 22416 KB Output is correct
52 Correct 137 ms 22288 KB Output is correct
53 Correct 148 ms 21192 KB Output is correct
54 Correct 143 ms 21288 KB Output is correct
55 Correct 212 ms 21344 KB Output is correct
56 Correct 209 ms 21252 KB Output is correct
57 Correct 159 ms 21356 KB Output is correct
58 Correct 150 ms 21260 KB Output is correct
59 Correct 147 ms 21328 KB Output is correct
60 Correct 146 ms 21404 KB Output is correct
61 Correct 130 ms 21756 KB Output is correct
62 Correct 132 ms 21824 KB Output is correct
63 Correct 130 ms 21780 KB Output is correct
64 Correct 130 ms 21748 KB Output is correct
65 Correct 153 ms 21372 KB Output is correct
66 Correct 237 ms 21348 KB Output is correct
67 Correct 203 ms 21300 KB Output is correct
68 Correct 135 ms 21316 KB Output is correct
69 Correct 131 ms 21376 KB Output is correct
70 Correct 136 ms 21752 KB Output is correct
71 Correct 131 ms 21816 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 10 ms 2388 KB Output is correct
74 Correct 9 ms 2356 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 9 ms 2488 KB Output is correct
78 Correct 9 ms 2432 KB Output is correct
79 Correct 7 ms 2388 KB Output is correct
80 Correct 8 ms 2392 KB Output is correct
81 Correct 1 ms 296 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 68 ms 2736 KB Output is correct
87 Correct 71 ms 2672 KB Output is correct
88 Correct 73 ms 2684 KB Output is correct
89 Correct 11 ms 2516 KB Output is correct
90 Correct 9 ms 2484 KB Output is correct
91 Correct 45 ms 2808 KB Output is correct
92 Correct 62 ms 2756 KB Output is correct
93 Correct 1 ms 300 KB Output is correct
94 Correct 168 ms 22216 KB Output is correct
95 Correct 159 ms 21372 KB Output is correct
96 Correct 179 ms 21360 KB Output is correct
97 Correct 152 ms 22144 KB Output is correct
98 Correct 177 ms 22560 KB Output is correct
99 Correct 169 ms 21296 KB Output is correct
100 Correct 158 ms 21276 KB Output is correct
101 Correct 166 ms 21336 KB Output is correct
102 Correct 160 ms 21404 KB Output is correct
103 Correct 142 ms 21824 KB Output is correct
104 Correct 138 ms 21792 KB Output is correct
105 Correct 146 ms 21772 KB Output is correct
106 Correct 140 ms 21772 KB Output is correct
107 Correct 136 ms 21824 KB Output is correct
108 Correct 147 ms 22280 KB Output is correct
109 Correct 143 ms 22312 KB Output is correct
110 Correct 150 ms 21172 KB Output is correct
111 Correct 146 ms 21216 KB Output is correct
112 Correct 224 ms 21280 KB Output is correct
113 Correct 218 ms 21292 KB Output is correct