oj.uz

Submission #791292

# Submission time Handle Problem Language Result Execution time Memory
791292 2023-07-24T00:29:10 Z skittles1412 Split the Attractions (IOI19_split) C++17
100 / 100
 100 ms 27680 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

struct DSU {
    vector<int> p;

    DSU(int n) : p(n, -1) {}

    int find(int u) {
        return p[u] < 0 ? u : (p[u] = find(p[u]));
    }

    bool merge(int u, int v) {
        u = find(u);
        v = find(v);
        if (u == v) {
            return false;
        }
        if (p[u] < p[v]) {
            swap(u, v);
        }
        p[v] += p[u];
        p[u] = v;
        return true;
    }
};

vector<pair<int, int>> spanning_tree(int n,
                                     const vector<pair<int, int>>& edges) {
    DSU dsu(n);
    vector<pair<int, int>> ans;
    for (auto& [u, v] : edges) {
        if (dsu.merge(u, v)) {
            ans.emplace_back(u, v);
        }
    }
    return ans;
}

struct Centroid {
    int n, cu;
    vector<int> siz;
    vector<vector<int>> graph, comps;

    Centroid(int n, const vector<pair<int, int>>& edges)
        : n(n), siz(n), graph(n) {
        for (auto& [u, v] : edges) {
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
        pdfs(0, -1);

        cu = 0;
        while (true) {
            pair<int, int> opt {-1, -1};
            for (auto& v : graph[cu]) {
                opt = max(opt, {siz[v], v});
            }
            if (opt.first <= n / 2) {
                break;
            }
            int nu = opt.second;
            siz[cu] -= siz[nu];
            siz[nu] += siz[cu];
            cu = nu;
        }

        for (auto& v : graph[cu]) {
            comps.emplace_back();
            dfs(v, cu, comps.back());
            dbg(v, siz[v], sz(comps.back()));
        }
    }

    void pdfs(int u, int p) {
        siz[u] = 1;
        for (auto& v : graph[u]) {
            if (v == p) {
                continue;
            }
            pdfs(v, u);
            siz[u] += siz[v];
        }
    }

    void dfs(int u, int p, vector<int>& out) {
        out.push_back(u);
        for (auto& v : graph[u]) {
            if (v == p) {
                continue;
            }
            dfs(v, u, out);
        }
    }
};

struct Solver1 {
    bool found = false;
    int n, kv, csum;
    vector<char> vis;
    vector<int> arr, st;
    vector<vector<int>> graph;

    Solver1(int n,
            int kv,
            const vector<int>& arr,
            const vector<pair<int, int>>& edges)
        : n(n), kv(kv), vis(n), arr(arr), graph(n) {
        assert(*max_element(begin(arr), end(arr)) < kv);
        for (auto& [u, v] : edges) {
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
        for (int i = 0; i < n && !found; i++) {
            if (vis[i]) {
                continue;
            }
            st.clear();
            csum = 0;
            dfs(i);
            found |= csum >= kv;
        }
    }

    void dfs(int u) {
        if (found || vis[u]) {
            return;
        } else if (csum >= kv) {
            assert(csum <= 2 * kv - 2);
            found = true;
            return;
        }
        vis[u] = true;
        st.push_back(u);
        csum += arr[u];
        for (auto& v : graph[u]) {
            dfs(v);
        }
    }
};

struct Solver2 {
    int n, kv;
    vector<char> vis;
    vector<int> st;
    vector<vector<int>> graph;

    Solver2(int n,
            int kv,
            const vector<int>& nodes,
            const vector<pair<int, int>>& edges)
        : n(n), kv(kv), vis(n), graph(n) {
        bool inode[n] {};
        for (auto& a : nodes) {
            inode[a] = true;
        }

        assert(kv <= n);
        for (auto& [u, v] : edges) {
            if (!inode[u] || !inode[v]) {
                continue;
            }
            graph[u].push_back(v);
            graph[v].push_back(u);
        }

        dfs(nodes[0]);

        assert(sz(st) == kv);
    }

