oj.uz

Submission #1082772

# Submission time Handle Problem Language Result Execution time Memory
1082772 2024-09-01T14:01:38 Z Evirir Capital City (JOI20_capital_city) C++17
41 / 100
 3000 ms 32772 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[u]) continue;
        dfs(v, u);
    }
}

int ans = 1e9;

void solve(int u)
{
    dfs_sz(u, -1);
    u = centroid(u, -1, u);

    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);

    // clean up
    for (const auto x : s)
    {
        scnt[x] = 0;
        prt[x].clear();
        need[x] = 0;
    }
    s.clear();
    needv.clear();

    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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 636 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 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 286 ms 32204 KB Output is correct
2 Correct 133 ms 32772 KB Output is correct
3 Correct 257 ms 31952 KB Output is correct
4 Correct 140 ms 32712 KB Output is correct
5 Correct 249 ms 29500 KB Output is correct
6 Correct 127 ms 32712 KB Output is correct
7 Correct 244 ms 29384 KB Output is correct
8 Correct 133 ms 31688 KB Output is correct
9 Correct 280 ms 26672 KB Output is correct
10 Correct 295 ms 24776 KB Output is correct
11 Correct 299 ms 27080 KB Output is correct
12 Correct 311 ms 29128 KB Output is correct
13 Correct 308 ms 24516 KB Output is correct
14 Correct 300 ms 29636 KB Output is correct
15 Correct 302 ms 29124 KB Output is correct
16 Correct 303 ms 25028 KB Output is correct
17 Correct 308 ms 25696 KB Output is correct
18 Correct 287 ms 25800 KB Output is correct
19 Correct 292 ms 28412 KB Output is correct
20 Correct 278 ms 29892 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 636 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 286 ms 32204 KB Output is correct
32 Correct 133 ms 32772 KB Output is correct
33 Correct 257 ms 31952 KB Output is correct
34 Correct 140 ms 32712 KB Output is correct
35 Correct 249 ms 29500 KB Output is correct
36 Correct 127 ms 32712 KB Output is correct
37 Correct 244 ms 29384 KB Output is correct
38 Correct 133 ms 31688 KB Output is correct
39 Correct 280 ms 26672 KB Output is correct
40 Correct 295 ms 24776 KB Output is correct
41 Correct 299 ms 27080 KB Output is correct
42 Correct 311 ms 29128 KB Output is correct
43 Correct 308 ms 24516 KB Output is correct
44 Correct 300 ms 29636 KB Output is correct
45 Correct 302 ms 29124 KB Output is correct
46 Correct 303 ms 25028 KB Output is correct
47 Correct 308 ms 25696 KB Output is correct
48 Correct 287 ms 25800 KB Output is correct
49 Correct 292 ms 28412 KB Output is correct
50 Correct 278 ms 29892 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 192 ms 16836 KB Output is correct
53 Correct 203 ms 16380 KB Output is correct
54 Correct 192 ms 16324 KB Output is correct
55 Correct 212 ms 16328 KB Output is correct
56 Correct 215 ms 16328 KB Output is correct
57 Correct 210 ms 16368 KB Output is correct
58 Correct 192 ms 20860 KB Output is correct
59 Correct 195 ms 21112 KB Output is correct
60 Correct 230 ms 20840 KB Output is correct
61 Correct 274 ms 20808 KB Output is correct
62 Correct 130 ms 32712 KB Output is correct
63 Correct 136 ms 32648 KB Output is correct
64 Correct 129 ms 31888 KB Output is correct
65 Correct 143 ms 32716 KB Output is correct
66 Execution timed out 3056 ms 24264 KB Time limit exceeded
67 Halted 0 ms 0 KB -