結果

問題 No.957 植林
ユーザー PachicobuePachicobue
提出日時 2019-12-20 00:16:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 8,748 bytes
コンパイル時間 2,276 ms
コンパイル使用メモリ 217,596 KB
実行使用メモリ 30,276 KB
最終ジャッジ日時 2024-07-07 02:15:08
合計ジャッジ時間 10,423 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
12,192 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 683 ms
21,836 KB
testcase_04 AC 571 ms
20,832 KB
testcase_05 AC 354 ms
22,724 KB
testcase_06 AC 694 ms
24,220 KB
testcase_07 AC 689 ms
21,576 KB
testcase_08 AC 137 ms
15,944 KB
testcase_09 AC 139 ms
16,284 KB
testcase_10 AC 160 ms
16,492 KB
testcase_11 AC 177 ms
17,252 KB
testcase_12 AC 173 ms
17,780 KB
testcase_13 AC 94 ms
14,060 KB
testcase_14 AC 112 ms
15,728 KB
testcase_15 AC 98 ms
14,572 KB
testcase_16 AC 88 ms
14,196 KB
testcase_17 AC 87 ms
15,092 KB
testcase_18 TLE -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2019/12/19] 21:42:53
// 何かの間違いで通ってくれ
#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); }
template<typename T> class Dinic
{
private:
    static_assert(std::is_integral<T>::value, "Integral required.");
    struct edge
    {
        int to;
        T cap;
        int rev;
    };
    const int V;
    std::vector<int> level, iter, que;
    static unsigned long long floor2(unsigned long long v)
    {
        v = v | (v >> 1), v = v | (v >> 2);
        v = v | (v >> 4), v = v | (v >> 8);
        v = v | (v >> 16), v = v | (v >> 32);
        return v - (v >> 1);
    }
    void bfs(const int s, const T base)
    {
        fill(level.begin(), level.end(), -1);
        level[s] = 0;
        int qh = 0, qt = 0;
        for (que[qt++] = s; qh < qt;) {
            int v = que[qh++];
            for (edge& e : G[v]) {
                if (level[e.to] < 0 && e.cap >= base) {
                    level[e.to] = level[v] + 1;
                    que[qt++]   = e.to;
                }
            }
        }
    }
    T dfs(const int v, const int t, const T base, const T f)
    {
        if (v == t) return f;
        T sum = 0;
        for (int& i = iter[v]; i < (int)G[v].size(); i++) {
            edge& e = G[v][i];
            if (e.cap >= base && level[v] < level[e.to]) {
                T d = dfs(e.to, t, base, std::min(f - sum, e.cap));
                if (d > 0) {
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    sum += d;
                    if (f - sum < base) break;
                }
            }
        }
        return sum;
    }

public:
    std::vector<std::vector<edge>> G;

    Dinic(const int node_size) : V(node_size), level(V), iter(V), que(V), G(V) {}
    //辺を張る
    void add_edge(const int from, const int to, const T cap)
    {
        G[from].push_back((edge){to, cap, (int)G[to].size()});
        G[to].push_back((edge){from, (T)0, (int)G[from].size() - 1});
    }
    //最大流を計算(max_cap は辺の容量の上限)
    T solve(const int s, const int t, const T max_cap)
    {
        T flow = 0;
        for (T base = floor2(max_cap); base >= 1;) {
            bfs(s, base);
            if (level[t] < 0) {
                base >>= 1;
                continue;
            }
            fill(iter.begin(), iter.end(), 0);
            flow += dfs(s, t, base, std::numeric_limits<T>::max());
        }
        return flow;
    }
};
int main()
{
    const auto [H, W] = in_t<int, int>();
    const auto G      = in_v<ll>({H, W});
    auto R            = in_v<ll>({H});
    auto C            = in_v<ll>({W});
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            R[i] -= G[i][j];
            C[j] -= G[i][j];
        }
    }
    constexpr ll inf = TEN(9);
    Dinic<ll> f(H * W + H + W + 2);
    const int S = H * W + H + W;
    const int T = H * W + H + W + 1;
    ll ans      = 0;
    for (int i = 0; i < H; i++) {
        if (R[i] <= 0) {
            f.add_edge(i, T, -R[i]);
        } else {
            ans += R[i];
            f.add_edge(S, i, R[i]);
        }
    }
    for (int j = 0; j < W; j++) {
        if (C[j] <= 0) {
            f.add_edge(H + j, T, -C[j]);
        } else {
            ans += C[j];
            f.add_edge(S, H + j, C[j]);
        }
    }
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            const int v = i * W + j + H + W;
            ans += G[i][j];
            if (R[i] <= 0) { f.add_edge(v, i, inf); }
            if (C[j] <= 0) { f.add_edge(v, H + j, inf); }
            f.add_edge(S, v, G[i][j]);
        }
    }
    outln(ans - f.solve(S, T, inf));
    return 0;
}
0