oj.uz

Submission #1083463

# Submission time Handle Problem Language Result Execution time Memory
1083463 2024-09-03T08:46:52 Z hahahaha Capital City (JOI20_capital_city) C++14
100 / 100
 384 ms 36456 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")
#define setp(x) cout<<fixed<<setprecision(x)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
//template<typename T>
//using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
template<typename T> void amax(T &a, T b){ a=max(a,b); }
template<typename T> void amin(T &a, T b){ a=min(a,b); }
struct Hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
 
const ll INF = ll(1e18);
const int MOD = 998244353;
const bool DEBUG = 0;
const int MAXN = 100005;
const int LG = 21;
 
int n,K;
vector<vector<int>> adj;
vector<int> c, sub, cnt;
vector<bool> cvst;
 
void dfs_sz(int u, int p)
{
    sub[u] = 1;
    for (const auto v : adj[u])
    {
        if (v == p || cvst[v]) continue;
        dfs_sz(v, u);
        sub[u] += sub[v];
    }
}
 
int centroid(int u, int p, int r)
{
    for (int v : adj[u])
    {
        if (v == p || cvst[v]) continue;
        if (sub[v] * 2 > sub[r]) return centroid(v, u, r);
    }
    return u;
}
 
vector<int> s;
vector<int> scnt;
vector<bool> need;
vector<int> needv;
vector<vector<int>> prt;
 
void dfs(int u, int p)
{
    s.pb(c[u]);
    scnt[c[u]]++;
    if (p != -1) prt[c[u]].pb(c[p]);
    for (const auto v : adj[u])
    {
        if (v == p || cvst[v]) continue;
        dfs(v, u);
    }
}
 
int ans = 1e9;
 
void solve(int u)
{
    dfs_sz(u, -1);
    u = centroid(u, -1, u);
 
    for (const auto x : s)
    {
        scnt[x] = 0;
        prt[x].clear();
        need[x] = 0;
    }
    s.clear();
    needv.clear();
 
    dfs(u, -1);
    queue<int> q;
    q.push(c[u]);
    needv.pb(c[u]);
    need[c[u]] = 1;
    while (!q.empty())
    {
        int curc = q.front(); q.pop();
        for (const auto x : prt[curc])
        {
            if (need[x]) continue;
            need[x] = 1;
            needv.pb(x);
            q.push(x);
        }
    }
    bool ok = 1;
    for (const auto x : needv)
    {
        if (cnt[x] != scnt[x])
        {
            ok = 0;
            break;
        }
    }
    if (ok) amin(ans, sz(needv) - 1);
 
    cvst[u] = 1;
    for (const auto v : adj[u])
    {
        if (cvst[v]) continue;
        solve(v);
    }
}
 
void init()
{
    adj.resize(n);
    c.resize(n);
    cvst.resize(n);
    sub.resize(n);
    cnt.resize(K);
    scnt.resize(K);
    prt.resize(K);
    need.resize(K);
}
 
