oj.uz

답안 #796658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796658 2023-07-28T15:23:53 Z rnl42 Mergers (JOI19_mergers) C++14
70 / 100
 276 ms 124976 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cassert>
using namespace std;

const int MAXN = 5e5;

int N, K;
int dist[MAXN];
vector<int> adj[MAXN];
int group_of[MAXN];
vector<int> members[MAXN];
struct lcatreeitem {
    int i;
    lcatreeitem& operator=(int other) {
        i = other;
        return *this;
    }
    operator int() const {
        return i;
    }
    bool operator<(const lcatreeitem& other) const {
        if (i == -1) return false;
        else if (other.i == -1) return true;
        return dist[i] < dist[other.i];
    }
} lcatree[1<<20];
int first[MAXN];
int lcatree_i = 0;
const int lcatree_shift = 1<<19;
int mergeuntil[MAXN];
bool penible[MAXN];

int uf[MAXN];

int root(int u) {
    return uf[u] == u ? u : uf[u] = root(uf[u]);
}
void merge(int u, int v) {
    if (dist[u] > dist[v]) {
        swap(u, v);
    }
    uf[root(v)] = root(u);
}

void dfs(int u) {
    first[u] = lcatree_i;
    lcatree[lcatree_shift+lcatree_i++] = u;
    for (int v : adj[u]) {
        adj[v].erase(find(adj[v].begin(), adj[v].end(), u));
        dist[v] = dist[u]+1;
        dfs(v);
        lcatree[lcatree_shift+lcatree_i++] = u;
    }
}

int dfs2(int u) {
    int ret = mergeuntil[u];
    for (int v : adj[u]) {
        int r = dfs2(v);
        if (dist[r] < dist[ret]) ret = r;
        if (r != v) {
            merge(v, u);
        }
    }
    return ret;
}

int lca(int u, int v) {
    if (first[u] > first[v]) swap(u, v);
    int l = lcatree_shift+first[u], r = lcatree_shift+first[v]+1;
    lcatreeitem ret;
    ret = -1;
    for (; l < r; l >>= 1, r >>= 1) {
        if (l&1) {
            ret = min(ret, lcatree[l++]);
        }
        if (r&1) {
            ret = min(ret, lcatree[--r]);
        }
    }
    return ret;
}

