oj.uz

답안 #365782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365782 2021-02-12T11:01:02 Z negar_a 수도 (JOI20_capital_city) C++14
0 / 100
 1850 ms 38232 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second

const int maxn = 2e5 + 5;
vector <int> adj[maxn], vec[maxn];
int sz[maxn], par[maxn], c[maxn];
int ans = INT_MAX;
bool cent[maxn], mark[maxn], com[maxn], visit[maxn];

void dfs(int v, bool f, int p = -1){
	sz[v] = 1;
	com[v] = f;
	for(int u : adj[v]){
		if(!cent[u] && u != p){
			dfs(u, f, v);
			sz[v] += sz[u];
		}
	}
}
int find_centroid(int v, int s, int p = -1){
	for(int u : adj[v]){
		if(!cent[u] && u != p && sz[u] > s / 2){
			return find_centroid(u, s, v);
		}
	}
	return v;
}
void dfs2(int v, int p = -1){
	for(int u : adj[v]){
		if(!cent[u] && u != p){
			par[u] = v;
			dfs2(u, v);
		}
	}
}

void solve(int v){
	dfs(v, 1);
	int cn = find_centroid(v, sz[v]);
//	cout << "cen : " << cn << endl; 
	
	par[cn] = -1;
	dfs2(cn);
	
	queue <int> q;
	vector <int> vc;
	
	q.push(c[cn]);
	bool flag = true; 
	mark[c[cn]] = true;
	while(q.size() && flag){
		int x = q.front();
		q.pop();
		vc.pb(x);
		if(visit[x])
			flag = false;
		for(int u : vec[x]){
			if(par[u] != -1 && !mark[c[par[u]]]){
				q.push(c[par[u]]);
				mark[c[par[u]]] = true;
			}
		}
	}
	visit[c[cn]] = true;
	if(flag){
		ans = min(ans, (int)vc.size() - 1);
	}
		
	//clear
	for(int u : vc)
		mark[u] = false;
//	dfs(v, 0);
		
	cent[cn] = true;
	for(int u : adj[cn]){
		if(!cent[u]){
			solve(u);
		}
	}
}

int main(){
	fast_io;
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n - 1; i ++){
		int x, y;
		cin >> x >> y;
		x --; y --;
		adj[x].pb(y);
		adj[y].pb(x);
	}
	for(int i = 0; i < n; i ++){
		cin >> c[i];
		vec[c[i]].pb(i);
	}
	ans = k - 1;
	solve(0);
	cout << ans;
	
	return 0;
}
/*
6 3
2 1
3 5
6 2
3 4
2 3
1 3 1 2 3 2

8 4
4 1
1 3
3 6
6 7
7 2
2 5
5 8
2 4 3 1 1 2 3 4

12 4
7 9
1 3
4 6
2 4
10 12
1 2
2 10
11 1
2 8
5 3
6 7
3 1 1 2 4 3 3 2 2 3 4 4
*/

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Incorrect 7 ms 9708 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Incorrect 7 ms 9708 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 820 ms 37768 KB Output is correct
2 Correct 241 ms 38152 KB Output is correct
3 Correct 735 ms 37384 KB Output is correct
4 Correct 251 ms 38232 KB Output is correct
5 Incorrect 1850 ms 34488 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Incorrect 7 ms 9708 KB Output isn't correct
5 Halted 0 ms 0 KB -