提出 #18766604

---

ソースコード 拡げる

#include <atcoder/mincostflow>
#include <iostream>

using namespace std;
using namespace atcoder;

const long long BIG = 1'000'000'000;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;

    mcf_graph<int, long long> g(1 + n + 4 + n + 1);
    int sv = 0, le_st = 1, mid_st = 1 + n, ri_st = 1 + n + 4, tv = 1 + n + 4 + n;

    long long base = 0;
    const long long OFF = 2 * BIG;

    for (int i = 0; i < n; i++) {
        long long x, y;
        int z;
        cin >> x >> y >> z;

        base += z * OFF;
        g.add_edge(sv, le_st + i, z, 0);
        g.add_edge(le_st + i, mid_st + 0, z, OFF + x + y);
        g.add_edge(le_st + i, mid_st + 1, z, OFF + x - y);
        g.add_edge(le_st + i, mid_st + 2, z, OFF - x + y);
        g.add_edge(le_st + i, mid_st + 3, z, OFF - x - y);
    }

    for (int i = 0; i < n; i++) {
        long long x, y;
        int z;
        cin >> x >> y >> z;

        base += z * OFF;
        g.add_edge(mid_st + 0, ri_st + i, z, OFF - x - y);
        g.add_edge(mid_st + 1, ri_st + i, z, OFF - x + y);
        g.add_edge(mid_st + 2, ri_st + i, z, OFF + x - y);
        g.add_edge(mid_st + 3, ri_st + i, z, OFF + x + y);
        g.add_edge(ri_st + i, tv, z, 0);
    }

    cout << base - g.flow(sv, tv).second << endl;
    return 0;
}

提出情報

ジャッジ結果