oj.uz

Submission #932919

# Submission time Handle Problem Language Result Execution time Memory
932919 2024-02-24T14:18:22 Z ParsaS Capital City (JOI20_capital_city) C++17
41 / 100
 1705 ms 524288 KB 
// In the name of God
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 2e5 + 5, lg = 20;
int n, k;
int up[N][lg], f[N], c[N];
vector<int> adj[N], ver[N];
int h[N], tin[N], tout[N], T;
int par[N];

void dfs(int v, int p) {
	par[v] = p;
	up[v][0] = p;
	for (int i = 1; i < lg; i++)
		up[v][i] = up[up[v][i - 1]][i - 1];
	tin[v] = ++T;
	for (auto u : adj[v]) {
		if (u != p) {
			h[u] = h[v] + 1;
			dfs(u, v);
		}
	}
	tout[v] = T;
}

bool anc(int v, int u) {
	return tin[v] <= tin[u] && tout[v] >= tout[u];
}
int lca(int v, int u) {
	if (tin[v] > tin[u]) swap(v, u);
	if (anc(v, u)) return v;
	for (int i = lg - 1; i >= 0; i--)
		if (!anc(up[u][i], v))
			u = up[u][i];
	return up[u][0];

}
vector<int> out[N], in[N];

void dfs2(int v, int p) {
	int u = par[v];
	while (h[u] > h[f[c[v]]]) {
		out[c[v]].pb(c[u]);
		in[c[u]].pb(c[v]);


		u = par[u];
	}
	par[v] = u;
	if (h[u] >= h[f[c[v]]]) {
		out[c[v]].pb(c[f[c[v]]]);
		in[c[f[c[v]]]].pb(c[v]);


		par[v] = par[f[c[v]]];
	}
	for (auto u : adj[v]) {
		if (u != p)
			dfs2(u, v);
	}
}
bool vis[N];
int col[N];
vector<int> vec;

void dfs3(int v) {
	vis[v] = true;
	for (auto u : out[v]) {
		if (!vis[u]) dfs3(u);
	}
	vec.pb(v);
}
vector<int> V;

void dfs4(int v, int x) {
	col[v] = x;
	for (auto u : in[v]) {
		if (!col[u])
			dfs4(u, x);
	}
	V.pb(v);
}

void solve() {
	cin >> n >> k;
	for (int i = 0; i < n - 1; i++) {
		int v, u; cin >> v >> u;
		adj[v].pb(u);
		adj[u].pb(v);
	}
	for (int i = 1; i <= n; i++) cin >> c[i], ver[c[i]].pb(i);

	dfs(1, 0);
	h[0] = -1;
	tout[0] = T;

	for (int i = 1; i <= k; i++) {
		f[i] = ver[i].back();
		for (auto v : ver[i])
			f[i] = lca(f[i], v);
	}

	dfs2(1, 0);
	for (int i = 1; i <= k; i++) {
		if (!vis[i])
			dfs3(i);
	}
	int ans = n + 1;
	for (int i = k - 1; i >= 0; i--) {
		int w = vec[i];
		if (col[w] == 0) {
			V.clear();
			dfs4(w, w);
			bool ok = true;
			int cnt = V.size();
			for (auto v : V) {
				for (auto u : out[v])
					ok &= col[u] == col[v];
			}
			if (ok) ans = min(ans, cnt);	
		}
	}
	cout << ans - 1 << '\n';

}

int32_t main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

	int tc = 1; // cin >> tc;
	while (tc--) {
		solve();
	}

	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 22872 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 9 ms 22872 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 5 ms 23040 KB Output is correct
