#include <bits/stdc++.h>
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 53;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
int n, k, a, b, c[N], d[N], cnt[N], par[N], ans = inf, Sz;
bool was[N], ok, used[N], us[N], was1[N];
vi g[N], gg[N], cur;
queue < int > q;
void dfs (int v, int p = 0) {
cur.pb(v);
cnt[v] = 1;
for (auto to : g[v])
if (to != p && !was[to]) {
dfs(to, v);
cnt[v] += cnt[to];
}
}
int Find (int v) {
for (auto to : g[v])
if (!was[to] && cnt[to] < cnt[v] && Sz - cnt[to] < cnt[to])
return Find(to);
return v;
}
void dfs1 (int v, int p = 0) {
if (d[c[v]] != sz(gg[c[v]])) {
ok = 0;
return;
}
par[v] = p;
for (auto to : g[v])
if (!was[to] && to != p)
dfs1(to, v);
}
void dfs2 (int v) {
was1[v] = 1;
for (auto to : g[v])
if (!was[to] && !was1[to])
dfs2(to);
}
void Centroid (int v) {
cur.clear();
ok = 1;
dfs(v);
for (auto i : cur) {
used[i] = us[c[i]] = 0;
was1[i] = 0;
gg[c[i]].clear();
}
for (auto i : cur)
gg[c[i]].pb(i);
Sz = cnt[v];
v = Find(v);
dfs1(v);
if (!ok) {
for (auto i : cur)
was[i] = 1;
return;
}
q.push(c[v]);
used[v] = 1;
us[c[v]] = 1;
int res = 0;
while (sz(q)) {
++res;
int C = q.front();
q.pop();
for (auto v : gg[C]) {
while (!used[v]) {
used[v] = 1;
if (!us[c[v]]) {
us[c[v]] = 1;
q.push(c[v]);
}
v = par[v];
}
}
}
ans = min(ans, res - 1);
for (auto i : g[c[v]])
was[i] = 1;
vi roots;
for (auto i : cur)
if (!was[i] && !was1[i]) {
dfs2(i);
roots.pb(i);
}
for (auto i : roots)
Centroid(i);
}
main () {
scanf("%d%d", &n, &k);
for (int i = 1; i < n; ++i) {
scanf("%d%d", &a, &b);
g[a].pb(b);
g[b].pb(a);
}
for (int i = 1; i <= n; ++i) {
scanf("%d", &c[i]);
++d[c[i]];
}
Centroid(1);
cout << ans << endl;
}
Compilation message
capital_city.cpp:151:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main () {
^
capital_city.cpp: In function 'int main()':
capital_city.cpp:152:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
~~~~~^~~~~~~~~~~~~~~~
capital_city.cpp:154:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &a, &b);
~~~~~^~~~~~~~~~~~~~~~
capital_city.cpp:160:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &c[i]);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9728 KB |
Output is correct |
| 2 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 3 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 4 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 5 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 6 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 7 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 8 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 9 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 10 |
Runtime error |
598 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9728 KB |
Output is correct |
| 2 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 3 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 4 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 5 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 6 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 7 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 8 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 9 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 10 |
Runtime error |
598 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
273 ms |
35412 KB |
Output is correct |
| 2 |
Correct |
150 ms |
35856 KB |
Output is correct |
| 3 |
Correct |
305 ms |
35176 KB |
Output is correct |
| 4 |
Correct |
154 ms |
35820 KB |
Output is correct |
| 5 |
Incorrect |
283 ms |
32744 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9728 KB |
Output is correct |
| 2 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 3 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 4 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 5 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 6 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 7 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 8 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 9 |
Correct |
9 ms |
9728 KB |
Output is correct |
| 10 |
Runtime error |
598 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
