| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 379750 |
2021-03-19T08:33:35 Z |
cgiosy |
Mergers (JOI19_mergers) |
C++17 |
|
57 ms |
7396 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int N, M, ans=0, t=0;
cin>>N>>M;
vector<int> C(N), L(M), R(M);
vector<vector<int>> G(N);
for(int i=1; i<N; i++) {
int x, y;
cin>>x>>y; --x, --y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=0; i<N; i++) cin>>C[i], --C[i];
function<void(int, int)> f=[&](int i, int p) {
++t;
L[C[i]]=L[C[i]]?:t;
for(int j:G[i]) if(j!=p) f(j, i);
R[C[i]]=t;
};
f(0, 0);
t=0;
function<pair<int, int>(int, int)> g=[&](int i, int p) {
++t;
int a=L[C[i]], b=R[C[i]], s=t;
for(int j:G[i]) if(j!=p) {
auto[c,d]=g(j, i);
a=min(a, c);
b=max(b, d);
}
if(s<=a && b<=t) ans++;
return make_pair(a, b);
};
g(0, 0);
cout<<ans/2<<'\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
6628 KB |
Output is correct |
| 2 |
Correct |
57 ms |
7396 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
524 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