int main()
{
    cin.tie(0)->sync_with_stdio(0);
 
    cin>>n>>K;
    init();
 
    forn(i,0,n-1)
    {
        int u,v; cin>>u>>v; u--; v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    forn(i,0,n)
    {
        cin>>c[i];
        c[i]--;
        cnt[c[i]]++;
    }
 
    solve(0);
    cout << ans << '\n';
 
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 744 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 604 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 36056 KB Output is correct
2 Correct 128 ms 36360 KB Output is correct
3 Correct 309 ms 35788 KB Output is correct
4 Correct 137 ms 36352 KB Output is correct
5 Correct 275 ms 32968 KB Output is correct
6 Correct 169 ms 36184 KB Output is correct
7 Correct 297 ms 33104 KB Output is correct
8 Correct 174 ms 35444 KB Output is correct
9 Correct 345 ms 30388 KB Output is correct
10 Correct 313 ms 28332 KB Output is correct
11 Correct 340 ms 30820 KB Output is correct
12 Correct 321 ms 32796 KB Output is correct
13 Correct 356 ms 28104 KB Output is correct
14 Correct 302 ms 33072 KB Output is correct
15 Correct 341 ms 32940 KB Output is correct
16 Correct 346 ms 28872 KB Output is correct
17 Correct 341 ms 29392 KB Output is correct
18 Correct 384 ms 29508 KB Output is correct
19 Correct 359 ms 32052 KB Output is correct
20 Correct 380 ms 33684 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #4
59.0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 744 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 273 ms 36056 KB Output is correct
32 Correct 128 ms 36360 KB Output is correct
33 Correct 309 ms 35788 KB Output is correct
34 Correct 137 ms 36352 KB Output is correct
35 Correct 275 ms 32968 KB Output is correct
36 Correct 169 ms 36184 KB Output is correct
37 Correct 297 ms 33104 KB Output is correct
38 Correct 174 ms 35444 KB Output is correct
39 Correct 345 ms 30388 KB Output is correct
40 Correct 313 ms 28332 KB Output is correct
41 Correct 340 ms 30820 KB Output is correct
42 Correct 321 ms 32796 KB Output is correct
43 Correct 356 ms 28104 KB Output is correct
44 Correct 302 ms 33072 KB Output is correct
45 Correct 341 ms 32940 KB Output is correct
46 Correct 346 ms 28872 KB Output is correct
47 Correct 341 ms 29392 KB Output is correct
48 Correct 384 ms 29508 KB Output is correct
49 Correct 359 ms 32052 KB Output is correct
50 Correct 380 ms 33684 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 229 ms 19652 KB Output is correct
53 Correct 253 ms 19844 KB Output is correct
54 Correct 238 ms 19756 KB Output is correct
55 Correct 233 ms 19704 KB Output is correct
56 Correct 236 ms 19724 KB Output is correct
57 Correct 244 ms 19652 KB Output is correct
58 Correct 231 ms 24520 KB Output is correct
59 Correct 212 ms 24776 KB Output is correct
60 Correct 325 ms 24732 KB Output is correct
61 Correct 367 ms 24268 KB Output is correct
62 Correct 160 ms 36456 KB Output is correct
63 Correct 145 ms 36296 KB Output is correct
64 Correct 135 ms 35532 KB Output is correct
65 Correct 134 ms 36312 KB Output is correct
66 Correct 192 ms 27896 KB Output is correct
67 Correct 191 ms 27844 KB Output is correct
68 Correct 166 ms 28012 KB Output is correct
69 Correct 170 ms 27848 KB Output is correct
70 Correct 190 ms 27892 KB Output is correct
71 Correct 158 ms 27772 KB Output is correct
72 Correct 168 ms 27964 KB Output is correct
73 Correct 168 ms 27332 KB Output is correct
74 Correct 161 ms 27848 KB Output is correct
75 Correct 170 ms 27848 KB Output is correct
76 Correct 255 ms 28344 KB Output is correct
77 Correct 251 ms 26824 KB Output is correct
78 Correct 325 ms 29124 KB Output is correct
79 Correct 329 ms 27588 KB Output is correct
80 Correct 329 ms 33220 KB Output is correct
81 Correct 347 ms 30528 KB Output is correct
82 Correct 328 ms 30664 KB Output is correct
83 Correct 363 ms 27844 KB Output is correct
84 Correct 327 ms 32620 KB Output is correct
85 Correct 337 ms 31256 KB Output is correct
86 Correct 322 ms 27592 KB Output is correct
87 Correct 307 ms 28868 KB Output is correct
88 Correct 341 ms 29892 KB Output is correct
89 Correct 268 ms 26580 KB Output is correct
90 Correct 273 ms 26440 KB Output is correct
91 Correct 305 ms 28300 KB Output is correct
92 Correct 284 ms 27336 KB Output is correct
93 Correct 281 ms 27076 KB Output is correct
94 Correct 309 ms 26564 KB Output is correct
95 Correct 293 ms 27892 KB Output is correct
96 Correct 295 ms 26600 KB Output is correct
97 Correct 258 ms 28360 KB Output is correct