# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104748 | antimirage | Mergers (JOI19_mergers) | C++14 | 3080 ms | 30272 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>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 5e5 + 5;
int n, k, x, y, s[N], d[N][55], cnt[N], ans, tin[N], tout[N], timer;
vector < vector <int> > g;
vector <int> vec;
void dfs (int v, int p = 0){
tin[v] = ++timer;
d[v][ s[v] ]++;
for (auto to : g[v]){
if (to == p) continue;
dfs(to, v);
for (int j = 1; j <= k; j++)
d[v][j] += d[to][j];
}
bool fl = 1;
for (int j = 1; j <= k; j++){
if (d[v][j] > 0 && d[v][j] < cnt[j])
fl = 0;
}
if (fl && v != 1)
vec.pb( v );
tout[v] = ++timer;
}
inline bool upper (int a, int b)
{
return tin[a] <= tin[b] && tout[b] <= tout[a];
}
main(){
cin >> n >> k;
g.resize(n + 1);
for (int i = 1; i < n; i++){
scanf("%d%d", &x, &y);
g[x].pb(y);
g[y].pb(x);
}
for (int i = 1; i <= n; i++){
scanf("%d", &s[i]);
cnt[ s[i] ]++;
}
dfs(1);
for (int i = 0; i < (int)vec.size(); i++){
if ( !upper(vec.back(), vec[i]) ){
vec.pop_back();
ans++;
}
else
ans++;
}
cout << ans << endl;
}
/**
5 4
1 2
2 3
3 4
3 5
1
2
1
3
4
5 4
1 2
2 3
3 4
4 5
1
2
3
4
1
**/
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... |