7 Correct 4 ms 22988 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 4 ms 23032 KB Output is correct
10 Correct 5 ms 22876 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 22872 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 9 ms 22872 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 5 ms 23040 KB Output is correct
7 Correct 4 ms 22988 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 4 ms 23032 KB Output is correct
10 Correct 5 ms 22876 KB Output is correct
11 Correct 6 ms 23128 KB Output is correct
12 Correct 6 ms 23216 KB Output is correct
13 Correct 8 ms 23044 KB Output is correct
14 Correct 6 ms 23288 KB Output is correct
15 Correct 6 ms 23132 KB Output is correct
16 Correct 7 ms 23132 KB Output is correct
17 Correct 5 ms 23236 KB Output is correct
18 Correct 5 ms 23284 KB Output is correct
19 Correct 7 ms 23384 KB Output is correct
20 Correct 6 ms 23240 KB Output is correct
21 Correct 5 ms 23132 KB Output is correct
22 Correct 6 ms 23388 KB Output is correct
23 Correct 7 ms 23132 KB Output is correct
24 Correct 6 ms 23132 KB Output is correct
25 Correct 6 ms 23132 KB Output is correct
26 Correct 6 ms 23132 KB Output is correct
27 Correct 6 ms 23132 KB Output is correct
28 Correct 6 ms 23248 KB Output is correct
29 Correct 6 ms 23132 KB Output is correct
30 Correct 6 ms 23132 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 75408 KB Output is correct
2 Correct 107 ms 75904 KB Output is correct
3 Correct 238 ms 75164 KB Output is correct
4 Correct 103 ms 75980 KB Output is correct
5 Correct 219 ms 71880 KB Output is correct
6 Correct 103 ms 75832 KB Output is correct
7 Correct 201 ms 71784 KB Output is correct
8 Correct 105 ms 74892 KB Output is correct
9 Correct 202 ms 68576 KB Output is correct
10 Correct 196 ms 66132 KB Output is correct
11 Correct 217 ms 68816 KB Output is correct
12 Correct 233 ms 71716 KB Output is correct
13 Correct 190 ms 65744 KB Output is correct
14 Correct 204 ms 72012 KB Output is correct
15 Correct 200 ms 71640 KB Output is correct
16 Correct 204 ms 66764 KB Output is correct
17 Correct 196 ms 67276 KB Output is correct
18 Correct 196 ms 67500 KB Output is correct
19 Correct 195 ms 70604 KB Output is correct
20 Correct 210 ms 72652 KB Output is correct
21 Correct 6 ms 22876 KB Output is correct

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 22872 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 9 ms 22872 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 5 ms 23040 KB Output is correct
7 Correct 4 ms 22988 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 4 ms 23032 KB Output is correct
10 Correct 5 ms 22876 KB Output is correct
11 Correct 6 ms 23128 KB Output is correct
12 Correct 6 ms 23216 KB Output is correct
13 Correct 8 ms 23044 KB Output is correct
14 Correct 6 ms 23288 KB Output is correct
15 Correct 6 ms 23132 KB Output is correct
16 Correct 7 ms 23132 KB Output is correct
17 Correct 5 ms 23236 KB Output is correct
18 Correct 5 ms 23284 KB Output is correct
19 Correct 7 ms 23384 KB Output is correct
20 Correct 6 ms 23240 KB Output is correct
21 Correct 5 ms 23132 KB Output is correct
22 Correct 6 ms 23388 KB Output is correct
23 Correct 7 ms 23132 KB Output is correct
24 Correct 6 ms 23132 KB Output is correct
25 Correct 6 ms 23132 KB Output is correct
26 Correct 6 ms 23132 KB Output is correct
27 Correct 6 ms 23132 KB Output is correct
28 Correct 6 ms 23248 KB Output is correct
29 Correct 6 ms 23132 KB Output is correct
30 Correct 6 ms 23132 KB Output is correct
31 Correct 211 ms 75408 KB Output is correct
32 Correct 107 ms 75904 KB Output is correct
33 Correct 238 ms 75164 KB Output is correct
34 Correct 103 ms 75980 KB Output is correct
35 Correct 219 ms 71880 KB Output is correct
36 Correct 103 ms 75832 KB Output is correct
37 Correct 201 ms 71784 KB Output is correct
38 Correct 105 ms 74892 KB Output is correct
39 Correct 202 ms 68576 KB Output is correct
40 Correct 196 ms 66132 KB Output is correct
41 Correct 217 ms 68816 KB Output is correct
42 Correct 233 ms 71716 KB Output is correct
43 Correct 190 ms 65744 KB Output is correct
44 Correct 204 ms 72012 KB Output is correct
45 Correct 200 ms 71640 KB Output is correct
46 Correct 204 ms 66764 KB Output is correct
47 Correct 196 ms 67276 KB Output is correct
48 Correct 196 ms 67500 KB Output is correct
49 Correct 195 ms 70604 KB Output is correct
50 Correct 210 ms 72652 KB Output is correct
51 Correct 6 ms 22876 KB Output is correct
52 Correct 207 ms 56184 KB Output is correct
53 Correct 224 ms 56120 KB Output is correct
54 Correct 185 ms 56012 KB Output is correct
55 Correct 187 ms 56052 KB Output is correct
56 Correct 203 ms 55980 KB Output is correct
57 Correct 206 ms 55984 KB Output is correct
58 Correct 200 ms 60736 KB Output is correct
59 Correct 221 ms 61600 KB Output is correct
60 Runtime error 1705 ms 524288 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -