oj.uz

Submission #120616

# Submission time Handle Problem Language Result Execution time Memory
120616 2019-06-25T05:38:48 Z 임유진(#2961) Mergers (JOI19_mergers) C++14
0 / 100
 187 ms 55888 KB 
#include<stdio.h>
#include<queue>
#include<vector>
#include<algorithm>

using namespace std;

#define MAXN 500005

int A[MAXN], B[MAXN], S[MAXN];
vector<int> e[MAXN];
int par[20][MAXN], dep[MAXN];
vector<int> ss[MAXN];
bool chkn[MAXN], chks[MAXN];
queue<int> q;
int gs[MAXN];
vector<int> ge[MAXN];

void dfs(int x){
	for(auto a:e[x]) if(a!=par[0][x]){
		par[0][a]=x;
		dep[a]=dep[x]+1;
		dfs(a);
	}
}

int anc(int x, int d){
	if(d>dep[x]) return 0;
	for(int i=19; i>=0; i--) if((dep[x]-d)&(1<<i)) x=par[i][x];
	return x;
}

int lca(int x, int y){
	if(dep[x]>dep[y]) x=anc(x, dep[y]);
	else y=anc(y, dep[x]);
	if(x==y) return x;
	for(int i=19; i>=0; i--) if(par[i][x]!=par[i][y]){
		x=par[i][x];
		y=par[i][y];
	}
	return par[0][x];
}

int main(){
	int N, K;
	int ans=0;

	scanf("%d%d", &N, &K);
	for(int i=0; i<N-1; i++) scanf("%d%d", A+i, B+i);
	for(int i=1; i<=N; i++) scanf("%d", S+i);

	for(int i=0; i<N-1; i++){
		e[A[i]].push_back(B[i]);
		e[B[i]].push_back(A[i]);
	}
	par[0][1]=1;
	dfs(1);
	for(int i=1; i<20; i++) for(int j=1; j<=N; j++) par[i][j]=par[i-1][par[i-1][j]];
	//for(int i=1; i<=N; i++) printf("%d %d %d\n", par[0][i], par[1][i], par[2][i]);
	for(int i=1; i<=N; i++) ss[S[i]].push_back(i);
	//for(int i=1; i<=K; i++) printf("%d\n", ss[i].size());
	
	for(int i=1; i<=K; i++) if(!chks[i]){
		chks[i]=true;
		q.push(i);
		//printf("[%d]\n", i);
		while(!q.empty()){
			int t=q.front();
			q.pop();
			gs[t]=i;
			int l=ss[t][0];
			for(auto a:ss[t]) l=lca(l, a);
			//printf("lca=%d\n", l);
			for(auto a:ss[t]){
				chkn[a]=true;
				for(int j=a; j!=l&&!chkn[par[0][j]]; j=par[0][j]){
					chkn[par[0][j]]=true;
					if(!chks[S[par[0][j]]]){
						chks[S[par[0][j]]]=true;
						q.push(S[par[0][j]]);
					}
				}
			}
		}
	}

	//for(int i=1; i<=K; i++) printf("%d ", gs[i]);

	for(int i=0; i<N-1; i++) if(gs[S[A[i]]]!=gs[S[B[i]]]){
		ge[S[A[i]]].push_back(S[B[i]]);
		ge[S[B[i]]].push_back(S[A[i]]);
	}
	for(int i=1; i<=K; i++){
		unique(ge[i].begin(), ge[i].end());
		if(ge[i].size()==1) ans++;
	}

	printf("%d", (ans+1)/2);
	return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &K);
  ~~~~~^~~~~~~~~~~~~~~~
mergers.cpp:49:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0; i<N-1; i++) scanf("%d%d", A+i, B+i);
                           ~~~~~^~~~~~~~~~~~~~~~~~
mergers.cpp:50:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d", S+i);
                          ~~~~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35704 KB Output is correct
