# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127183 | wilwxk | Mergers (JOI19_mergers) | C++14 | 154 ms | 44192 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=5e5+5;
vector<int> g[MAXN];
map<int, int> mp[MAXN];
int cor[MAXN], contc[MAXN];
int n, x, 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]]++;
}
dfs(1, 1);
printf("%d\n", (respf+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... |