제출 #965082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965082		Pannda	자매 도시 (APIO20_swap)	C++17	0 / 100	1012 ms	384220 KiB

swap

#include "swap.h"

#include <bits/stdc++.h>
using namespace std;

const int B = 400;

struct DSU {
    vector<int> f;
    vector<int> siz;
    vector<int> deg;
    vector<bool> ok;

    DSU() {}
    DSU(int n) : f(n), siz(n, 1), deg(n, 0), ok(n, false) { iota(f.begin(), f.end(), 0); }

    int leader(int u) {
        while (u != f[u]) u = f[u] = f[f[u]];
        return u;
    }

    bool unionize(int u0, int v0) {
        int u = leader(u0);
        int v = leader(v0);
        if (u == v) {
            ok[u] = true;
            return false;
        }
        if (siz[u] > siz[v]) swap(u, v);
        siz[v] += siz[u];
        if (++deg[u0] >= 3 || ++deg[v0] >= 3) ok[v] = true;
        ok[v] = ok[v] | ok[u];
        f[u] = v;
        return true;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }
};

struct LiteDSU {
    vector<int> f;
    vector<int> siz;
    vector<bool> ok;

    LiteDSU(int n) : f(n), siz(n, 1), ok(n, false) { iota(f.begin(), f.end(), 0); }

    int leader(int u) {
        while (u != f[u]) u = f[u] = f[f[u]];
        return u;
    }

    bool unionize(int u, int v) {
        u = leader(u);
        v = leader(v);
        if (u == v) return false;
        if (siz[u] > siz[v]) swap(u, v);
        siz[v] += siz[u];
        ok[v] = ok[v] | ok[u];
        f[u] = v;
        return true;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }
};

int n, m;
vector<array<int, 3>> edges;
DSU dsu;
vector<int> mp;

struct Block {
    int c;
    vector<int> dom;
    vector<array<int, 3>> edom;
    vector<int> imp;

    vector<int> f;
    vector<int> deg;
    vector<bool> ok;

    int leader(int u) {
        while (u != f[u]) u = f[u] = f[f[u]];
        return u;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }

    Block(int b, DSU &dsu0, DSU &dsu1) {
        f = dsu0.f;
        deg = dsu0.deg;
        ok = dsu0.ok;
        map<int, int> mp;
        int label = 0;
        for (int i = B * b; i < min(m, B * b + B); i++) {
            int u = dsu0.leader(edges[i][0]);
            int v = dsu0.leader(edges[i][1]);
            if (!mp.count(u)) mp[u] = label++, dom.push_back(u), imp.push_back(edges[i][0]);
            if (!mp.count(v)) mp[v] = label++, dom.push_back(v), imp.push_back(edges[i][1]);
        }
        set<array<int, 2>> s;
        for (int i = B * b; i < min(m, B * b + B); i++) {
            int u = mp[dsu0.leader(edges[i][0])];
            int v = mp[dsu0.leader(edges[i][1])];
            if (s.count({u, v})) continue;
            s.insert({u, v});
            edom.push_back({u, v, edges[i][2]});
        }
        c = dom.size();
    }
};

vector<Block> blocks;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    edges.resize(m);
    for (int i = 0; i < m; i++) {
        edges[i] = {U[i], V[i], W[i]};
    }
    sort(edges.begin(), edges.end(), [&](array<int, 3> e0, array<int, 3> e1) { return e0[2] < e1[2]; });

    dsu = DSU(n);
    for (int b = 0; B * b < m; b++) {
        DSU next_dsu = dsu;
        for (int i = B * b; i < min(m, B * b + B); i++) {
            next_dsu.unionize(edges[i][0], edges[i][1]);
        }
        blocks.push_back(Block(b, dsu, next_dsu));
        dsu = next_dsu;
    }
    blocks.emplace_back(100000, dsu, dsu);
    mp.resize(n, -1);
}

int getMinimumFuelCapacity(int X, int Y) {
    if (!dsu.same(X, Y) || !dsu.isOk(X)) return -1;

    int b = [&]() -> int {
        int l = 0, r = (int)blocks.size() - 1;
        while (l < r) {
            int m = (l + r + 1) >> 1;
            if (!blocks[m].same(X, Y) || !blocks[m].isOk(X)) {
                l = m;
            } else {
                r = m - 1;
            }
        }
        return l;
    }();

    int label = 0;
    for (int u : blocks[b].dom) mp[u] = label++;
    int x = mp[blocks[b].leader(X)];
    int y = mp[blocks[b].leader(Y)];
    int res = -2;
    vector<int> defer;
    LiteDSU dsu(blocks[b].c);
    for (int u : blocks[b].dom) if (blocks[b].isOk(u)) dsu.ok[mp[u]] = true;

    for (auto [u, v, w] : blocks[b].edom) {
        if (dsu.same(u, v)) {
            dsu.ok[dsu.leader(u)] = true;
        } else {
            defer.push_back(blocks[b].imp[u]);
            defer.push_back(blocks[b].imp[v]);
            if (++blocks[b].imp[u] >= 3) dsu.ok[dsu.leader(u)] = true;
            if (++blocks[b].imp[v] >= 3) dsu.ok[dsu.leader(v)] = true;
            dsu.unionize(u, v);
        }
        if (dsu.same(x, y) && dsu.isOk(x)) {
            res = w;
            break;
        }
    }
    for (int u : defer) blocks[b].deg[u]--;
    for (int u : blocks[b].dom) mp[u] = -1;
    return res;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27