oj.uz

Submission #393621

# Submission time Handle Problem Language Result Execution time Memory
393621 2021-04-24T06:21:46 Z palilo None (KOI18_family) C++17
100 / 100
 341 ms 52304 KB 
#include <bits/stdc++.h>
using namespace std;

namespace std {
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template <class Fun>
class y_combinator_result {
    Fun fun_;

public:
    template <class T>
    explicit y_combinator_result(T&& fun) : fun_(std::forward<T>(fun)) {}

    template <class... Args>
    decltype(auto) operator()(Args&&... args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template <class Fun>
decltype(auto) y_combinator(Fun&& fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}
}; // namespace std

struct disjoint_set {
    vector<int> par;
    disjoint_set(int n) : par(n, -1) {}
    int find(int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }
    int get_size(int u) {
        return -par[find(u)];
    }
    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (par[u] > par[v]) swap(u, v);
        par[u] += par[v];
        par[v] = u;
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef home
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int n1, n2, k;
    cin >> n1 >> n2 >> k;

    int root1 = -1, root2 = -1;
    vector<vector<int>> tree1(n1), tree2(n2);
    for (int i = 0, p; i < n1; ++i) {
        cin >> p, --p;
        if (p == -1) root1 = i;
        else
            tree1[p].emplace_back(i);
    }
    for (int i = 0, p; i < n2; ++i) {
        cin >> p, --p;
        if (p == -1) root2 = i;
        else
            tree2[p].emplace_back(i);
    }

    assert(~root1);
    assert(~root2);

    vector<pair<int, int>> a;
    auto dfs = [&](vector<vector<int>>& tree, int root) {
        vector<int> dp(tree.size());
        fill(dp.begin(), dp.begin() + k, 1);

        vector<int> leaf(tree.size());
        iota(leaf.begin(), leaf.begin() + k, 0);

        y_combinator([&](auto self, int u) -> void {
            for (const auto& v : tree[u]) {
                self(v);
                dp[u] += dp[v];
                leaf[u] = leaf[v];
            }
        })(root);
        return make_pair(dp, leaf);
    };

    const auto [dp1, leaf1] = dfs(tree1, root1);
    const auto [dp2, leaf2] = dfs(tree2, root2);

    assert(dp1[root1] == k);
    assert(dp2[root2] == k);

    for (int i = k; i < n1; ++i)
        if (int(tree1[i].size() != 1))
            a.emplace_back(dp1[i], ~i);
    for (int i = k; i < n2; ++i)
        if (int(tree2[i].size() != 1))
            a.emplace_back(dp2[i], i);

    sort(a.begin(), a.end(), [&](auto& a, auto& b) {
        return a.first < b.first;
    });

    disjoint_set dsu(k);

    for (auto [sz, u] : a) {
        const auto& tree = u < 0 ? tree1 : tree2;
        const auto& leaf = u < 0 ? leaf1 : leaf2;
        if (u < 0) u = ~u;

        assert(!tree[u].empty());

        for (const auto& v : tree[u])
            dsu.merge(leaf[u], leaf[v]);

        if (sz != dsu.get_size(leaf[u]))
            return cout << "NO", 0;
    }
    cout << "YES";
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 316 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 316 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 2 ms 716 KB Output is correct
52 Correct 3 ms 844 KB Output is correct
53 Correct 3 ms 840 KB Output is correct
54 Correct 3 ms 716 KB Output is correct
55 Correct 2 ms 716 KB Output is correct
56 Correct 2 ms 716 KB Output is correct
57 Correct 2 ms 716 KB Output is correct
58 Correct 3 ms 716 KB Output is correct
59 Correct 3 ms 712 KB Output is correct
60 Correct 2 ms 728 KB Output is correct
61 Correct 3 ms 972 KB Output is correct
62 Correct 3 ms 972 KB Output is correct
63 Correct 3 ms 716 KB Output is correct
64 Correct 2 ms 588 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 4 ms 844 KB Output is correct
67 Correct 3 ms 716 KB Output is correct
68 Correct 2 ms 716 KB Output is correct
69 Correct 3 ms 844 KB Output is correct
70 Correct 2 ms 708 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 316 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 2 ms 716 KB Output is correct
52 Correct 3 ms 844 KB Output is correct
53 Correct 3 ms 840 KB Output is correct
54 Correct 3 ms 716 KB Output is correct
55 Correct 2 ms 716 KB Output is correct
56 Correct 2 ms 716 KB Output is correct
57 Correct 2 ms 716 KB Output is correct
58 Correct 3 ms 716 KB Output is correct
59 Correct 3 ms 712 KB Output is correct
60 Correct 2 ms 728 KB Output is correct
61 Correct 3 ms 972 KB Output is correct
62 Correct 3 ms 972 KB Output is correct
63 Correct 3 ms 716 KB Output is correct
64 Correct 2 ms 588 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 4 ms 844 KB Output is correct
67 Correct 3 ms 716 KB Output is correct
68 Correct 2 ms 716 KB Output is correct
69 Correct 3 ms 844 KB Output is correct
70 Correct 2 ms 708 KB Output is correct
71 Correct 35 ms 6320 KB Output is correct
72 Correct 28 ms 5948 KB Output is correct
73 Correct 17 ms 4548 KB Output is correct
74 Correct 33 ms 8564 KB Output is correct
75 Correct 30 ms 8072 KB Output is correct
76 Correct 334 ms 52304 KB Output is correct
77 Correct 341 ms 44684 KB Output is correct
78 Correct 255 ms 29724 KB Output is correct
79 Correct 303 ms 42516 KB Output is correct
80 Correct 300 ms 40628 KB Output is correct
81 Correct 27 ms 6308 KB Output is correct
82 Correct 27 ms 5948 KB Output is correct
83 Correct 19 ms 4532 KB Output is correct
84 Correct 31 ms 8508 KB Output is correct
85 Correct 30 ms 7976 KB Output is correct
86 Correct 282 ms 46172 KB Output is correct
87 Correct 289 ms 46040 KB Output is correct
88 Correct 167 ms 29664 KB Output is correct
89 Correct 282 ms 41916 KB Output is correct
90 Correct 300 ms 40788 KB Output is correct