#410677 (C++14) No.957 植林

提出ソース

結果

問題	No.957 植林
ユーザー	fine
提出日時	2019-12-20 13:14:45
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	935 ms / 2,000 ms
コード長	8,680 bytes
コンパイル時間	1,743 ms
コンパイル使用メモリ	183,596 KB
実行使用メモリ	23,324 KB
最終ジャッジ日時	2024-07-08 07:20:58
合計ジャッジ時間	22,064 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	74 ms 19,848 KB
testcase_04	AC	58 ms 18,676 KB
testcase_05	AC	98 ms 20,572 KB
testcase_06	AC	55 ms 21,368 KB
testcase_07	AC	77 ms 19,308 KB
testcase_08	AC	45 ms 20,156 KB
testcase_09	AC	43 ms 20,156 KB
testcase_10	AC	45 ms 21,020 KB
testcase_11	AC	45 ms 20,328 KB
testcase_12	AC	45 ms 20,112 KB
testcase_13	AC	32 ms 18,392 KB
testcase_14	AC	42 ms 21,896 KB
testcase_15	AC	38 ms 19,940 KB
testcase_16	AC	34 ms 18,372 KB
testcase_17	AC	35 ms 19,144 KB
testcase_18	AC	538 ms 20,020 KB
testcase_19	AC	681 ms 20,420 KB
testcase_20	AC	548 ms 20,976 KB
testcase_21	AC	783 ms 21,380 KB
testcase_22	AC	559 ms 21,896 KB
testcase_23	AC	853 ms 22,216 KB
testcase_24	AC	726 ms 22,776 KB
testcase_25	AC	909 ms 23,196 KB
testcase_26	AC	924 ms 23,200 KB
testcase_27	AC	907 ms 23,320 KB
testcase_28	AC	903 ms 23,196 KB
testcase_29	AC	911 ms 23,192 KB
testcase_30	AC	922 ms 23,200 KB
testcase_31	AC	525 ms 20,148 KB
testcase_32	AC	696 ms 20,416 KB
testcase_33	AC	553 ms 20,976 KB
testcase_34	AC	767 ms 21,508 KB
testcase_35	AC	557 ms 21,676 KB
testcase_36	AC	841 ms 22,092 KB
testcase_37	AC	710 ms 22,772 KB
testcase_38	AC	916 ms 23,200 KB
testcase_39	AC	935 ms 23,324 KB
testcase_40	AC	886 ms 23,196 KB
testcase_41	AC	29 ms 23,120 KB
testcase_42	AC	29 ms 23,244 KB
testcase_43	AC	39 ms 23,264 KB
testcase_44	AC	38 ms 23,196 KB
testcase_45	AC	1 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	1 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

// 参考: https://kopricky.github.io/code/Academic/max_flow_push_relabel.html
class Stack {
private:
    const int N, H;
    vector<int> node;
public:
    Stack(const int _N, const int _H) : N(_N), H(_H), node(N+H){ clear(); }
    inline bool empty(const int h) const { return node[N+h] == N+h; }
    inline int top(const int h) const { return node[N+h]; }
    inline void pop(const int h){ node[N+h] = node[node[N+h]]; }
    inline void push(const int h, const int u){ node[u] = node[N+h], node[N+h] = u; }
    inline void clear(){ iota(node.begin() + N, node.end(), N); }
};
 
class List {
public:
    struct node {
        int prev, next;
    };
    const int N, H;
    vector<node> dat;
    List(const int _N, const int _H) : N(_N), H(_H), dat(N+H){ clear(); }
    inline bool empty(const int h) const { return (dat[N+h].next == N+h); }
    inline bool more_one(const int h) const { return dat[N+h].prev != dat[N+h].next; }
    inline void insert(const int h, const int u){
        dat[u].prev = dat[N+h].prev, dat[u].next = N+h;
        dat[dat[N+h].prev].next = u, dat[N+h].prev = u;
    }
    inline void erase(const int u){
        dat[dat[u].prev].next = dat[u].next, dat[dat[u].next].prev = dat[u].prev;
    }
    inline void clear(){
        for(int i = N; i < N+H; ++i) dat[i].prev = dat[i].next = i;
    }
};
 
