結果

問題 No.957 植林
ユーザー muminmumin
提出日時 2021-03-01 04:54:40
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 352 ms / 2,000 ms
コード長 5,459 bytes
コンパイル時間 2,251 ms
コンパイル使用メモリ 174,940 KB
実行使用メモリ 9,028 KB
最終ジャッジ日時 2024-04-14 03:32:43
合計ジャッジ時間 11,545 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 21 ms
8,344 KB
testcase_04 AC 21 ms
8,232 KB
testcase_05 AC 23 ms
8,216 KB
testcase_06 AC 25 ms
8,572 KB
testcase_07 AC 23 ms
8,228 KB
testcase_08 AC 18 ms
8,304 KB
testcase_09 AC 18 ms
8,164 KB
testcase_10 AC 19 ms
8,472 KB
testcase_11 AC 18 ms
8,292 KB
testcase_12 AC 18 ms
8,416 KB
testcase_13 AC 16 ms
7,348 KB
testcase_14 AC 20 ms
8,808 KB
testcase_15 AC 18 ms
8,328 KB
testcase_16 AC 15 ms
7,476 KB
testcase_17 AC 17 ms
8,108 KB
testcase_18 AC 238 ms
8,196 KB
testcase_19 AC 252 ms
8,304 KB
testcase_20 AC 268 ms
8,492 KB
testcase_21 AC 276 ms
8,668 KB
testcase_22 AC 289 ms
8,544 KB
testcase_23 AC 311 ms
8,648 KB
testcase_24 AC 316 ms
8,904 KB
testcase_25 AC 332 ms
9,024 KB
testcase_26 AC 331 ms
9,024 KB
testcase_27 AC 334 ms
9,024 KB
testcase_28 AC 343 ms
9,028 KB
testcase_29 AC 348 ms
9,028 KB
testcase_30 AC 352 ms
9,028 KB
testcase_31 AC 242 ms
8,332 KB
testcase_32 AC 259 ms
8,436 KB
testcase_33 AC 272 ms
8,556 KB
testcase_34 AC 271 ms
8,544 KB
testcase_35 AC 286 ms
8,552 KB
testcase_36 AC 309 ms
8,780 KB
testcase_37 AC 314 ms
8,904 KB
testcase_38 AC 329 ms
9,024 KB
testcase_39 AC 329 ms
9,024 KB
testcase_40 AC 336 ms
8,920 KB
testcase_41 AC 16 ms
8,776 KB
testcase_42 AC 16 ms
8,768 KB
testcase_43 AC 25 ms
8,900 KB
testcase_44 AC 25 ms
8,776 KB
testcase_45 AC 2 ms
6,944 KB
testcase_46 AC 3 ms
6,944 KB
testcase_47 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<ld,ld>;

template <class T> struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

template <class Cap> struct mf_graph {
  public:
    mf_graph() : _n(0) {}
    mf_graph(int n) : _n(n), g(n) {}

    int add_edge(int from, int to, Cap cap) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        assert(0 <= cap);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        int from_id = int(g[from].size());
        int to_id = int(g[to].size());
        if (from == to) to_id++;
        g[from].push_back(_edge{to, to_id, cap});
        g[to].push_back(_edge{from, from_id, 0});
        return m;
    }

    struct edge {
        int from, to;
        Cap cap, flow;
    };

    edge get_edge(int i) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        auto _e = g[pos[i].first][pos[i].second];
        auto _re = g[_e.to][_e.rev];
        return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result;
        for (int i = 0; i < m; i++) {
            result.push_back(get_edge(i));
        }
        return result;
    }
    void change_edge(int i, Cap new_cap, Cap new_flow) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        assert(0 <= new_flow && new_flow <= new_cap);
        auto& _e = g[pos[i].first][pos[i].second];
        auto& _re = g[_e.to][_e.rev];
        _e.cap = new_cap - new_flow;
        _re.cap = new_flow;
    }

    Cap flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    Cap flow(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);

        std::vector<int> level(_n), iter(_n);
        simple_queue<int> que;

        auto bfs = [&]() {
            std::fill(level.begin(), level.end(), -1);
            level[s] = 0;
            que.clear();
            que.push(s);
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (auto e : g[v]) {
                    if (e.cap == 0 || level[e.to] >= 0) continue;
                    level[e.to] = level[v] + 1;
                    if (e.to == t) return;
                    que.push(e.to);
                }
            }
        };
        auto dfs = [&](auto self, int v, Cap up) {
            if (v == s) return up;
            Cap res = 0;
            int level_v = level[v];
            for (int& i = iter[v]; i < int(g[v].size()); i++) {
                _edge& e = g[v][i];
                if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;
                Cap d =
                    self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
                if (d <= 0) continue;
                g[v][i].cap += d;
                g[e.to][e.rev].cap -= d;
                res += d;
                if (res == up) return res;
            }
            level[v] = _n;
            return res;
        };

        Cap flow = 0;
        while (flow < flow_limit) {
            bfs();
            if (level[t] == -1) break;
            std::fill(iter.begin(), iter.end(), 0);
            Cap f = dfs(dfs, t, flow_limit - flow);
            if (!f) break;
            flow += f;
        }
        return flow;
    }

    std::vector<bool> min_cut(int s) {
        std::vector<bool> visited(_n);
        simple_queue<int> que;
        que.push(s);
        while (!que.empty()) {
            int p = que.front();
            que.pop();
            visited[p] = true;
            for (auto e : g[p]) {
                if (e.cap && !visited[e.to]) {
                    visited[e.to] = true;
                    que.push(e.to);
                }
            }
        }
        return visited;
    }

  private:
    int _n;
    struct _edge {
        int to, rev;
        Cap cap;
    };
    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

const ll INF = 1LL<<60;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int h, w;
    cin >> h >> w;
    int s = h+w, t = h+w+1;
    mf_graph<ll> g(t+1);
    rep(i,h){
        ll sum = 0;
        rep(j,w){
            int a;
            cin >> a;
            sum += a;
            g.add_edge(i,h+j,a);
        }
        g.add_edge(s,i,sum);
    }
    ll ans = 0;
    rep(i,h){
        int r;
        cin >> r;
        ans += r;
        g.add_edge(i,t,r);
    }
    rep(i,w){
        int c;
        cin >> c;
        ans += c;
        g.add_edge(h+i,t,c);
    }
    cout << ans-g.flow(s,t) << endl;
}
0