oj.uz

Submission #542724

# Submission time Handle Problem Language Result Execution time Memory
542724 2022-03-27T17:53:59 Z skittles1412 Railway (BOI17_railway) C++17
100 / 100
 99 ms 22980 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
	cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
	cerr << t << " | ";
	dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
	cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
		 << ": ";                                          \
	dbgh(__VA_ARGS__)
#else
#define cerr   \
	if (false) \
	cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

const int maxn = 1e5 + 5, logn = 20;

int t, tin[maxn], tout[maxn], lift[logn][maxn];
vector<int> graph[maxn];

void dfs(int u, int p = -1) {
	tin[u] = t++;
	lift[0][u] = p;
	for (auto& v : graph[u]) {
		if (v != p) {
			dfs(v, u);
		}
	}
	tout[u] = t++;
}

bool anc(int u, int v) {
	return tin[u] <= tin[v] && tout[v] <= tout[u];
}

int lca(int u, int v) {
	if (anc(u, v)) {
		return u;
	}
	for (int i = logn - 1; i >= 0; i--) {
		int nu = lift[i][u];
		if (nu != -1 && !anc(nu, v)) {
			u = nu;
		}
	}
	return lift[0][u];
}

void solve() {
	int n, q, k;
	cin >> n >> q >> k;
	int edges[n - 1][2];
	for (auto& [u, v] : edges) {
		cin >> u >> v;
		u--;
		v--;
		graph[u].push_back(v);
		graph[v].push_back(u);
	}
	dfs(0);
	for (int i = 1; i < logn; i++) {
		for (int j = 0; j < n; j++) {
			if (lift[i - 1][j] == -1) {
				lift[i][j] = -1;
			} else {
				lift[i][j] = lift[i - 1][lift[i - 1][j]];
			}
		}
	}
	int psum[n * 2 + 1] {};
	auto add = [&](int l, int r) -> void {
		psum[l]++;
		psum[r + 1]--;
	};
	while (q--) {
		dbg("Q");
		int m;
		cin >> m;
		int arr[m];
		for (auto& a : arr) {
			cin >> a;
			a--;
		}
		sort(arr, arr + m, [&](int a, int b) -> bool {
			return tin[a] < tin[b];
		});
		vector<int> vtree(arr, arr + m);
		for (int i = 0; i < m - 1; i++) {
			vtree.push_back(lca(arr[i], arr[i + 1]));
		}
		sort(begin(vtree), end(vtree), [&](int a, int b) -> bool {
			return tin[a] < tin[b];
		});
		vtree.erase(unique(begin(vtree), end(vtree)), vtree.end());
		vector<int> stk;
		for (auto& a : vtree) {
			dbg(a);
		}
		for (auto& a : vtree) {
			while (sz(stk) && !anc(stk.back(), a)) {
				stk.pop_back();
			}
			if (sz(stk)) {
				dbg(stk.back(), a);
				add(tin[stk.back()] + 1, tin[a]);
			}
			stk.push_back(a);
		}
	}
	for (int i = 0; i < 2 * n; i++) {
		psum[i + 1] += psum[i];
	}
	for (int i = 0; i < n; i++) {
		dbg(i, psum[tin[i]] - psum[tout[i]]);
	}
	vector<int> ans;
	for (int i = 0; i < n - 1; i++) {
		auto [u, v] = edges[i];
		if (lift[0][u] == v) {
			swap(u, v);
		}
		if (psum[tin[v]] - psum[tout[v]] >= k) {
			ans.push_back(i);
		}
	}
	cout << sz(ans) << endl;
	for (int i = 0; i < sz(ans); i++) {
		cout << ans[i] + 1 << " \n"[i == sz(ans) - 1];
	}
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cin.exceptions(ios::failbit);
	solve();
}

Compilation message