int dfs3(int u) {
    int ret = 0;
    for (int v : adj[u]) {
        ret += dfs3(v);
    }
    ret = max(ret, (int)penible[u]);
    return ret;
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> N >> K;
    iota(mergeuntil, mergeuntil+N, 0);
    iota(uf, uf+N, 0);
    int u, v;
    for (int i = 0; i < N-1; i++) {
        cin >> u >> v, u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 0; i < N; i++) {
        cin >> group_of[i], group_of[i]--;
        members[group_of[i]].push_back(i);
    }
    dfs(0);
    for (int i = lcatree_shift-1; i > 0; i--) {
        lcatree[i] = min(lcatree[2*i], lcatree[2*i+1]);
    }
    for (int g = 0; g < K; g++) {
        int a = members[g][0];
        for (auto m : members[g]) {
            a = lca(a, m);
        }
        for (auto m : members[g]) {
            mergeuntil[m] = a;
        }
    }
    dfs2(0);
    assert(N < 5e5);
    bool plus1 = false;
    int lcapenible = -1;
    for (int i = 1; i < N; i++) {
        if (root(i) == i) {
            if (lcapenible == -1) lcapenible = i;
            else lcapenible = lca(lcapenible, i);
            penible[i] = true;
        }
    }
    for (int i = 1; i < N; i++) {
        if (penible[i]) {
            if (lca(lcapenible, i) == i) {
                plus1 = true;
                break;
            }
        }
    }
    int ans = dfs3(0)+plus1;
    cout << ((ans+1)>>1) << '\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 13 ms 25800 KB Output is correct
3 Correct 14 ms 25916 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 13 ms 25816 KB Output is correct
6 Correct 14 ms 25812 KB Output is correct
7 Correct 14 ms 25896 KB Output is correct
8 Correct 14 ms 25840 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 13 ms 25824 KB Output is correct
11 Correct 16 ms 25984 KB Output is correct
12 Correct 13 ms 25876 KB Output is correct
13 Correct 12 ms 25904 KB Output is correct
14 Correct 13 ms 25812 KB Output is correct
15 Correct 13 ms 25880 KB Output is correct
16 Correct 13 ms 25796 KB Output is correct
17 Correct 13 ms 25884 KB Output is correct
18 Correct 13 ms 25812 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 13 ms 25812 KB Output is correct
21 Correct 12 ms 25812 KB Output is correct
22 Correct 12 ms 25812 KB Output is correct
23 Correct 12 ms 25812 KB Output is correct
24 Correct 15 ms 25904 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 13 ms 25800 KB Output is correct
3 Correct 14 ms 25916 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 13 ms 25816 KB Output is correct
6 Correct 14 ms 25812 KB Output is correct
7 Correct 14 ms 25896 KB Output is correct
8 Correct 14 ms 25840 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 13 ms 25824 KB Output is correct
11 Correct 16 ms 25984 KB Output is correct
12 Correct 13 ms 25876 KB Output is correct
13 Correct 12 ms 25904 KB Output is correct
14 Correct 13 ms 25812 KB Output is correct
15 Correct 13 ms 25880 KB Output is correct
16 Correct 13 ms 25796 KB Output is correct
17 Correct 13 ms 25884 KB Output is correct
18 Correct 13 ms 25812 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 13 ms 25812 KB Output is correct
21 Correct 12 ms 25812 KB Output is correct
22 Correct 12 ms 25812 KB Output is correct
23 Correct 12 ms 25812 KB Output is correct
24 Correct 15 ms 25904 KB Output is correct
25 Correct 12 ms 25912 KB Output is correct
26 Correct 15 ms 26072 KB Output is correct
27 Correct 14 ms 26068 KB Output is correct
28 Correct 14 ms 26188 KB Output is correct
29 Correct 15 ms 26180 KB Output is correct
30 Correct 17 ms 26040 KB Output is correct
31 Correct 13 ms 25828 KB Output is correct
32 Correct 15 ms 26272 KB Output is correct
33 Correct 13 ms 25812 KB Output is correct
34 Correct 15 ms 26032 KB Output is correct
35 Correct 15 ms 26108 KB Output is correct
36 Correct 14 ms 26008 KB Output is correct
37 Correct 14 ms 26068 KB Output is correct
38 Correct 13 ms 25908 KB Output is correct
39 Correct 15 ms 26136 KB Output is correct
40 Correct 15 ms 26088 KB Output is correct
41 Correct 14 ms 26012 KB Output is correct
42 Correct 14 ms 26152 KB Output is correct
43 Correct 15 ms 26384 KB Output is correct
44 Correct 13 ms 25812 KB Output is correct
45 Correct 14 ms 26216 KB Output is correct
46 Correct 14 ms 26128 KB Output is correct
47 Correct 13 ms 25916 KB Output is correct
48 Correct 14 ms 26116 KB Output is correct
49 Correct 14 ms 26068 KB Output is correct
50 Correct 15 ms 26232 KB Output is correct
51 Correct 14 ms 26072 KB Output is correct
52 Correct 15 ms 26084 KB Output is correct
53 Correct 17 ms 26128 KB Output is correct
54 Correct 14 ms 26084 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 13 ms 25800 KB Output is correct
3 Correct 14 ms 25916 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 13 ms 25816 KB Output is correct
6 Correct 14 ms 25812 KB Output is correct
7 Correct 14 ms 25896 KB Output is correct
8 Correct 14 ms 25840 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 13 ms 25824 KB Output is correct
11 Correct 16 ms 25984 KB Output is correct
12 Correct 13 ms 25876 KB Output is correct
13 Correct 12 ms 25904 KB Output is correct
14 Correct 13 ms 25812 KB Output is correct
15 Correct 13 ms 25880 KB Output is correct
16 Correct 13 ms 25796 KB Output is correct
17 Correct 13 ms 25884 KB Output is correct
18 Correct 13 ms 25812 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 13 ms 25812 KB Output is correct
21 Correct 12 ms 25812 KB Output is correct
22 Correct 12 ms 25812 KB Output is correct
23 Correct 12 ms 25812 KB Output is correct
24 Correct 15 ms 25904 KB Output is correct
25 Correct 13 ms 25812 KB Output is correct
26 Correct 51 ms 32656 KB Output is correct
27 Correct 64 ms 32332 KB Output is correct
28 Correct 14 ms 26068 KB Output is correct
29 Correct 14 ms 25788 KB Output is correct
30 Correct 13 ms 25912 KB Output is correct
31 Correct 61 ms 32328 KB Output is correct
32 Correct 14 ms 26080 KB Output is correct
33 Correct 73 ms 39548 KB Output is correct
34 Correct 66 ms 32392 KB Output is correct
35 Correct 18 ms 26068 KB Output is correct
36 Correct 70 ms 33148 KB Output is correct
37 Correct 15 ms 26068 KB Output is correct
38 Correct 15 ms 26016 KB Output is correct
39 Correct 52 ms 32580 KB Output is correct
40 Correct 15 ms 26324 KB Output is correct
41 Correct 60 ms 32344 KB Output is correct
42 Correct 66 ms 34700 KB Output is correct
43 Correct 14 ms 25812 KB Output is correct
44 Correct 70 ms 39812 KB Output is correct
45 Correct 65 ms 36028 KB Output is correct
46 Correct 17 ms 26040 KB Output is correct
47 Correct 15 ms 26104 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 32708 KB Output is correct
2 Correct 66 ms 35268 KB Output is correct
3 Correct 15 ms 26144 KB Output is correct
4 Correct 14 ms 26116 KB Output is correct
5 Correct 13 ms 25812 KB Output is correct
6 Correct 13 ms 25820 KB Output is correct
7 Correct 14 ms 26060 KB Output is correct
8 Correct 69 ms 33496 KB Output is correct
9 Correct 14 ms 26068 KB Output is correct
10 Correct 72 ms 32624 KB Output is correct
11 Correct 13 ms 25916 KB Output is correct
12 Correct 63 ms 32480 KB Output is correct
13 Correct 73 ms 33388 KB Output is correct
14 Correct 83 ms 35008 KB Output is correct
15 Correct 51 ms 32580 KB Output is correct
16 Correct 15 ms 26132 KB Output is correct
17 Correct 13 ms 25912 KB Output is correct
18 Correct 63 ms 34972 KB Output is correct
19 Correct 91 ms 38944 KB Output is correct
20 Correct 14 ms 26068 KB Output is correct
21 Correct 13 ms 25812 KB Output is correct
22 Correct 61 ms 33740 KB Output is correct
23 Correct 15 ms 26120 KB Output is correct
24 Correct 66 ms 32688 KB Output is correct
25 Correct 98 ms 37588 KB Output is correct
26 Correct 16 ms 26188 KB Output is correct
27 Correct 18 ms 26232 KB Output is correct
28 Correct 16 ms 26196 KB Output is correct
29 Correct 15 ms 26132 KB Output is correct
30 Correct 15 ms 26068 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 13 ms 25800 KB Output is correct
3 Correct 14 ms 25916 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 13 ms 25816 KB Output is correct
6 Correct 14 ms 25812 KB Output is correct
7 Correct 14 ms 25896 KB Output is correct
8 Correct 14 ms 25840 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 13 ms 25824 KB Output is correct
11 Correct 16 ms 25984 KB Output is correct
12 Correct 13 ms 25876 KB Output is correct
13 Correct 12 ms 25904 KB Output is correct
14 Correct 13 ms 25812 KB Output is correct
15 Correct 13 ms 25880 KB Output is correct
16 Correct 13 ms 25796 KB Output is correct
17 Correct 13 ms 25884 KB Output is correct
18 Correct 13 ms 25812 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 13 ms 25812 KB Output is correct
21 Correct 12 ms 25812 KB Output is correct
22 Correct 12 ms 25812 KB Output is correct
23 Correct 12 ms 25812 KB Output is correct
24 Correct 15 ms 25904 KB Output is correct
25 Correct 12 ms 25912 KB Output is correct
26 Correct 15 ms 26072 KB Output is correct
27 Correct 14 ms 26068 KB Output is correct
28 Correct 14 ms 26188 KB Output is correct
29 Correct 15 ms 26180 KB Output is correct
30 Correct 17 ms 26040 KB Output is correct
31 Correct 13 ms 25828 KB Output is correct
32 Correct 15 ms 26272 KB Output is correct
33 Correct 13 ms 25812 KB Output is correct
34 Correct 15 ms 26032 KB Output is correct
35 Correct 15 ms 26108 KB Output is correct
36 Correct 14 ms 26008 KB Output is correct
37 Correct 14 ms 26068 KB Output is correct
38 Correct 13 ms 25908 KB Output is correct
39 Correct 15 ms 26136 KB Output is correct
40 Correct 15 ms 26088 KB Output is correct
41 Correct 14 ms 26012 KB Output is correct
42 Correct 14 ms 26152 KB Output is correct
43 Correct 15 ms 26384 KB Output is correct
44 Correct 13 ms 25812 KB Output is correct
45 Correct 14 ms 26216 KB Output is correct
46 Correct 14 ms 26128 KB Output is correct
47 Correct 13 ms 25916 KB Output is correct
48 Correct 14 ms 26116 KB Output is correct
49 Correct 14 ms 26068 KB Output is correct
50 Correct 15 ms 26232 KB Output is correct
51 Correct 14 ms 26072 KB Output is correct
52 Correct 15 ms 26084 KB Output is correct
53 Correct 17 ms 26128 KB Output is correct
54 Correct 14 ms 26084 KB Output is correct
55 Correct 13 ms 25812 KB Output is correct
56 Correct 51 ms 32656 KB Output is correct
57 Correct 64 ms 32332 KB Output is correct
58 Correct 14 ms 26068 KB Output is correct
59 Correct 14 ms 25788 KB Output is correct
60 Correct 13 ms 25912 KB Output is correct
61 Correct 61 ms 32328 KB Output is correct
62 Correct 14 ms 26080 KB Output is correct
63 Correct 73 ms 39548 KB Output is correct
64 Correct 66 ms 32392 KB Output is correct
65 Correct 18 ms 26068 KB Output is correct
66 Correct 70 ms 33148 KB Output is correct
67 Correct 15 ms 26068 KB Output is correct
68 Correct 15 ms 26016 KB Output is correct
69 Correct 52 ms 32580 KB Output is correct
70 Correct 15 ms 26324 KB Output is correct
71 Correct 60 ms 32344 KB Output is correct
72 Correct 66 ms 34700 KB Output is correct
73 Correct 14 ms 25812 KB Output is correct
74 Correct 70 ms 39812 KB Output is correct
75 Correct 65 ms 36028 KB Output is correct
76 Correct 17 ms 26040 KB Output is correct
77 Correct 15 ms 26104 KB Output is correct
78 Correct 53 ms 32708 KB Output is correct
79 Correct 66 ms 35268 KB Output is correct
80 Correct 15 ms 26144 KB Output is correct
81 Correct 14 ms 26116 KB Output is correct
82 Correct 13 ms 25812 KB Output is correct
83 Correct 13 ms 25820 KB Output is correct
84 Correct 14 ms 26060 KB Output is correct
85 Correct 69 ms 33496 KB Output is correct
86 Correct 14 ms 26068 KB Output is correct
87 Correct 72 ms 32624 KB Output is correct
88 Correct 13 ms 25916 KB Output is correct
89 Correct 63 ms 32480 KB Output is correct
90 Correct 73 ms 33388 KB Output is correct
91 Correct 83 ms 35008 KB Output is correct
92 Correct 51 ms 32580 KB Output is correct
93 Correct 15 ms 26132 KB Output is correct
94 Correct 13 ms 25912 KB Output is correct
95 Correct 63 ms 34972 KB Output is correct
96 Correct 91 ms 38944 KB Output is correct
97 Correct 14 ms 26068 KB Output is correct
98 Correct 13 ms 25812 KB Output is correct
99 Correct 61 ms 33740 KB Output is correct
100 Correct 15 ms 26120 KB Output is correct
101 Correct 66 ms 32688 KB Output is correct
102 Correct 98 ms 37588 KB Output is correct
103 Correct 16 ms 26188 KB Output is correct
104 Correct 18 ms 26232 KB Output is correct
105 Correct 16 ms 26196 KB Output is correct
106 Correct 15 ms 26132 KB Output is correct
107 Correct 15 ms 26068 KB Output is correct
108 Runtime error 276 ms 124976 KB Execution killed with signal 11
109 Halted 0 ms 0 KB -