# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332900 | ly20 | Mergers (JOI19_mergers) | C++17 | 45 ms | 37356 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;
const int MAXN = 3123;
int marc[MAXN], tp[MAXN], sub[MAXN][MAXN];
int n, k;
vector <int> grafo[MAXN];
int vl[MAXN];
int resp = 0;
void dfs1(int v, int p) {
for(int i = 0; i < grafo[v].size(); i++) {
int viz = grafo[v][i];
if(viz == p) continue;
dfs1(viz, v);
for(int j = 1; j <= k; j++) {
sub[v][j] += sub[viz][j];
}
vl[v] += vl[viz];
}
bool ok = true;
for(int i = 1; i <= k; i++) {
if(sub[v][i] != marc[i] && sub[v][i] != 0) ok = false;
}
if(ok) vl[v]++;
if(p == v) return;
if(ok && vl[v] == 1) resp++;
}
int main() {
scanf("%d %d", &n, &k);
for(int i = 0; i < n - 1; i++) {
int a, b;
scanf("%d %d", &a, &b);
grafo[a].push_back(b); grafo[b].push_back(a);
}
for(int i = 1 ; i<= n; i++) {
int a;
scanf("%d", &a);
marc[a]++; tp[i] = a; sub[i][a]++;
}
if(n == 2) {
if(tp[1] == tp[2]) printf("0\n");
else printf("1\n");
return 0;
}
int prox = 1;
for(int i = 1; i <= n; i++) if(grafo[i].size() > 1) prox = i;
dfs1(prox, prox);
printf("%d\n", (resp + 1) / 2);
return 0;
}
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... |