oj.uz

Submission #127591

# Submission time Handle Problem Language Result Execution time Memory
127591 2019-07-09T15:52:53 Z wilwxk Mergers (JOI19_mergers) C++14
0 / 100
 133 ms 44308 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=5e5+5;
vector<int> g[MAXN];
map<int, int> mp[MAXN];
int cor[MAXN], contc[MAXN];
int n, x, raiz, respf;

bool dfs(int cur, int p) {
	mp[cur][cor[cur]]++; bool ok=1;
	for(auto viz : g[cur]) {
		if(viz==p) continue;
		if(!dfs(viz, cur)) ok=0;
		if(mp[viz].size()>mp[cur].size()) swap(mp[cur], mp[viz]);
		for(auto mit : mp[viz]) {
			mp[cur][mit.first]+=mit.second;
			if(mp[cur][mit.first]==contc[mit.first]) mp[cur].erase(mit.first);
		}
	}
	if(mp[cur][cor[cur]]==contc[cor[cur]]) mp[cur].erase(cor[cur]);
	// for(auto mit : mp[cur]) printf("%d: %d %d\n", cur, mit.first, mit.second);
	if(!mp[cur].size()&&ok) respf++, ok=0;
	return ok;
}

int main() {
	scanf("%d %d", &n, &x);
	for(int i=1; i<n; i++) {
		int a, b; scanf("%d %d", &a, &b);
		g[a].push_back(b);
		g[b].push_back(a);
	}
	for(int i=1; i<=n; i++) {
		scanf("%d", &cor[i]);
		contc[cor[i]]++;
	}
	raiz=1; for(int i=1; i<=n; i++) if(g[i].size()!=1) raiz=i;
	dfs(raiz, raiz);

	printf("%d\n", (respf+1)/2);
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &x);
  ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:30:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d %d", &a, &b);
             ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &cor[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35580 KB Output is correct
2 Incorrect 34 ms 35576 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35580 KB Output is correct
2 Incorrect 34 ms 35576 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35580 KB Output is correct
2 Incorrect 34 ms 35576 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 44308 KB Output is correct
2 Correct 119 ms 39936 KB Output is correct
3 Incorrect 46 ms 35960 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 35580 KB Output is correct
2 Incorrect 34 ms 35576 KB Output isn't correct
3 Halted 0 ms 0 KB -