# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261888 | patrikpavic2 | Mergers (JOI19_mergers) | C++17 | 109 ms | 34284 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 <cstdio>
#include <vector>
#define PB push_back
using namespace std;
const int N = 5e5 + 500;
vector < int > v[N];
vector < int > koji[N];
int A[N], kol[N], siz[N], sol, bio[N], bla, n;
void dfs(int x, int lst){
koji[x].PB(A[x]); siz[x] = 1;
for(int y : v[x]){
if(y == lst) continue;
dfs(y, x); siz[x] += siz[y];
if(koji[y].size() > koji[x].size())
swap(koji[x], koji[y]);
for(int k : koji[y])
koji[x].PB(k);
}
int ja = 0;
for(int k : koji[x])
if(!bio[k])
bio[k] = 1, ja += kol[k];
for(int k : koji[x])
bio[k] = 0;
sol += (ja == siz[x]);
}
int main(){
scanf("%d%d", &n, &bla);
for(int i = 1;i < n;i++){
int x, y; scanf("%d%d", &x, &y);
v[x].PB(y), v[y].PB(x);
}
for(int i = 1;i <= n;i++)
scanf("%d", A + i), kol[A[i]]++;
dfs(1, 1);
printf("%d\n", sol - 1);
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... |