oj.uz

Submission #128953

# Submission time Handle Problem Language Result Execution time Memory
128953 2019-07-11T11:12:00 Z PeppaPig Mergers (JOI19_mergers) C++14
0 / 100
 137 ms 39084 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e5+5;

int n, k;
vector<int> g[N], st[N];

int par[N][20], dep[N];

void init_lca(int u, int p) {
    par[u][0] = p, dep[u] = dep[p] + 1;
    for(int i = 1; i < 20; i++) par[u][i] = par[par[u][i-1]][i-1];
    for(int v : g[u]) if(v != p) init_lca(v, u);
}

int lca(int a, int b) {
    if(dep[a] < dep[b]) swap(a, b);
    for(int i = 19; ~i; i--) if(dep[par[a][i]] >= dep[b]) a = par[a][i];
    if(a == b) return a;
    for(int i = 19; ~i; i--) if(par[a][i] != par[b][i]) a = par[a][i], b = par[b][i];
    return par[a][0];
}

int qs[N], col[N], ans;

void solve_qs(int u, int p) {
    for(int v : g[u]) if(v != p) {
        solve_qs(v, u);
        qs[u] += qs[v];
    }
}

void flood(int u, int &cnt, int c) {
    col[u] = c;
    for(int v : g[u]) {
        if((!qs[v] && par[v][0] == u) || (par[u][0] == v && !qs[u])) {
            ++cnt;
            continue;
        }
        if(!col[v]) flood(v, cnt, c);
    }
}

int main() {
    scanf("%d %d", &n, &k);
    for(int i = 1, a, b; i < n; i++) {
        scanf("%d %d", &a, &b);
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    init_lca(1, 0);
    for(int i = 1, a; i <= n; i++) {
        scanf("%d", &a);
        st[a].emplace_back(i);
    }
    for(int i = 1; i <= k; i++) for(int j = 1; j < st[i].size(); j++) {
        int l = lca(st[i][0], st[i][j]);
        ++qs[st[i][0]];
        ++qs[st[i][j]];
        --qs[l];
    }
    solve_qs(1, 0);
    for(int i = 1, ptr = 0; i <= n; i++) if(!col[i]) {
        int cnt = 0;
        flood(i, cnt, ++ptr);
        if(cnt == 1) ++ans;
    }
    printf("%d\n", (ans + 1) / 2);

    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:58:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i <= k; i++) for(int j = 1; j < st[i].size(); j++) {
                                                ~~^~~~~~~~~~~~~~
mergers.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23772 KB Output is correct
2 Incorrect 23 ms 23800 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23772 KB Output is correct
2 Incorrect 23 ms 23800 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23772 KB Output is correct
2 Incorrect 23 ms 23800 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 36964 KB Output is correct
2 Correct 137 ms 39084 KB Output is correct
3 Incorrect 26 ms 24184 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23772 KB Output is correct
2 Incorrect 23 ms 23800 KB Output isn't correct
3 Halted 0 ms 0 KB -