railway.cpp: In function 'void solve()':
railway.cpp:112:14: warning: unused variable 'a' [-Wunused-variable]
  112 |   for (auto& a : vtree) {
      |              ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4180 KB Output is correct
9 Correct 5 ms 4228 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4180 KB Output is correct
9 Correct 5 ms 4228 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 22 ms 4500 KB Output is correct
16 Correct 25 ms 4596 KB Output is correct
17 Correct 27 ms 4620 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 18 ms 4716 KB Output is correct
21 Correct 20 ms 4664 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4184 KB Output is correct
24 Correct 6 ms 4172 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4360 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4180 KB Output is correct
31 Correct 2 ms 2684 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 22596 KB Output is correct
2 Correct 2 ms 2684 KB Output is correct
3 Correct 54 ms 22256 KB Output is correct
4 Correct 51 ms 21632 KB Output is correct
5 Correct 53 ms 22488 KB Output is correct
6 Correct 60 ms 22980 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 19332 KB Output is correct
2 Correct 66 ms 17792 KB Output is correct
3 Correct 69 ms 17768 KB Output is correct
4 Correct 71 ms 17808 KB Output is correct
5 Correct 68 ms 17852 KB Output is correct
6 Correct 62 ms 19444 KB Output is correct
7 Correct 57 ms 19360 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 19332 KB Output is correct
2 Correct 66 ms 17792 KB Output is correct
3 Correct 69 ms 17768 KB Output is correct
4 Correct 71 ms 17808 KB Output is correct
5 Correct 68 ms 17852 KB Output is correct
6 Correct 62 ms 19444 KB Output is correct
7 Correct 57 ms 19360 KB Output is correct
8 Correct 73 ms 19444 KB Output is correct
9 Correct 70 ms 19472 KB Output is correct
10 Correct 54 ms 22596 KB Output is correct
11 Correct 55 ms 22636 KB Output is correct
12 Correct 67 ms 17664 KB Output is correct
13 Correct 83 ms 17736 KB Output is correct
14 Correct 66 ms 17692 KB Output is correct
15 Correct 70 ms 17696 KB Output is correct
16 Correct 80 ms 17808 KB Output is correct
17 Correct 76 ms 17828 KB Output is correct
18 Correct 69 ms 17808 KB Output is correct
19 Correct 71 ms 17864 KB Output is correct
20 Correct 66 ms 19712 KB Output is correct
21 Correct 87 ms 19740 KB Output is correct
22 Correct 70 ms 19708 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4180 KB Output is correct
9 Correct 5 ms 4228 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 22 ms 4500 KB Output is correct
16 Correct 25 ms 4596 KB Output is correct
17 Correct 27 ms 4620 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 18 ms 4716 KB Output is correct
21 Correct 20 ms 4664 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4184 KB Output is correct
24 Correct 6 ms 4172 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4360 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4180 KB Output is correct
31 Correct 2 ms 2684 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 62 ms 22596 KB Output is correct
37 Correct 2 ms 2684 KB Output is correct
38 Correct 54 ms 22256 KB Output is correct
39 Correct 51 ms 21632 KB Output is correct
40 Correct 53 ms 22488 KB Output is correct
41 Correct 60 ms 22980 KB Output is correct
42 Correct 59 ms 19332 KB Output is correct
43 Correct 66 ms 17792 KB Output is correct
44 Correct 69 ms 17768 KB Output is correct
45 Correct 71 ms 17808 KB Output is correct
46 Correct 68 ms 17852 KB Output is correct
47 Correct 62 ms 19444 KB Output is correct
48 Correct 57 ms 19360 KB Output is correct
49 Correct 73 ms 19444 KB Output is correct
50 Correct 70 ms 19472 KB Output is correct
51 Correct 54 ms 22596 KB Output is correct
52 Correct 55 ms 22636 KB Output is correct
53 Correct 67 ms 17664 KB Output is correct
54 Correct 83 ms 17736 KB Output is correct
55 Correct 66 ms 17692 KB Output is correct
56 Correct 70 ms 17696 KB Output is correct
57 Correct 80 ms 17808 KB Output is correct
58 Correct 76 ms 17828 KB Output is correct
59 Correct 69 ms 17808 KB Output is correct
60 Correct 71 ms 17864 KB Output is correct
61 Correct 66 ms 19712 KB Output is correct
62 Correct 87 ms 19740 KB Output is correct
63 Correct 70 ms 19708 KB Output is correct
64 Correct 81 ms 19588 KB Output is correct
65 Correct 99 ms 17868 KB Output is correct
66 Correct 86 ms 17704 KB Output is correct
67 Correct 98 ms 17704 KB Output is correct
68 Correct 73 ms 17660 KB Output is correct
69 Correct 54 ms 17648 KB Output is correct
70 Correct 91 ms 19876 KB Output is correct
71 Correct 76 ms 19308 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 6 ms 4180 KB Output is correct
74 Correct 6 ms 4180 KB Output is correct
75 Correct 3 ms 2692 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 6 ms 4388 KB Output is correct
78 Correct 6 ms 4180 KB Output is correct
79 Correct 5 ms 4180 KB Output is correct
80 Correct 6 ms 4180 KB Output is correct
81 Correct 2 ms 2772 KB Output is correct
82 Correct 2 ms 2684 KB Output is correct
83 Correct 2 ms 2772 KB Output is correct
84 Correct 2 ms 2772 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 26 ms 4588 KB Output is correct
87 Correct 24 ms 4588 KB Output is correct
88 Correct 32 ms 4568 KB Output is correct
89 Correct 9 ms 4436 KB Output is correct
90 Correct 7 ms 4176 KB Output is correct
91 Correct 22 ms 4788 KB Output is correct
92 Correct 26 ms 4712 KB Output is correct
93 Correct 2 ms 2688 KB Output is correct
94 Correct 74 ms 22532 KB Output is correct
95 Correct 58 ms 22216 KB Output is correct
96 Correct 62 ms 21644 KB Output is correct
97 Correct 57 ms 22552 KB Output is correct
98 Correct 71 ms 22928 KB Output is correct
99 Correct 93 ms 17816 KB Output is correct
100 Correct 81 ms 17868 KB Output is correct
101 Correct 76 ms 17816 KB Output is correct
102 Correct 87 ms 17844 KB Output is correct
103 Correct 71 ms 19416 KB Output is correct
104 Correct 70 ms 19784 KB Output is correct
105 Correct 70 ms 19344 KB Output is correct
106 Correct 89 ms 19592 KB Output is correct
107 Correct 89 ms 19472 KB Output is correct
108 Correct 75 ms 22680 KB Output is correct
109 Correct 65 ms 22672 KB Output is correct
110 Correct 69 ms 17660 KB Output is correct
111 Correct 80 ms 17640 KB Output is correct
112 Correct 88 ms 17700 KB Output is correct
113 Correct 79 ms 17788 KB Output is correct