    void dfs(int u) {
        if (vis[u] || sz(st) == kv) {
            return;
        }
        vis[u] = true;
        st.push_back(u);
        for (auto& v : graph[u]) {
            dfs(v);
        }
    }
};

vector<int> find_split(int n,
                       int kv1,
                       int kv2,
                       int kv3,
                       vector<int> edges_u,
                       vector<int> edges_v) {
    int m = sz(edges_u);

    vector<pair<int, int>> edges(m);
    for (int i = 0; i < m; i++) {
        edges[i] = {edges_u[i], edges_v[i]};
    }

    array<int, 3> ikv {kv1, kv2, kv3};
    {
        array<int, 3> ckv {kv1, kv2, kv3};
        sort(begin(ckv), end(ckv));
        kv1 = ckv[0];
        kv2 = ckv[1];
        kv3 = ckv[2];
    }

    auto repermute = [&](vector<int> arr) -> vector<int> {
        int cnt[3] {};
        for (auto& a : arr) {
            cnt[a - 1]++;
        }

        int perm[3];
        iota(begin(perm), end(perm), 0);

        do {
            bool ok = true;
            for (int i = 0; i < 3; i++) {
                ok &= ikv[perm[i]] == cnt[i];
            }
            if (!ok) {
                continue;
            }

            for (auto& a : arr) {
                a = perm[a - 1] + 1;
            }
            return arr;
        } while (next_permutation(begin(perm), end(perm)));

        assert(false);
    };

    dbg(kv1, kv2, kv3);

    Centroid centroid(n, spanning_tree(n, edges));
    auto& comps = centroid.comps;

    int i_comp[n];
    i_comp[centroid.cu] = -1;
    for (int i = 0; i < sz(comps); i++) {
        for (auto& a : comps[i]) {
            i_comp[a] = i;
        }
    }

    auto not_nodes = [&](const vector<int>& arr) -> vector<int> {
        bool vis[n] {};
        for (auto& a : arr) {
            vis[a] = true;
        }
        vector<int> ans;
        for (int i = 0; i < n; i++) {
            if (!vis[i]) {
                ans.push_back(i);
            }
        }
        return ans;
    };
    auto answer = [&](const vector<int>& arra,
                      const vector<int>& arrb) -> vector<int> {
        dbg(sz(arra), sz(arrb));
        assert(kv1 <= sz(arra) && kv2 <= sz(arrb));
        vector<int> ans(n, 3);

        auto go = [&](const vector<int>& nodes, int kv, int val) -> void {
            auto c_comp = Solver2(n, kv, nodes, edges).st;
            for (auto& a : c_comp) {
                ans[a] = val;
            }
        };

        go(arra, kv1, 1);
        go(arrb, kv2, 2);

        return repermute(ans);
    };

    for (int i = 0; i < sz(comps); i++) {
        if (sz(comps[i]) < kv1) {
            continue;
        }

        auto arra = comps[i];
        dbg("centroid quick");
        return answer(arra, not_nodes(arra));
    }

    vector<int> c_sizes;
    for (auto& a : comps) {
        c_sizes.push_back(sz(a));
    }
    vector<pair<int, int>> c_edges;
    for (auto& [u, v] : edges) {
        if (u == centroid.cu || v == centroid.cu) {
            continue;
        }
        dbg(i_comp[u], i_comp[v]);
        c_edges.emplace_back(i_comp[u], i_comp[v]);
    }

    Solver1 s1(sz(comps), kv1, c_sizes, c_edges);

    if (!s1.found) {
        // assert(false);
        return vector<int>(n);
    }

    vector<int> arra;
    for (auto& a : s1.st) {
        arra.insert(arra.end(), begin(comps[a]), end(comps[a]));
    }
    return answer(arra, not_nodes(arra));
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 70 ms 17148 KB ok, correct split
8 Correct 73 ms 15876 KB ok, correct split
9 Correct 67 ms 16000 KB ok, correct split
10 Correct 64 ms 16800 KB ok, correct split
11 Correct 90 ms 16732 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 74 ms 17428 KB ok, correct split
5 Correct 64 ms 16416 KB ok, correct split
6 Correct 66 ms 16800 KB ok, correct split
7 Correct 65 ms 16200 KB ok, correct split
8 Correct 85 ms 19456 KB ok, correct split
9 Correct 64 ms 15188 KB ok, correct split
10 Correct 59 ms 22164 KB ok, correct split
11 Correct 55 ms 22136 KB ok, correct split
12 Correct 56 ms 22144 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 64 ms 15792 KB ok, correct split
3 Correct 25 ms 6548 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 66 ms 16036 KB ok, correct split
6 Correct 66 ms 16000 KB ok, correct split
7 Correct 65 ms 16124 KB ok, correct split
8 Correct 65 ms 16224 KB ok, correct split
9 Correct 69 ms 16016 KB ok, correct split
10 Correct 16 ms 4292 KB ok, no valid answer
11 Correct 24 ms 6256 KB ok, no valid answer
12 Correct 52 ms 15680 KB ok, no valid answer
13 Correct 48 ms 12772 KB ok, no valid answer
14 Correct 47 ms 18500 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 1 ms 212 KB ok, no valid answer
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 0 ms 212 KB ok, correct split
8 Correct 0 ms 212 KB ok, correct split
9 Correct 2 ms 596 KB ok, correct split
10 Correct 2 ms 724 KB ok, correct split
11 Correct 1 ms 212 KB ok, correct split
12 Correct 2 ms 852 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 0 ms 212 KB ok, correct split
16 Correct 1 ms 212 KB ok, correct split
17 Correct 1 ms 212 KB ok, correct split
18 Correct 1 ms 212 KB ok, correct split
19 Correct 1 ms 340 KB ok, correct split
20 Correct 1 ms 340 KB ok, correct split
21 Correct 2 ms 596 KB ok, correct split
22 Correct 2 ms 596 KB ok, correct split
23 Correct 2 ms 596 KB ok, correct split
24 Correct 2 ms 596 KB ok, correct split
25 Correct 2 ms 596 KB ok, correct split
26 Correct 2 ms 724 KB ok, correct split
27 Correct 2 ms 672 KB ok, correct split
28 Correct 3 ms 724 KB ok, correct split
29 Correct 1 ms 340 KB ok, correct split
30 Correct 2 ms 724 KB ok, correct split
31 Correct 1 ms 340 KB ok, correct split
32 Correct 1 ms 212 KB ok, correct split
33 Correct 1 ms 340 KB ok, correct split
34 Correct 2 ms 596 KB ok, correct split
35 Correct 2 ms 588 KB ok, correct split
36 Correct 2 ms 596 KB ok, correct split
37 Correct 3 ms 852 KB ok, correct split
38 Correct 3 ms 852 KB ok, correct split
39 Correct 3 ms 852 KB ok, correct split
40 Correct 3 ms 852 KB ok, correct split
41 Correct 2 ms 596 KB ok, correct split
42 Correct 2 ms 572 KB ok, correct split
43 Correct 2 ms 724 KB ok, correct split
44 Correct 4 ms 724 KB ok, correct split
45 Correct 2 ms 724 KB ok, correct split
46 Correct 2 ms 596 KB ok, correct split
47 Correct 1 ms 596 KB ok, no valid answer
48 Correct 2 ms 724 KB ok, correct split
49 Correct 2 ms 724 KB ok, correct split
50 Correct 1 ms 212 KB ok, no valid answer
51 Correct 1 ms 300 KB ok, no valid answer
52 Correct 2 ms 596 KB ok, no valid answer
53 Correct 2 ms 764 KB ok, no valid answer
54 Correct 2 ms 724 KB ok, no valid answer
55 Correct 2 ms 724 KB ok, no valid answer
56 Correct 2 ms 740 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 70 ms 17148 KB ok, correct split
8 Correct 73 ms 15876 KB ok, correct split
9 Correct 67 ms 16000 KB ok, correct split
10 Correct 64 ms 16800 KB ok, correct split
11 Correct 90 ms 16732 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 74 ms 17428 KB ok, correct split
16 Correct 64 ms 16416 KB ok, correct split
17 Correct 66 ms 16800 KB ok, correct split
18 Correct 65 ms 16200 KB ok, correct split
19 Correct 85 ms 19456 KB ok, correct split
20 Correct 64 ms 15188 KB ok, correct split
21 Correct 59 ms 22164 KB ok, correct split
22 Correct 55 ms 22136 KB ok, correct split
23 Correct 56 ms 22144 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 64 ms 15792 KB ok, correct split
26 Correct 25 ms 6548 KB ok, correct split
27 Correct 0 ms 212 KB ok, correct split
28 Correct 66 ms 16036 KB ok, correct split
29 Correct 66 ms 16000 KB ok, correct split
30 Correct 65 ms 16124 KB ok, correct split
31 Correct 65 ms 16224 KB ok, correct split
32 Correct 69 ms 16016 KB ok, correct split
33 Correct 16 ms 4292 KB ok, no valid answer
34 Correct 24 ms 6256 KB ok, no valid answer
35 Correct 52 ms 15680 KB ok, no valid answer
36 Correct 48 ms 12772 KB ok, no valid answer
37 Correct 47 ms 18500 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 1 ms 212 KB ok, no valid answer
40 Correct 0 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 1 ms 212 KB ok, correct split
43 Correct 0 ms 212 KB ok, correct split
44 Correct 0 ms 212 KB ok, correct split
45 Correct 0 ms 212 KB ok, correct split
46 Correct 2 ms 596 KB ok, correct split
47 Correct 2 ms 724 KB ok, correct split
48 Correct 1 ms 212 KB ok, correct split
49 Correct 2 ms 852 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 0 ms 212 KB ok, correct split
53 Correct 1 ms 212 KB ok, correct split
54 Correct 1 ms 212 KB ok, correct split
55 Correct 1 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 1 ms 340 KB ok, correct split
58 Correct 2 ms 596 KB ok, correct split
59 Correct 2 ms 596 KB ok, correct split
60 Correct 2 ms 596 KB ok, correct split
61 Correct 2 ms 596 KB ok, correct split
62 Correct 2 ms 596 KB ok, correct split
63 Correct 2 ms 724 KB ok, correct split
64 Correct 2 ms 672 KB ok, correct split
65 Correct 3 ms 724 KB ok, correct split
66 Correct 1 ms 340 KB ok, correct split
67 Correct 2 ms 724 KB ok, correct split
68 Correct 1 ms 340 KB ok, correct split
69 Correct 1 ms 212 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 2 ms 596 KB ok, correct split
72 Correct 2 ms 588 KB ok, correct split
73 Correct 2 ms 596 KB ok, correct split
74 Correct 3 ms 852 KB ok, correct split
75 Correct 3 ms 852 KB ok, correct split
76 Correct 3 ms 852 KB ok, correct split
77 Correct 3 ms 852 KB ok, correct split
78 Correct 2 ms 596 KB ok, correct split
79 Correct 2 ms 572 KB ok, correct split
80 Correct 2 ms 724 KB ok, correct split
81 Correct 4 ms 724 KB ok, correct split
82 Correct 2 ms 724 KB ok, correct split
83 Correct 2 ms 596 KB ok, correct split
84 Correct 1 ms 596 KB ok, no valid answer
85 Correct 2 ms 724 KB ok, correct split
86 Correct 2 ms 724 KB ok, correct split
87 Correct 1 ms 212 KB ok, no valid answer
88 Correct 1 ms 300 KB ok, no valid answer
89 Correct 2 ms 596 KB ok, no valid answer
90 Correct 2 ms 764 KB ok, no valid answer
91 Correct 2 ms 724 KB ok, no valid answer
92 Correct 2 ms 724 KB ok, no valid answer
93 Correct 2 ms 740 KB ok, no valid answer
94 Correct 70 ms 16896 KB ok, correct split
95 Correct 88 ms 21000 KB ok, correct split
96 Correct 85 ms 22572 KB ok, correct split
97 Correct 23 ms 7200 KB ok, correct split
98 Correct 24 ms 7240 KB ok, correct split
99 Correct 34 ms 8180 KB ok, correct split
100 Correct 94 ms 21628 KB ok, correct split
101 Correct 78 ms 20224 KB ok, correct split
102 Correct 90 ms 27680 KB ok, correct split
103 Correct 81 ms 27440 KB ok, correct split
104 Correct 77 ms 21732 KB ok, correct split
105 Correct 39 ms 9984 KB ok, correct split
106 Correct 71 ms 22424 KB ok, correct split
107 Correct 75 ms 15976 KB ok, correct split
108 Correct 69 ms 16136 KB ok, correct split
109 Correct 88 ms 19512 KB ok, correct split
110 Correct 100 ms 26608 KB ok, correct split
111 Correct 97 ms 26640 KB ok, correct split
112 Correct 98 ms 27380 KB ok, correct split
113 Correct 96 ms 27388 KB ok, correct split
114 Correct 10 ms 3028 KB ok, correct split
115 Correct 9 ms 2968 KB ok, correct split
116 Correct 84 ms 23252 KB ok, correct split
117 Correct 88 ms 22908 KB ok, correct split
118 Correct 68 ms 15776 KB ok, correct split
119 Correct 68 ms 19380 KB ok, correct split
120 Correct 69 ms 18796 KB ok, correct split
121 Correct 46 ms 12964 KB ok, no valid answer
122 Correct 46 ms 14496 KB ok, no valid answer
123 Correct 86 ms 18620 KB ok, no valid answer
124 Correct 66 ms 18460 KB ok, no valid answer
125 Correct 57 ms 20044 KB ok, no valid answer
126 Correct 42 ms 17692 KB ok, no valid answer
127 Correct 65 ms 20772 KB ok, no valid answer