oj.uz

답안 #128975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128975 2019-07-11T11:40:22 Z PeppaPig Mergers (JOI19_mergers) C++14
0 / 100
 138 ms 42340 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 dsu[N];
 
int find(int x) { return dsu[x] = x == dsu[x] ? x : find(dsu[x]); }
 
int qs[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 p) {
    for(int v : g[u]) if(v != p) {
        if(qs[v]) dsu[find(v)] = find(u);
        flood(v, u);
    }
}
 
int deg[N];
vector<pair<int, int> > E;
 
int main() {
    iota(dsu, dsu+N, 0);
    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);
        E.emplace_back(a, b);
    }
    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][j-1], st[i][j]);
        ++qs[st[i][j-1]];
        ++qs[st[i][j]];
        --qs[l];
    }
    solve_qs(1, 0), flood(1, 0);
    for(pair<int, int> p : E) {
        int a = find(p.first), b = find(p.second);
        if(a != b) ++deg[a], ++deg[b];
    }
    for(int i = 1; i <= n; i++) if(dsu[i] == i && deg[i] == 1) ++ans;
    printf("%d\n", (ans + 1) / 2);
 
    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:63: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:51: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:53: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:60: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

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 25720 KB Output is correct
2 Incorrect 25 ms 25720 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 25720 KB Output is correct
2 Incorrect 25 ms 25720 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 25720 KB Output is correct
2 Incorrect 25 ms 25720 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 39784 KB Output is correct
2 Correct 136 ms 42340 KB Output is correct
3 Incorrect 28 ms 26308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 25720 KB Output is correct
2 Incorrect 25 ms 25720 KB Output isn't correct
3 Halted 0 ms 0 KB -