結果

問題 No.957 植林
ユーザー PachicobuePachicobue
提出日時 2019-12-20 04:50:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 68 ms / 2,000 ms
コード長 12,285 bytes
コンパイル時間 2,595 ms
コンパイル使用メモリ 220,560 KB
実行使用メモリ 9,088 KB
最終ジャッジ日時 2024-07-07 06:49:31
合計ジャッジ時間 5,366 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 18 ms
8,320 KB
testcase_04 AC 18 ms
8,064 KB
testcase_05 AC 18 ms
8,448 KB
testcase_06 AC 21 ms
8,704 KB
testcase_07 AC 18 ms
8,192 KB
testcase_08 AC 14 ms
8,320 KB
testcase_09 AC 13 ms
8,320 KB
testcase_10 AC 13 ms
8,576 KB
testcase_11 AC 13 ms
8,448 KB
testcase_12 AC 12 ms
8,448 KB
testcase_13 AC 11 ms
7,040 KB
testcase_14 AC 13 ms
8,704 KB
testcase_15 AC 12 ms
8,448 KB
testcase_16 AC 11 ms
6,912 KB
testcase_17 AC 12 ms
8,192 KB
testcase_18 AC 54 ms
8,320 KB
testcase_19 AC 57 ms
8,320 KB
testcase_20 AC 57 ms
8,704 KB
testcase_21 AC 60 ms
8,576 KB
testcase_22 AC 62 ms
8,704 KB
testcase_23 AC 64 ms
8,704 KB
testcase_24 AC 64 ms
8,704 KB
testcase_25 AC 68 ms
9,088 KB
testcase_26 AC 67 ms
9,088 KB
testcase_27 AC 65 ms
8,960 KB
testcase_28 AC 66 ms
8,960 KB
testcase_29 AC 67 ms
8,960 KB
testcase_30 AC 66 ms
8,832 KB
testcase_31 AC 54 ms
8,320 KB
testcase_32 AC 58 ms
8,448 KB
testcase_33 AC 58 ms
8,576 KB
testcase_34 AC 61 ms
8,448 KB
testcase_35 AC 62 ms
8,704 KB
testcase_36 AC 65 ms
8,832 KB
testcase_37 AC 65 ms
8,832 KB
testcase_38 AC 68 ms
8,960 KB
testcase_39 AC 68 ms
8,960 KB
testcase_40 AC 67 ms
8,960 KB
testcase_41 AC 11 ms
8,832 KB
testcase_42 AC 10 ms
8,832 KB
testcase_43 AC 16 ms
8,960 KB
testcase_44 AC 17 ms
8,960 KB
testcase_45 AC 2 ms
5,376 KB
testcase_46 AC 2 ms
5,376 KB
testcase_47 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2019/12/20] 02:30:02
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
using namespace std;
class Stack
{
private:
    const int N, H;
    int sz;
    vector<int> node;

public:
    Stack(const int _N, const int _H) : N(_N), H(_H), node(N + H) { clear(); }
    inline bool empty() const { return (sz == 0); }
    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) { --sz, node[N + h] = node[node[N + h]]; }
    inline void push(const int h, const int u) { ++sz, node[u] = node[N + h], node[N + h] = u; }
    inline void clear() { sz = 0, 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, logU, pot_max, level, checker;
    T U;
    vector<T> excess;
    vector<int> potential, cur_edge, que;
    List all_ver;
    Stack act_ver;
    int calc_active(const T K)
    {
        pot_max     = -1;
        int act_min = V;
        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] >= K && i != t) {
                    act_ver.push(potential[i], i);
                    act_min = min(act_min, potential[i]);
                }
            } else {
                potential[i] = V + 1;
            }
        }
        return act_min;
    }
    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;
                }
            }
        }
    }
    void init()
    {
        potential[s] = V + 1;
        for (edge& e : G[s]) {
            if (potential[e.to] < V && e.cap > 0) {
                U = max(U, e.cap), logU = max(logU, (int)ceil(log2(e.cap)));
                G[e.to][e.rev].cap = e.cap, excess[s] -= e.cap, excess[e.to] += e.cap;
                e.cap              = 0;
            }
        }
    }
    int global_relabel(const T K)
    {
        bfs();
        all_ver.clear(), act_ver.clear();
        return calc_active(K);
    }
    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;
                if (id == all_ver.dat[id].next) { break; }
            }
            all_ver.dat[V + i].prev = all_ver.dat[V + i].next = V + i;
        }
    }
    void discharge(const int u, const T K)
    {
        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, K)) return;
            }
        }
        relabel(u);
    }
    bool push(const int u, edge& e, const T K)
    {
        T f         = min(e.cap, K);
        const int v = e.to;
        e.cap -= f, excess[u] -= f;
        G[v][e.rev].cap += f, excess[v] += f;
        if (excess[v] >= K && excess[v] < K + f && v != t) {
            act_ver.push(potential[v], v), level = min(level, potential[v]);
        }
        return (excess[u] < K);
    }
    void 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;
            act_ver.push(cur, u);
            all_ver.insert(cur, u);
            pot_max = max(pot_max, cur);
        } else {
            gap_relabel(u);
        }
    }

public:
    vector<vector<edge>> G;
    PushRelabel(const int node_size)
        : V(node_size), logU(0), 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;
        init();
        for (int i = logU - (U < ((T)1 << logU)); i >= 0; --i) {
            T K   = (T)1 << i;
            level = calc_active(K);
            while (!act_ver.empty() && level <= pot_max) {
                if (act_ver.empty(level)) {
                    ++level;
                    continue;
                }
                int u = act_ver.top(level);
                act_ver.pop(level);
                if (potential[u] >= V) continue;
                discharge(u, K);
                if (checker >= V / 2) {
                    level   = global_relabel(K);
                    checker = 0;
                }
            }
        }
        return excess[t];
    }
};
int main()
{
    const auto [H, W] = in_t<int, int>();
    const auto G      = in_v<ll>({H, W});
    const auto R      = in_v<ll>({H});
    const auto C      = in_v<ll>({W});
    std::vector<ll> GS(H, 0LL);
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) { GS[i] += G[i][j]; }
    }
    ll ans = 0;
    auto A = R;
    for (int i = 0; i < H; i++) {
        chmin(A[i], GS[i]);
        ans += R[i] - A[i];
    }
    for (int j = 0; j < W; j++) { ans += C[j]; }
    PushRelabel<ll> f(H + W + 2);
    const int S = H + W;
    const int T = H + W + 1;
    for (int i = 0; i < H; i++) { f.add_edge(S, i, GS[i] - A[i]); }
    for (int j = 0; j < W; j++) { f.add_edge(H + j, T, C[j]); }
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) { f.add_edge(i, H + j, G[i][j]); }
    }
    outln(ans - f.solve(S, T));
    return 0;
}
0