oj.uz

답안 #921464

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921464 2024-02-03T22:33:39 Z lolismek 수도 (JOI20_capital_city) C++14
1 / 100
 224 ms 41720 KB 
#include <algorithm>
#include <iostream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <iomanip>
#include <cassert>

#include <random>
#include <chrono>

#include <unordered_set>
#include <unordered_map>

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using ull = unsigned long long;
using ll = long long;

//#define int __int128
//#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound

#define vt vector
#define FOR(a, b) for(int i = (a); i <= (b); i++)
#define FORr(a, b) for(int i = (a); i >= (b); i--)
#define sz(x) (int)(x).size()

#define YES cout << "YES\n"
#define NO cout << "NO\n"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}

////////////////////////////////////////////////////////////////////////////////////

const int NMAX = 2e5;

int c[NMAX + 1];
vt <int> adj[NMAX + 1];

int sz[NMAX + 1];
bool proc[NMAX + 1];

int f[NMAX + 1];

void recalc_sz(int node, int par){
    sz[node] = 1;

    for(int child : adj[node]){
        if(!proc[child] &&child != par){
            recalc_sz(child, node);
            sz[node] += sz[child];
        }
    }
}

int get_centroid(int node, int par, int lim){
    for(int child : adj[node]){
        if(!proc[child] && child != par && sz[child] > lim){
            return get_centroid(child, node, lim);
        }
    }
    return node;
}

int parent[NMAX + 1];
vt <int> inds[NMAX + 1];

void dfs(int node, int par){
    parent[node] = par;
    inds[c[node]].clear();
    for(int vec : adj[node]){
        if(!proc[vec] && vec != par){
            dfs(vec, node);
        }
    }
}

void dfs2(int node, int par){
    inds[c[node]].pb(node);
    for(int vec : adj[node]){
        if(!proc[vec] && vec != par){
            dfs2(vec, node);
        }
    }
}

int mini = 1e9;
void decomp(int node){
    recalc_sz(node, 0);
    int centroid = get_centroid(node, 0, sz[node] / 2);
    proc[centroid] = true;

    dfs(centroid, 0);
    dfs2(centroid, 0);

    queue <int> Q;
    unordered_set <int> S;
    Q.push(c[centroid]);
    S.insert(c[centroid]);

    int adds = 1;
    bool ok = 1;
    while(!Q.empty()){
        int col = Q.front();
        Q.pop();

        if(f[col] != sz(inds[col])){
            ok = 0;
        }

        for(int node : inds[col]){
            if(node != centroid && S.find(c[parent[node]]) == S.end()){
                S.insert(c[parent[node]]);
                Q.push(c[parent[node]]);
                adds++;
            }
        }
    }

    if(ok){
        mini = min(mini, adds - 1);
    }
}   

void solve(){
    int n, k;
    cin >> n >> k;

    FOR(1, n - 1){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    FOR(1, n){
        cin >> c[i];
        f[c[i]]++;
    }    

    decomp(1);

    cout << mini << endl;
}   


signed main(){

    //ios_base::sync_with_stdio(false);
    //cin.tie(0);

    int T;
    //cin >> T;
    T = 1;

    while(T--){
        solve();
    }

    return 0;
}

/*
12 4
7 9
1 3
4 6
2 4
10 12
1 2
2 10
11 1
2 8
5 3
6 7
3
1
1
2
4
3
3
2
2
3
4
4
*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12932 KB Output is correct
3 Correct 3 ms 13144 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 3 ms 12888 KB Output is correct
8 Correct 3 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12888 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12932 KB Output is correct
3 Correct 3 ms 13144 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 3 ms 12888 KB Output is correct
8 Correct 3 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12888 KB Output is correct
11 Correct 4 ms 12892 KB Output is correct
12 Correct 4 ms 12888 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 4 ms 12892 KB Output is correct
15 Incorrect 4 ms 12892 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 41292 KB Output is correct
2 Correct 204 ms 41720 KB Output is correct
3 Correct 220 ms 40784 KB Output is correct
4 Correct 158 ms 41620 KB Output is correct
5 Incorrect 224 ms 38228 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12932 KB Output is correct
3 Correct 3 ms 13144 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 3 ms 12888 KB Output is correct
8 Correct 3 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12888 KB Output is correct
11 Correct 4 ms 12892 KB Output is correct
12 Correct 4 ms 12888 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 4 ms 12892 KB Output is correct
15 Incorrect 4 ms 12892 KB Output isn't correct
16 Halted 0 ms 0 KB -