oj.uz

답안 #595744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595744 2022-07-14T05:28:44 Z penguinhacker 수도 (JOI20_capital_city) C++17
11 / 100
 2559 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=2e5;
int n, k, c[mxN], d[mxN], anc[mxN][18], tin[mxN], t, who[20*mxN], cnt[20*mxN];
vector<int> oc[mxN], adj1[mxN], adj2[20*mxN], adj3[20*mxN], st;
bool vis[20*mxN], out[20*mxN];

void dfs1(int u=0) {
	tin[u]=t++;
	for (int i=1; i<18; ++i)
		anc[u][i]=anc[anc[u][i-1]][i-1];
	for (int v : adj1[u])
		if (v!=anc[u][0]) {
			d[v]=d[u]+1, anc[v][0]=u;
			dfs1(v);
		}
}

int lca(int u, int v) {
	if (d[u]>d[v])
		swap(u, v);
	for (int i=17; ~i; --i)
		if (d[v]-(1<<i)>=d[u])
			v=anc[v][i];
	if (u==v)
		return u;
	for (int i=17; ~i; --i)
		if (anc[u][i]!=anc[v][i])
			u=anc[u][i], v=anc[v][i];
	return anc[u][0];
}

void dfs2(int u) {
	vis[u]=1;
	for (int v : adj2[u])
		if (!vis[v])
			dfs2(v);
	st.push_back(u);
}

void dfs3(int u, int rt) {
	vis[u]=0, who[u]=rt;
	cnt[rt]+=u<k;
	for (int v : adj3[u])
		if (vis[v])
			dfs3(v, rt);
}

int cur_ans;

void dfs4(int u) {
	vis[u]=1;
	cur_ans+=u<k;
	for (int v : adj2[u])
		if (!vis[v])
			dfs4(v);
}

void ae(int u, int v) {
	//if (u<20) cout << u << " " << v << endl;
	adj2[u].push_back(v);
	adj3[v].push_back(u);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	for (int i=1; i<n; ++i) {
		int u, v;
		cin >> u >> v, --u, --v;
		adj1[u].push_back(v);
		adj1[v].push_back(u);
	}
	for (int i=0; i<n; ++i) {
		cin >> c[i], --c[i];
		oc[c[i]].push_back(i);
	}
	dfs1();
	for (int i=0; i<k; ++i) {
		sort(oc[i].begin(), oc[i].end(), [&](int a, int b) { return tin[a]<tin[b]; } );
		for (int j=1; j<oc[i].size(); ++j) {
			int u=oc[i][j-1], v=oc[i][j];
			int uv=lca(u, v);
			ae(i, c[uv]);
			for (int rep=0; rep<2; ++rep) {
				for (int j=17; ~j; --j)
					if (d[u]-(1<<j)>=d[uv]) {
						//cout << i << " " << u << " " << j << endl;
						ae(i, j*n+u+k);
						u=anc[u][j];
					}
				swap(u, v);
			}
		}
	}
	for (int i=0; i<n; ++i) {
		ae(i+k, c[i]);
		for (int j=1; j<18; ++j) {
			ae(j*n+i+k, (j-1)*n+i+k);
			ae(j*n+i+k, (j-1)*n+anc[i][j-1]+k);
		}
	}

	/*int best_ans=69696969;
	for (int i=0; i<k; ++i) {
		memset(vis, 0, 20*n);
		cur_ans=0;
		dfs4(i);
		//cout << cur_ans << endl;
		best_ans=min(best_ans, cur_ans-1);
	}
	cout << best_ans;
	return 0;*/

	for (int i=0; i<k+18*n; ++i)
		if (!vis[i])
			dfs2(i);
	reverse(st.begin(), st.end());
	for (int i : st)
		if (vis[i])
			dfs3(i, i);
	for (int i : st)
		for (int j : adj2[i])
			if (who[i]!=who[j])
				out[who[i]]=1;
	//for (int i=0; i<k; ++i)
	//	cout << who[i] << endl;
	int ans=69696969;
	for (int i=0; i<k; ++i)
		if (!out[who[i]])
			ans=min(ans, cnt[who[i]]-1);
	cout << ans;
	return 0;
}

