# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106075 | mzhao | Mergers (JOI19_mergers) | C++11 | 31 ms | 24132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define D(x...) printf(x)
#else
#define D(x...)
#endif
#define MN 500100
int N, K, S[MN];
vector<int> adj[MN];
int tot[MN], cnt[MN], ans;
void dfs(int n, int p) {
int cur[8];
for (int i = 1; i <= K; i++) cur[i] = cnt[i];
cnt[S[n]]++;
for (int i : adj[n]) if (i != p) dfs(i, n);
for (int i = 1; i <= K; i++) cur[i] = cnt[i]-cur[i];
D("node %d = ", n);
for (int i = 1; i <= K; i++) D("%d ", cur[i]);
D("\n");
if (n == 1) return;
bool f = 1;
for (int i = 1; i <= K; i++) if (cur[i] && cur[i] != tot[i]) {
f = 0;
break;
}
ans += f;
}
int main() {
scanf("%d%d", &N, &K);
assert(N <= 100);
for (int i = 1, A, B; i < N; i++) {
scanf("%d%d", &A, &B);
adj[A].push_back(B);
adj[B].push_back(A);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &S[i]);
tot[S[i]]++;
}
dfs(1, 0);
printf("%d\n", (ans+1)/2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |