oj.uz

Submission #796653

# Submission time Handle Problem Language Result Execution time Memory
796653 2023-07-28T15:21:17 Z rnl42 Mergers (JOI19_mergers) C++14
70 / 100
 268 ms 125040 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;
        assert(i >= 0 && other.i >= 0 && i < N && other.i < N);
        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]);
        }
    }
    //cerr << "lca(" << u << ", " << v << ") = " << (int)ret << '\n';
    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;
    //dist.resize(N);
    //adj.resize(N);
    //first.resize(N);
    //group_of.resize(N);
    //members.resize(K);
    //lcatree.resize(1<<20);
    //uf.resize(N);
    //mergeuntil.resize(N);
    //penible.resize(N);
    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]);
    }
    assert(N < 5e5);
    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);
    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

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25812 KB Output is correct
2 Correct 17 ms 25812 KB Output is correct
3 Correct 16 ms 25824 KB Output is correct
4 Correct 15 ms 25812 KB Output is correct
5 Correct 16 ms 25812 KB Output is correct
6 Correct 16 ms 25812 KB Output is correct
7 Correct 14 ms 25812 KB Output is correct
8 Correct 14 ms 25904 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 14 ms 25812 KB Output is correct
11 Correct 15 ms 25880 KB Output is correct
12 Correct 13 ms 25792 KB Output is correct
13 Correct 14 ms 25868 KB Output is correct
14 Correct 13 ms 25808 KB Output is correct
15 Correct 14 ms 25800 KB Output is correct
16 Correct 14 ms 25812 KB Output is correct
17 Correct 14 ms 25888 KB Output is correct
18 Correct 15 ms 25844 KB Output is correct
19 Correct 14 ms 25812 KB Output is correct
20 Correct 13 ms 25836 KB Output is correct
21 Correct 13 ms 25844 KB Output is correct
22 Correct 13 ms 25812 KB Output is correct
23 Correct 14 ms 25812 KB Output is correct
24 Correct 13 ms 25792 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25812 KB Output is correct
2 Correct 17 ms 25812 KB Output is correct
3 Correct 16 ms 25824 KB Output is correct
4 Correct 15 ms 25812 KB Output is correct
5 Correct 16 ms 25812 KB Output is correct
6 Correct 16 ms 25812 KB Output is correct
7 Correct 14 ms 25812 KB Output is correct
8 Correct 14 ms 25904 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 14 ms 25812 KB Output is correct
11 Correct 15 ms 25880 KB Output is correct
12 Correct 13 ms 25792 KB Output is correct
13 Correct 14 ms 25868 KB Output is correct
14 Correct 13 ms 25808 KB Output is correct
15 Correct 14 ms 25800 KB Output is correct
16 Correct 14 ms 25812 KB Output is correct
17 Correct 14 ms 25888 KB Output is correct
18 Correct 15 ms 25844 KB Output is correct
19 Correct 14 ms 25812 KB Output is correct
20 Correct 13 ms 25836 KB Output is correct
21 Correct 13 ms 25844 KB Output is correct
22 Correct 13 ms 25812 KB Output is correct
23 Correct 14 ms 25812 KB Output is correct
24 Correct 13 ms 25792 KB Output is correct
25 Correct 13 ms 25812 KB Output is correct
26 Correct 15 ms 26072 KB Output is correct
27 Correct 16 ms 26048 KB Output is correct
28 Correct 14 ms 26196 KB Output is correct
29 Correct 16 ms 26084 KB Output is correct
30 Correct 15 ms 26056 KB Output is correct
31 Correct 16 ms 25828 KB Output is correct
32 Correct 18 ms 26324 KB Output is correct
33 Correct 13 ms 25868 KB Output is correct
34 Correct 15 ms 26124 KB Output is correct
35 Correct 19 ms 26100 KB Output is correct
36 Correct 15 ms 26068 KB Output is correct
37 Correct 15 ms 26068 KB Output is correct
38 Correct 14 ms 25812 KB Output is correct
39 Correct 14 ms 26144 KB Output is correct
40 Correct 14 ms 26068 KB Output is correct
41 Correct 14 ms 26132 KB Output is correct
42 Correct 16 ms 26068 KB Output is correct
43 Correct 16 ms 26324 KB Output is correct
44 Correct 14 ms 25920 KB Output is correct
45 Correct 15 ms 26196 KB Output is correct
46 Correct 16 ms 26016 KB Output is correct
47 Correct 13 ms 25888 KB Output is correct
48 Correct 14 ms 26068 KB Output is correct
49 Correct 14 ms 26188 KB Output is correct
50 Correct 15 ms 26180 KB Output is correct
51 Correct 16 ms 26068 KB Output is correct
52 Correct 15 ms 26124 KB Output is correct
53 Correct 15 ms 26068 KB Output is correct
54 Correct 14 ms 26044 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25812 KB Output is correct
2 Correct 17 ms 25812 KB Output is correct
3 Correct 16 ms 25824 KB Output is correct
4 Correct 15 ms 25812 KB Output is correct
5 Correct 16 ms 25812 KB Output is correct
6 Correct 16 ms 25812 KB Output is correct
7 Correct 14 ms 25812 KB Output is correct
8 Correct 14 ms 25904 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 14 ms 25812 KB Output is correct
11 Correct 15 ms 25880 KB Output is correct
12 Correct 13 ms 25792 KB Output is correct
13 Correct 14 ms 25868 KB Output is correct
14 Correct 13 ms 25808 KB Output is correct
15 Correct 14 ms 25800 KB Output is correct
16 Correct 14 ms 25812 KB Output is correct
17 Correct 14 ms 25888 KB Output is correct
18 Correct 15 ms 25844 KB Output is correct
19 Correct 14 ms 25812 KB Output is correct
20 Correct 13 ms 25836 KB Output is correct
21 Correct 13 ms 25844 KB Output is correct
22 Correct 13 ms 25812 KB Output is correct
23 Correct 14 ms 25812 KB Output is correct
24 Correct 13 ms 25792 KB Output is correct
25 Correct 12 ms 25908 KB Output is correct
26 Correct 51 ms 32720 KB Output is correct
27 Correct 72 ms 32300 KB Output is correct
28 Correct 16 ms 26120 KB Output is correct
29 Correct 14 ms 25792 KB Output is correct
30 Correct 13 ms 25812 KB Output is correct
31 Correct 60 ms 32320 KB Output is correct
32 Correct 15 ms 26008 KB Output is correct
33 Correct 81 ms 39452 KB Output is correct
34 Correct 63 ms 32364 KB Output is correct
35 Correct 16 ms 26088 KB Output is correct
36 Correct 66 ms 33092 KB Output is correct
37 Correct 15 ms 26036 KB Output is correct
38 Correct 15 ms 26068 KB Output is correct
39 Correct 52 ms 32580 KB Output is correct
40 Correct 15 ms 26324 KB Output is correct
41 Correct 65 ms 32280 KB Output is correct
42 Correct 88 ms 34816 KB Output is correct
43 Correct 15 ms 25812 KB Output is correct
44 Correct 82 ms 39852 KB Output is correct
45 Correct 69 ms 36132 KB Output is correct
46 Correct 17 ms 26028 KB Output is correct
47 Correct 16 ms 26068 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 32732 KB Output is correct
2 Correct 71 ms 35368 KB Output is correct
3 Correct 15 ms 26068 KB Output is correct
4 Correct 14 ms 26028 KB Output is correct
5 Correct 13 ms 25884 KB Output is correct
6 Correct 14 ms 25808 KB Output is correct
7 Correct 14 ms 26068 KB Output is correct
8 Correct 76 ms 33448 KB Output is correct
9 Correct 15 ms 26100 KB Output is correct
10 Correct 66 ms 32464 KB Output is correct
11 Correct 14 ms 25812 KB Output is correct
12 Correct 66 ms 32460 KB Output is correct
13 Correct 87 ms 33540 KB Output is correct
14 Correct 91 ms 35020 KB Output is correct
15 Correct 54 ms 32612 KB Output is correct
16 Correct 15 ms 26068 KB Output is correct
17 Correct 15 ms 25824 KB Output is correct
18 Correct 65 ms 35012 KB Output is correct
19 Correct 98 ms 38956 KB Output is correct
20 Correct 16 ms 26068 KB Output is correct
21 Correct 14 ms 25920 KB Output is correct
22 Correct 61 ms 33808 KB Output is correct
23 Correct 15 ms 26024 KB Output is correct
24 Correct 88 ms 32744 KB Output is correct
25 Correct 95 ms 37676 KB Output is correct
26 Correct 15 ms 26188 KB Output is correct
27 Correct 15 ms 26140 KB Output is correct
28 Correct 16 ms 26008 KB Output is correct
29 Correct 15 ms 26124 KB Output is correct
30 Correct 15 ms 26112 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25812 KB Output is correct
2 Correct 17 ms 25812 KB Output is correct
3 Correct 16 ms 25824 KB Output is correct
4 Correct 15 ms 25812 KB Output is correct
5 Correct 16 ms 25812 KB Output is correct
6 Correct 16 ms 25812 KB Output is correct
7 Correct 14 ms 25812 KB Output is correct
8 Correct 14 ms 25904 KB Output is correct
9 Correct 14 ms 25812 KB Output is correct
10 Correct 14 ms 25812 KB Output is correct
11 Correct 15 ms 25880 KB Output is correct
12 Correct 13 ms 25792 KB Output is correct
13 Correct 14 ms 25868 KB Output is correct
14 Correct 13 ms 25808 KB Output is correct
15 Correct 14 ms 25800 KB Output is correct
16 Correct 14 ms 25812 KB Output is correct
17 Correct 14 ms 25888 KB Output is correct
18 Correct 15 ms 25844 KB Output is correct
19 Correct 14 ms 25812 KB Output is correct
20 Correct 13 ms 25836 KB Output is correct
21 Correct 13 ms 25844 KB Output is correct
22 Correct 13 ms 25812 KB Output is correct
23 Correct 14 ms 25812 KB Output is correct
24 Correct 13 ms 25792 KB Output is correct
25 Correct 13 ms 25812 KB Output is correct
26 Correct 15 ms 26072 KB Output is correct
27 Correct 16 ms 26048 KB Output is correct
28 Correct 14 ms 26196 KB Output is correct
29 Correct 16 ms 26084 KB Output is correct
30 Correct 15 ms 26056 KB Output is correct
31 Correct 16 ms 25828 KB Output is correct
32 Correct 18 ms 26324 KB Output is correct
33 Correct 13 ms 25868 KB Output is correct
34 Correct 15 ms 26124 KB Output is correct
35 Correct 19 ms 26100 KB Output is correct
36 Correct 15 ms 26068 KB Output is correct
37 Correct 15 ms 26068 KB Output is correct
38 Correct 14 ms 25812 KB Output is correct
39 Correct 14 ms 26144 KB Output is correct
40 Correct 14 ms 26068 KB Output is correct
41 Correct 14 ms 26132 KB Output is correct
42 Correct 16 ms 26068 KB Output is correct
43 Correct 16 ms 26324 KB Output is correct
44 Correct 14 ms 25920 KB Output is correct
45 Correct 15 ms 26196 KB Output is correct
46 Correct 16 ms 26016 KB Output is correct
47 Correct 13 ms 25888 KB Output is correct
48 Correct 14 ms 26068 KB Output is correct
49 Correct 14 ms 26188 KB Output is correct
50 Correct 15 ms 26180 KB Output is correct
51 Correct 16 ms 26068 KB Output is correct
52 Correct 15 ms 26124 KB Output is correct
53 Correct 15 ms 26068 KB Output is correct
54 Correct 14 ms 26044 KB Output is correct
55 Correct 12 ms 25908 KB Output is correct
56 Correct 51 ms 32720 KB Output is correct
57 Correct 72 ms 32300 KB Output is correct
58 Correct 16 ms 26120 KB Output is correct
59 Correct 14 ms 25792 KB Output is correct
60 Correct 13 ms 25812 KB Output is correct
61 Correct 60 ms 32320 KB Output is correct
62 Correct 15 ms 26008 KB Output is correct
63 Correct 81 ms 39452 KB Output is correct
64 Correct 63 ms 32364 KB Output is correct
65 Correct 16 ms 26088 KB Output is correct
66 Correct 66 ms 33092 KB Output is correct
67 Correct 15 ms 26036 KB Output is correct
68 Correct 15 ms 26068 KB Output is correct
69 Correct 52 ms 32580 KB Output is correct
70 Correct 15 ms 26324 KB Output is correct
71 Correct 65 ms 32280 KB Output is correct
72 Correct 88 ms 34816 KB Output is correct
73 Correct 15 ms 25812 KB Output is correct
74 Correct 82 ms 39852 KB Output is correct
75 Correct 69 ms 36132 KB Output is correct
76 Correct 17 ms 26028 KB Output is correct
77 Correct 16 ms 26068 KB Output is correct
78 Correct 52 ms 32732 KB Output is correct
79 Correct 71 ms 35368 KB Output is correct
80 Correct 15 ms 26068 KB Output is correct
81 Correct 14 ms 26028 KB Output is correct
82 Correct 13 ms 25884 KB Output is correct
83 Correct 14 ms 25808 KB Output is correct
84 Correct 14 ms 26068 KB Output is correct
85 Correct 76 ms 33448 KB Output is correct
86 Correct 15 ms 26100 KB Output is correct
87 Correct 66 ms 32464 KB Output is correct
88 Correct 14 ms 25812 KB Output is correct
89 Correct 66 ms 32460 KB Output is correct
90 Correct 87 ms 33540 KB Output is correct
91 Correct 91 ms 35020 KB Output is correct
92 Correct 54 ms 32612 KB Output is correct
93 Correct 15 ms 26068 KB Output is correct
94 Correct 15 ms 25824 KB Output is correct
95 Correct 65 ms 35012 KB Output is correct
96 Correct 98 ms 38956 KB Output is correct
97 Correct 16 ms 26068 KB Output is correct
98 Correct 14 ms 25920 KB Output is correct
99 Correct 61 ms 33808 KB Output is correct
100 Correct 15 ms 26024 KB Output is correct
101 Correct 88 ms 32744 KB Output is correct
102 Correct 95 ms 37676 KB Output is correct
103 Correct 15 ms 26188 KB Output is correct
104 Correct 15 ms 26140 KB Output is correct
105 Correct 16 ms 26008 KB Output is correct
106 Correct 15 ms 26124 KB Output is correct
107 Correct 15 ms 26112 KB Output is correct
108 Runtime error 268 ms 125040 KB Execution killed with signal 6
109 Halted 0 ms 0 KB -