Submission #503064

#	Time	Username	Problem	Language	Result	Execution time	Memory
503064		tabr	Training (IOI07_training)	C++17	82 / 100	348 ms	51180 KiB

training

#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

struct dsu {
    vector<int> p;
    vector<int> sz;
    int n;

    dsu(int _n) : n(_n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        sz.assign(n, 1);
    }

    inline int get(int x) {
        if (p[x] == x) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    inline bool unite(int x, int y) {
        x = get(x);
        y = get(y);
        if (x == y) {
            return false;
        }
        if (sz[x] > sz[y]) {
            swap(x, y);
        }
        p[x] = y;
        sz[y] += sz[x];
        return true;
    }

    inline bool same(int x, int y) {
        return (get(x) == get(y));
    }
};

vector<int> g[1010];
vector<int> d[1010];
vector<int> from[1030];
unordered_map<int, int> dp[1010];
int f[1030];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    dsu uf(2 * n);
    vector<tuple<int, int, int>> edges;
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        if (c == 0) {
            g[a].emplace_back(b);
            g[b].emplace_back(a);
            uf.unite(a, b + n);
            uf.unite(a + n, b);
        } else {
            edges.emplace_back(a, b, c);
        }
    }
    vector<tuple<int, int, int>> new_edges;
    int ans = 0;
    for (auto [a, b, c] : edges) {
        ans += c;
        if (uf.same(a, b)) {
            new_edges.emplace_back(a, b, c);
        }
    }
    swap(edges, new_edges);
    m = (int) edges.size();
    for (int i = 0; i < m; i++) {
        auto [a, b, c] = edges[i];
        d[a].emplace_back(i);
        d[b].emplace_back(i);
    }
    for (int i = 0; i < (1 << 10); i++) {
        for (int j = 0; j < 10; j++) {
            if (i & (1 << j)) {
                continue;
            }
            from[i | (1 << j)].emplace_back(1 << j);
            for (int k = j + 1; k < 10; k++) {
                if (i & (1 << k)) {
                    continue;
                }
                from[i | (1 << j) | (1 << k)].emplace_back((1 << j) | (1 << k));
            }
        }
    }
    function<void(int, int)> dfs = [&](int v, int p) {
        vector<int> ch;
        unordered_map<int, vector<int>> mp;
        for (int to : g[v]) {
            if (to == p) {
                continue;
            }
            dfs(to, v);
            for (auto [id, cost] : dp[to]) {
                if (id != -1) {
                    mp[id].emplace_back((int) ch.size());
                }
            }
            ch.emplace_back(to);
        }
        int sz = (int) ch.size();
        memset(f, 0, 4 << sz);
        for (int i = 0; i < sz; i++) {
            f[1 << i] = dp[ch[i]][-1];
        }
        for (auto [id, u] : mp) {
            if (u.size() == 2) {
                f[(1 << u[0]) + (1 << u[1])] = max(f[(1 << u[0]) + (1 << u[1])], dp[ch[u[0]]][id] + dp[ch[u[1]]][id] + get<2>(edges[id]));
            }
        }
        for (int id : d[v]) {
            auto u = mp[id];
            if (u.size() == 1) {
                f[1 << u[0]] = max(f[1 << u[0]], dp[ch[u[0]]][id] + get<2>(edges[id]));
                mp[id].emplace_back(-1);
            }
        }
        for (int i = 0; i < (1 << sz); i++) {
            for (int j : from[i]) {
                f[i] = max(f[i], f[j] + f[i ^ j]);
            }
        }
        dp[v][-1] = f[(1 << sz) - 1];
        for (int id : d[v]) {
            auto u = mp[id];
            if (u.size() == 0) {
                dp[v][id] = f[(1 << sz) - 1];
            }
        }
        for (auto [id, u] : mp) {
            if (u.size() == 1) {
                dp[v][id] = f[(1 << sz) - (1 << u[0]) - 1] + dp[ch[u[0]]][id];
            }
        }
    };
    dfs(0, -1);
    ans -= dp[0][-1];
    cout << ans << '\n';
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 7 / 7
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9