제출 #1189266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189266		juliany2	통행료 (APIO13_toll)	C++20	100 / 100	672 ms	6336 KiB

toll

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()

struct DSU {
    vector<int> e;
    DSU(int sz) { e = vector<int>(sz + 1, -1); }

    int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

    bool same_set(int a, int b) { return get(a) == get(b); }

    int size(int x) { return -e[get(x)]; }

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

const int N = 1e5 + 7, K = 22;
int n, m, k;
array<int, 2> f[N];
int p[N], head[N];
ll sz[K];

vector<array<int, 3>> rem;
vector<array<int, 2>> adj[K];
int mask[K];
ll cnt[K];
ll res = 0;

void dfs(int v = 0, int p = -1) {
    for (auto &[u, w] : adj[v]) {
        if (u == p)
            continue;

        dfs(u, v);

        if (w == -1) {
            res += cnt[u] * rem[__builtin_ctz(mask[u])][2];
        }

        mask[v] ^= mask[u];
        cnt[v] += cnt[u];
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(false);

    cin >> n >> m >> k;

    vector<array<int, 3>> e(m);
    for (auto &[w, u, v] : e)
        cin >> u >> v >> w;

    for (int i = 0; i < k; i++)
        cin >> f[i][0] >> f[i][1];

    for (int i = 1; i <= n; i++)
        cin >> p[i];

    sort(all(e));

    DSU dsu(n + 1);

    vector<bool> mst(m);

    for (int i = 0; i < m; i++) {
        auto &[w, u, v] = e[i];

        mst[i] = dsu.unite(u, v);
    }

    dsu = DSU(n + 1);
    for (int i = 0; i < k; i++)
        dsu.unite(f[i][0], f[i][1]);

    vector<array<int, 2>> keep;
    for (int i = 0; i < m; i++) {
        auto &[w, u, v] = e[i];

        if (dsu.unite(u, v))
            keep.push_back({u, v});
        else if (mst[i])
            rem.push_back({u, v, w});
    }

    dsu = DSU(n + 1);
    for (auto &[u, v] : keep)
        dsu.unite(u, v);

    memset(head, -1, sizeof(head));

    int groupcnt = 0;
    for (int i = 1; i <= n; i++) {
        if (head[dsu.get(i)] == -1)
            head[dsu.get(i)] = groupcnt++;

        if (head[i] == -1)
            head[i] = head[dsu.get(i)];
    }

    for (int i = 1; i <= n; i++) {
        sz[head[i]] += p[i];
    }

    for (int i = 0; i < k; i++) {
        auto &[u, v] = f[i];
        u = head[u], v = head[v];
    }

    for (auto &[u, v, w] : rem) {
        u = head[u], v = head[v];
    }

    ll ans = 0;
    for (int msk = 1; msk < (1 << k); msk++) {
        DSU g(k + 1);
        bool ok = 1;

        for (int i = 0; i <= k; i++) {
            adj[i].clear();
            mask[i] = 0;
            cnt[i] = sz[i];
        }

        for (int i = 0; i < k; i++) {
            if (msk >> i & 1) {
                auto &[u, v] = f[i];

                if (!g.unite(u, v)) {
                    ok = 0;
                    break;
                }

                adj[u].push_back({v, -1});
                adj[v].push_back({u, -1});
            }
        }

        if (ok) {
            for (int i = 0; i < rem.size(); i++) {
                auto &[u, v, w] = rem[i];

                if (g.unite(u, v)) {
                    adj[u].push_back({v, 0});
                    adj[v].push_back({u, 0});
                } else {
                    mask[u] |= 1 << i;
                    mask[v] |= 1 << i;
                }
            }

            res = 0;
            dfs();
            ans = max(ans, res);
        }
    }

    cout << ans << '\n';

    return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 22 / 22
• Subtask 5: 22 / 22