# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104749 | Hideo | Mergers (JOI19_mergers) | C++14 | 158 ms | 46212 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;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define vl vector < ll >
#define pi pair < int, int >
#define pii pair < int, pi >
#define vii vector < pi >
const int N = 1e5 + 7;
const int mod = 1e9 + 7;
int us[N][100], a[N], m[N], cur[N];
int n, k, ans;
vi g[N];
void dfs (int v = 1, int p = 0){
for (int to : g[v]){
if (to != p){
dfs(to, v);
cur[v] += cur[to];
for (int i = 1; i <= 50; i++)
us[v][i] += us[to][i];
}
}
us[v][a[v]]++;
if (us[v][a[v]] == 1)
cur[v]--;
if (us[v][a[v]] == m[a[v]]){
cur[v]++;
us[v][a[v]] = 0;
}
if (cur[v] == 0)
ans++;
}
main(){
cin >> n >> k;
for (int i = 1; i < n; i++){
int a, b;
scanf("%d%d", &a, &b);
g[a].pb(b);
g[b].pb(a);
}
for (int i = 1; i <= n; i++){
scanf("%d", &a[i]);
m[a[i]]++;
}
dfs();
printf("%d", ans / 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... |