template <typename T> class PushRelabel {
public:
    struct edge {
        const int to, rev;
        T cap;
        edge(const int _to, const int _rev, const T _cap) : to(_to), rev(_rev), cap(_cap){}
    };
private:
    const int V;
    int s, t, pot_max, checker;
    vector<T> excess;
    vector<int> potential, cur_edge, que;
    List all_ver;
    Stack act_ver;
    int calc_active(){
        pot_max = -1;
        for(int i = 0; i < V; ++i){
            if(potential[i] < V){
                cur_edge[i] = 0;
                pot_max = max(potential[i], pot_max);
                all_ver.insert(potential[i], i);
                if(excess[i] > 0 && i != t) act_ver.push(potential[i], i);
            }else{
                potential[i] = V+1;
            }
        }
        return pot_max;
    }
    void bfs(){
        for(int i = 0; i < V; ++i) potential[i] = max(potential[i], V);
        potential[t] = 0;
        int qh = 0, qt = 0;
        for(que[qt++] = t; qh++ < qt;){
            int u = que[qh - 1];
            for(const edge& e : G[u]){
                if(potential[e.to] == V && G[e.to][e.rev].cap > 0){
                    potential[e.to] = potential[u] + 1, que[qt++] = e.to;
                }
            }
        }
    }
    int init(){
        potential[s] = V + 1;
        bfs();
        for(edge& e : G[s]){
            if(potential[e.to] < V){
                G[e.to][e.rev].cap = e.cap, excess[s] -= e.cap, excess[e.to] += e.cap;
                e.cap = 0;
            }
        }
        return calc_active();
    }
    int global_relabel(){
        bfs();
        all_ver.clear(), act_ver.clear();
        return calc_active();
    }
    void gap_relabel(const int u){
        for(int i = potential[u]; i <= pot_max; ++i){
            for(int id = all_ver.dat[V+i].next; id < V; id = all_ver.dat[id].next){
                potential[id] = V + 1;
            }
            all_ver.dat[V+i].prev = all_ver.dat[V+i].next = V + i;
        }
    }
    int discharge(const int u){
        for(int& i = cur_edge[u]; i < (int)G[u].size(); ++i){
            edge& e = G[u][i];
            if(potential[u] == potential[e.to] + 1 && e.cap > 0){
                if(push(u, e)) return potential[u];
            }
        }
        return relabel(u);
    }
    bool push(const int u, edge& e){
        T f = min(e.cap, excess[u]);
        const int v = e.to;
        e.cap -= f, excess[u] -= f;
        G[v][e.rev].cap += f, excess[v] += f;
        if(excess[v] == f && v != t) act_ver.push(potential[v], v);
        return (excess[u] == 0);
    }
    int relabel(const int u){
        ++checker;
        int prv = potential[u], cur = V;
        for(int i = 0; i < (int)G[u].size(); ++i){
            const edge& e = G[u][i];
            if(cur > potential[e.to] + 1 && e.cap > 0){
                cur_edge[u] = i;
                cur = potential[e.to] + 1;
            }
        }
        if(all_ver.more_one(prv)){
            all_ver.erase(u);
            if((potential[u] = cur) == V) return potential[u] = V+1, prv;
            act_ver.push(cur, u);
            all_ver.insert(cur, u);
            pot_max = max(pot_max, cur);
        }else{
            gap_relabel(u);
            return pot_max = prv - 1;
        }
        return cur;
    }
    int validate_discharge(const int u){
        for(int& i = cur_edge[u]; i < (int)G[u].size(); ++i){
            edge& e = G[u][i];
            if(potential[u] == potential[e.to] + 1 && e.cap > 0){
                if(validate_push(u, e)) return potential[u] - V;
            }
        }
        return validate_relabel(u);
    }
    bool validate_push(const int u, edge& e){
        T f = min(e.cap, excess[u]);
        const int v = e.to;
        e.cap -= f, excess[u] -= f;
        G[v][e.rev].cap += f, excess[v] += f;
        if(excess[v] == f) act_ver.push(potential[v] - V, v);
        return (excess[u] == 0);
    }
    int validate_relabel(const int u){
        int cur = 2 * V;
        for(int i = 0; i < (int)G[u].size(); ++i){
            const edge& e = G[u][i];
            if(cur > potential[e.to] + 1 && e.cap > 0){
                cur_edge[u] = i;
                cur = potential[e.to] + 1;
            }
        }
        potential[u] = cur;
        act_ver.push(cur - V, u);
        return cur - V;
    }
    void validate(){
        for(int i = 0; i < V; ++i){
            if(potential[i] >= V){
                cur_edge[i] = 0, potential[i] = V;
                if(excess[i] > 0) act_ver.push(0, i);
            }
        }
        int level = 0;
        while(level >= 0){
            if(act_ver.empty(level)){
                --level;
                continue;
            }
            int u = act_ver.top(level);
            act_ver.pop(level);
            level = validate_discharge(u);
        }
    }
public:
    vector<vector<edge> > G;
    PushRelabel(const int node_size)
        : V(node_size), pot_max(-1), checker(0), excess(V, (T)0),
            potential(V, 0), cur_edge(V), que(V), all_ver(V, V), act_ver(V, V), G(V){}
    void add_edge(const int _from, const int _to, const T _cap){
        G[_from].emplace_back(_to, (int)G[_to].size(), _cap);
        G[_to].emplace_back(_from, (int)G[_from].size() - 1, 0);
    }
    T solve(const int source, const int sink){
        s = source, t = sink;
        int level = init();
        while(level >= 0){
            if(act_ver.empty(level)){
                --level;
                continue;
            }
            int u = act_ver.top(level);
            act_ver.pop(level);
            level = discharge(u);
            if(checker >= V / 2){
                level = global_relabel();
                checker = 0;
            }
        }
        // validate();
        return excess[t];
    }
};