2 Correct 33 ms 35712 KB Output is correct
3 Correct 32 ms 35704 KB Output is correct
4 Correct 32 ms 35712 KB Output is correct
5 Correct 31 ms 35712 KB Output is correct
6 Correct 32 ms 35832 KB Output is correct
7 Correct 32 ms 35704 KB Output is correct
8 Correct 32 ms 35836 KB Output is correct
9 Correct 31 ms 35704 KB Output is correct
10 Correct 34 ms 35812 KB Output is correct
11 Correct 32 ms 35704 KB Output is correct
12 Correct 32 ms 35708 KB Output is correct
13 Correct 32 ms 35704 KB Output is correct
14 Correct 32 ms 35840 KB Output is correct
15 Correct 32 ms 35704 KB Output is correct
16 Correct 34 ms 35704 KB Output is correct
17 Correct 32 ms 35676 KB Output is correct
18 Correct 33 ms 35832 KB Output is correct
19 Correct 33 ms 35792 KB Output is correct
20 Correct 35 ms 35712 KB Output is correct
21 Correct 35 ms 35736 KB Output is correct
22 Correct 34 ms 35704 KB Output is correct
23 Incorrect 32 ms 35704 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35704 KB Output is correct
2 Correct 33 ms 35712 KB Output is correct
3 Correct 32 ms 35704 KB Output is correct
4 Correct 32 ms 35712 KB Output is correct
5 Correct 31 ms 35712 KB Output is correct
6 Correct 32 ms 35832 KB Output is correct
7 Correct 32 ms 35704 KB Output is correct
8 Correct 32 ms 35836 KB Output is correct
9 Correct 31 ms 35704 KB Output is correct
10 Correct 34 ms 35812 KB Output is correct
11 Correct 32 ms 35704 KB Output is correct
12 Correct 32 ms 35708 KB Output is correct
13 Correct 32 ms 35704 KB Output is correct
14 Correct 32 ms 35840 KB Output is correct
15 Correct 32 ms 35704 KB Output is correct
16 Correct 34 ms 35704 KB Output is correct
17 Correct 32 ms 35676 KB Output is correct
18 Correct 33 ms 35832 KB Output is correct
19 Correct 33 ms 35792 KB Output is correct
20 Correct 35 ms 35712 KB Output is correct
21 Correct 35 ms 35736 KB Output is correct
22 Correct 34 ms 35704 KB Output is correct
23 Incorrect 32 ms 35704 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35704 KB Output is correct
2 Correct 33 ms 35712 KB Output is correct
3 Correct 32 ms 35704 KB Output is correct
4 Correct 32 ms 35712 KB Output is correct
5 Correct 31 ms 35712 KB Output is correct
6 Correct 32 ms 35832 KB Output is correct
7 Correct 32 ms 35704 KB Output is correct
8 Correct 32 ms 35836 KB Output is correct
9 Correct 31 ms 35704 KB Output is correct
10 Correct 34 ms 35812 KB Output is correct
11 Correct 32 ms 35704 KB Output is correct
12 Correct 32 ms 35708 KB Output is correct
13 Correct 32 ms 35704 KB Output is correct
14 Correct 32 ms 35840 KB Output is correct
15 Correct 32 ms 35704 KB Output is correct
16 Correct 34 ms 35704 KB Output is correct
17 Correct 32 ms 35676 KB Output is correct
18 Correct 33 ms 35832 KB Output is correct
19 Correct 33 ms 35792 KB Output is correct
20 Correct 35 ms 35712 KB Output is correct
21 Correct 35 ms 35736 KB Output is correct
22 Correct 34 ms 35704 KB Output is correct
23 Incorrect 32 ms 35704 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 50256 KB Output is correct
2 Correct 150 ms 55888 KB Output is correct
3 Correct 37 ms 36224 KB Output is correct
4 Correct 37 ms 36216 KB Output is correct
5 Correct 35 ms 35704 KB Output is correct
6 Correct 37 ms 35712 KB Output is correct
7 Correct 38 ms 36216 KB Output is correct
8 Incorrect 187 ms 53240 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35704 KB Output is correct
2 Correct 33 ms 35712 KB Output is correct
3 Correct 32 ms 35704 KB Output is correct
4 Correct 32 ms 35712 KB Output is correct
5 Correct 31 ms 35712 KB Output is correct
6 Correct 32 ms 35832 KB Output is correct
7 Correct 32 ms 35704 KB Output is correct
8 Correct 32 ms 35836 KB Output is correct
9 Correct 31 ms 35704 KB Output is correct
10 Correct 34 ms 35812 KB Output is correct
11 Correct 32 ms 35704 KB Output is correct
12 Correct 32 ms 35708 KB Output is correct
13 Correct 32 ms 35704 KB Output is correct
14 Correct 32 ms 35840 KB Output is correct
15 Correct 32 ms 35704 KB Output is correct
16 Correct 34 ms 35704 KB Output is correct
17 Correct 32 ms 35676 KB Output is correct
18 Correct 33 ms 35832 KB Output is correct
19 Correct 33 ms 35792 KB Output is correct
20 Correct 35 ms 35712 KB Output is correct
21 Correct 35 ms 35736 KB Output is correct
22 Correct 34 ms 35704 KB Output is correct
23 Incorrect 32 ms 35704 KB Output isn't correct
24 Halted 0 ms 0 KB -