Compilation message

capital_city.cpp: In function 'int main()':
capital_city.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   for (int j=1; j<oc[i].size(); ++j) {
      |                 ~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 197608 KB Output is correct
2 Correct 90 ms 197644 KB Output is correct
3 Correct 91 ms 197540 KB Output is correct
4 Correct 93 ms 197536 KB Output is correct
5 Correct 93 ms 197576 KB Output is correct
6 Correct 88 ms 197648 KB Output is correct
7 Correct 94 ms 197624 KB Output is correct
8 Correct 88 ms 197616 KB Output is correct
9 Correct 95 ms 197724 KB Output is correct
10 Correct 99 ms 197608 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 197608 KB Output is correct
2 Correct 90 ms 197644 KB Output is correct
3 Correct 91 ms 197540 KB Output is correct
4 Correct 93 ms 197536 KB Output is correct
5 Correct 93 ms 197576 KB Output is correct
6 Correct 88 ms 197648 KB Output is correct
7 Correct 94 ms 197624 KB Output is correct
8 Correct 88 ms 197616 KB Output is correct
9 Correct 95 ms 197724 KB Output is correct
10 Correct 99 ms 197608 KB Output is correct
11 Correct 107 ms 200964 KB Output is correct
12 Correct 103 ms 200832 KB Output is correct
13 Correct 114 ms 200852 KB Output is correct
14 Correct 105 ms 200924 KB Output is correct
15 Correct 106 ms 200856 KB Output is correct
16 Correct 104 ms 200884 KB Output is correct
17 Correct 101 ms 200888 KB Output is correct
18 Correct 105 ms 200908 KB Output is correct
19 Correct 105 ms 200912 KB Output is correct
20 Correct 104 ms 200896 KB Output is correct
21 Correct 101 ms 200896 KB Output is correct
22 Correct 105 ms 200948 KB Output is correct
23 Correct 122 ms 201148 KB Output is correct
24 Correct 107 ms 200804 KB Output is correct
25 Correct 112 ms 200836 KB Output is correct
26 Correct 107 ms 200848 KB Output is correct
27 Correct 106 ms 200824 KB Output is correct
28 Correct 102 ms 200816 KB Output is correct
29 Correct 104 ms 200780 KB Output is correct
30 Correct 107 ms 200864 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2559 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 197608 KB Output is correct
2 Correct 90 ms 197644 KB Output is correct
3 Correct 91 ms 197540 KB Output is correct
4 Correct 93 ms 197536 KB Output is correct
5 Correct 93 ms 197576 KB Output is correct
6 Correct 88 ms 197648 KB Output is correct
7 Correct 94 ms 197624 KB Output is correct
8 Correct 88 ms 197616 KB Output is correct
9 Correct 95 ms 197724 KB Output is correct
10 Correct 99 ms 197608 KB Output is correct
11 Correct 107 ms 200964 KB Output is correct
12 Correct 103 ms 200832 KB Output is correct
13 Correct 114 ms 200852 KB Output is correct
14 Correct 105 ms 200924 KB Output is correct
15 Correct 106 ms 200856 KB Output is correct
16 Correct 104 ms 200884 KB Output is correct
17 Correct 101 ms 200888 KB Output is correct
18 Correct 105 ms 200908 KB Output is correct
19 Correct 105 ms 200912 KB Output is correct
20 Correct 104 ms 200896 KB Output is correct
21 Correct 101 ms 200896 KB Output is correct
22 Correct 105 ms 200948 KB Output is correct
23 Correct 122 ms 201148 KB Output is correct
24 Correct 107 ms 200804 KB Output is correct
25 Correct 112 ms 200836 KB Output is correct
26 Correct 107 ms 200848 KB Output is correct
27 Correct 106 ms 200824 KB Output is correct
28 Correct 102 ms 200816 KB Output is correct
29 Correct 104 ms 200780 KB Output is correct
30 Correct 107 ms 200864 KB Output is correct
31 Runtime error 2559 ms 524288 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -