oj.uz

Submission #767575

# Submission time Handle Problem Language Result Execution time Memory
767575 2023-06-26T21:05:10 Z raysh07 Capital City (JOI20_capital_city) C++17
1 / 100
 338 ms 37148 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n, k;
const int N = 2e5 + 69;
vector <int> adj[N], comp, upd;
int c[N], sz[N], tot[N];
bool del[N], need[N], has[N];
int cen;
int ans = INF;
int val;

void dfs(int u, int par = -1){
    sz[u] = 1;
    comp.push_back(u);
    for (int v : adj[u]){
        if (v != par && !del[v]){
            dfs(v, u);
            sz[u] += sz[v];
        }
    }
}

void dfs2(int u, int par = -1){
    has[u] |= c[u] == c[cen];
    val += c[u] == c[cen];
    
    for (int v : adj[u]){
        if (v != par && !del[v]){
            dfs2(v, u);
            has[u] |= has[v];
        }
    }
    
    if (has[u]){
        upd.push_back(c[u]);
        need[c[u]] = true;
    }
}

int find(int x){
    comp.clear();
    dfs(x);
    
    for (auto u : comp){
        int mx = 0;
        for (int v : adj[u]){
            if (!del[v] && sz[v] < sz[u]) mx = max(mx, sz[v]);
        }
        
        mx = max(mx, (int)comp.size() - 1 - sz[u]);
        if (mx <= comp.size() / 2) return u;
    }
    
    assert(false);
}

void cd(int x){
    x = find(x);
    upd.clear();
    val = 0;
    
    cen = x;
    for (auto u : comp) has[u] = false;
    dfs2(x);
    
    int cnt = 0;
    for (auto u : upd){
        if (need[u]){
            need[u] = false;
            cnt++;
        }
    }
    
    if (val == tot[c[x]])
    ans = min(ans, cnt - 1);
    del[x] = true;
    
    for (int v : adj[x]){
        if (!del[v]){
            cd(v);
        }
    }
}

void Solve() 
{
    cin >> n >> k;
    
    for (int i = 1; i < n; i++) {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    for (int i = 1; i <= n; i++) {
        cin >> c[i];
        tot[c[i]]++;
    }
    
    cd(1);
    
    cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Compilation message

capital_city.cpp: In function 'long long int find(long long int)':
capital_city.cpp:57:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if (mx <= comp.size() / 2) return u;
      |             ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5032 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5032 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Incorrect 3 ms 5164 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 36152 KB Output is correct
2 Correct 125 ms 36648 KB Output is correct
3 Correct 281 ms 35904 KB Output is correct
4 Correct 129 ms 36684 KB Output is correct
5 Correct 291 ms 33156 KB Output is correct
6 Correct 126 ms 36664 KB Output is correct
7 Correct 248 ms 33840 KB Output is correct
8 Correct 125 ms 37148 KB Output is correct
9 Incorrect 338 ms 33676 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5032 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Incorrect 3 ms 5164 KB Output isn't correct
12 Halted 0 ms 0 KB -