constexpr ll INF = 1e18;


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int H, W;
    cin >> H >> W;

    PushRelabel<ll> d(H * W + H + W + 2);
    int src = H * W + H + W;
    int dst = src + 1;
    vector< vector<ll> > g(H, vector<ll>(W));
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            cin >> g[i][j];
        }
    }

    ll ans = 0;
    vector<int> used_h(H, false), used_w(W, false);
    for (int i = 0; i < H; ++i) {
        ll r;
        cin >> r;

        ll sum = 0;
        for (int j = 0; j < W; ++j) {
            sum += g[i][j];
        }
        if (r >= sum) {
            ans += r - sum;
            d.add_edge(src, H * W + i, r - sum);
        } else {
            d.add_edge(H * W + i, dst, sum - r);
        }
    }

    for (int j = 0; j < W; ++j) {
        ll c;
        cin >> c;

        ll sum = 0;
        for (int i = 0; i < H; ++i) {
            sum += g[i][j];
        }
        if (c >= sum) {
            ans += c - sum;
            used_w[j] = true;
            d.add_edge(src, H * W + H + j, c - sum);
        } else {
            d.add_edge(H * W + H + j, dst, sum - c);
        }
    }

    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            ans += g[i][j];
            d.add_edge(src, i * W + j, g[i][j]);
            d.add_edge(i * W + j, H * W + i, INF);
            d.add_edge(i * W + j, H * W + H + j, INF);
        }
    }    

    ans -= d.solve(src, dst);
    cout << ans << "\n";
    return 0;
}

yukicoder

結果

テストケース

ソースコード