oj.uz

Submission #1082768

# Submission time Handle Problem Language Result Execution time Memory
1082768 2024-09-01T13:50:14 Z Evirir Capital City (JOI20_capital_city) C++17
41 / 100
 3000 ms 35992 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 tot)
{
    int p = -1;
    while (true)
    {
        bool ok = 1;
        for (const auto v : adj[u])
        {
            if (v == p || cvst[v]) continue;
            if (sub[v] * 2 > tot)
            {
                p = u;
                u = v;
                ok = 0;
                break;
            }
        }
        if (ok) 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);
    int tot = sub[u];
    u = centroid(u, tot);

    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 1 ms 348 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 344 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 1 ms 348 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 344 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 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 572 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 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 2 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 712 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 35272 KB Output is correct
2 Correct 139 ms 35784 KB Output is correct
3 Correct 282 ms 34936 KB Output is correct
4 Correct 153 ms 35936 KB Output is correct
5 Correct 274 ms 31692 KB Output is correct
6 Correct 138 ms 35700 KB Output is correct
7 Correct 268 ms 31944 KB Output is correct
8 Correct 182 ms 34764 KB Output is correct
9 Correct 305 ms 28868 KB Output is correct
10 Correct 293 ms 26564 KB Output is correct
11 Correct 309 ms 29380 KB Output is correct
12 Correct 343 ms 32216 KB Output is correct
13 Correct 283 ms 26144 KB Output is correct
14 Correct 338 ms 32360 KB Output is correct
15 Correct 333 ms 32196 KB Output is correct
16 Correct 346 ms 27076 KB Output is correct
17 Correct 310 ms 27492 KB Output is correct
18 Correct 326 ms 27848 KB Output is correct
19 Correct 305 ms 30916 KB Output is correct
20 Correct 343 ms 33068 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 1 ms 348 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 344 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 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 572 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 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 2 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 712 KB Output is correct
31 Correct 268 ms 35272 KB Output is correct
32 Correct 139 ms 35784 KB Output is correct
33 Correct 282 ms 34936 KB Output is correct
34 Correct 153 ms 35936 KB Output is correct
35 Correct 274 ms 31692 KB Output is correct
36 Correct 138 ms 35700 KB Output is correct
37 Correct 268 ms 31944 KB Output is correct
38 Correct 182 ms 34764 KB Output is correct
39 Correct 305 ms 28868 KB Output is correct
40 Correct 293 ms 26564 KB Output is correct
41 Correct 309 ms 29380 KB Output is correct
42 Correct 343 ms 32216 KB Output is correct
43 Correct 283 ms 26144 KB Output is correct
44 Correct 338 ms 32360 KB Output is correct
45 Correct 333 ms 32196 KB Output is correct
46 Correct 346 ms 27076 KB Output is correct
47 Correct 310 ms 27492 KB Output is correct
48 Correct 326 ms 27848 KB Output is correct
49 Correct 305 ms 30916 KB Output is correct
50 Correct 343 ms 33068 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 194 ms 16216 KB Output is correct
53 Correct 199 ms 16324 KB Output is correct
54 Correct 197 ms 16364 KB Output is correct
55 Correct 203 ms 16324 KB Output is correct
56 Correct 202 ms 16240 KB Output is correct
57 Correct 209 ms 16324 KB Output is correct
58 Correct 220 ms 21444 KB Output is correct
59 Correct 204 ms 21704 KB Output is correct
60 Correct 274 ms 21332 KB Output is correct
61 Correct 271 ms 20940 KB Output is correct
62 Correct 134 ms 35784 KB Output is correct
63 Correct 137 ms 35784 KB Output is correct
64 Correct 138 ms 35168 KB Output is correct
65 Correct 147 ms 35992 KB Output is correct
66 Correct 2788 ms 25796 KB Output is correct
67 Correct 2816 ms 29528 KB Output is correct
68 Correct 2955 ms 29648 KB Output is correct
69 Correct 2914 ms 29680 KB Output is correct
70 Correct 2827 ms 29572 KB Output is correct
71 Execution timed out 3037 ms 29328 KB Time limit exceeded
72 Halted 0 ms 0 KB -