結果

問題 No.957 植林
ユーザー heno239heno239
提出日時 2023-06-03 13:56:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 579 ms / 2,000 ms
コード長 8,354 bytes
コンパイル時間 2,349 ms
コンパイル使用メモリ 164,468 KB
実行使用メモリ 18,944 KB
最終ジャッジ日時 2024-06-09 03:32:42
合計ジャッジ時間 16,451 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
11,648 KB
testcase_01 AC 8 ms
11,648 KB
testcase_02 AC 10 ms
11,648 KB
testcase_03 AC 31 ms
17,612 KB
testcase_04 AC 29 ms
17,476 KB
testcase_05 AC 29 ms
17,480 KB
testcase_06 AC 35 ms
18,176 KB
testcase_07 AC 32 ms
17,612 KB
testcase_08 AC 24 ms
18,120 KB
testcase_09 AC 25 ms
18,048 KB
testcase_10 AC 26 ms
18,376 KB
testcase_11 AC 26 ms
18,124 KB
testcase_12 AC 25 ms
17,792 KB
testcase_13 AC 21 ms
16,128 KB
testcase_14 AC 25 ms
18,244 KB
testcase_15 AC 24 ms
17,864 KB
testcase_16 AC 24 ms
16,072 KB
testcase_17 AC 22 ms
17,732 KB
testcase_18 AC 427 ms
18,048 KB
testcase_19 AC 451 ms
17,988 KB
testcase_20 AC 452 ms
18,120 KB
testcase_21 AC 479 ms
18,376 KB
testcase_22 AC 513 ms
18,304 KB
testcase_23 AC 519 ms
18,632 KB
testcase_24 AC 525 ms
18,688 KB
testcase_25 AC 579 ms
18,944 KB
testcase_26 AC 571 ms
18,888 KB
testcase_27 AC 572 ms
18,816 KB
testcase_28 AC 575 ms
18,816 KB
testcase_29 AC 573 ms
18,888 KB
testcase_30 AC 574 ms
18,888 KB
testcase_31 AC 422 ms
18,048 KB
testcase_32 AC 443 ms
17,992 KB
testcase_33 AC 461 ms
18,176 KB
testcase_34 AC 481 ms
18,380 KB
testcase_35 AC 511 ms
18,432 KB
testcase_36 AC 511 ms
18,432 KB
testcase_37 AC 528 ms
18,688 KB
testcase_38 AC 570 ms
18,888 KB
testcase_39 AC 566 ms
18,816 KB
testcase_40 AC 574 ms
18,892 KB
testcase_41 AC 23 ms
18,888 KB
testcase_42 AC 22 ms
18,816 KB
testcase_43 AC 29 ms
18,892 KB
testcase_44 AC 29 ms
18,760 KB
testcase_45 AC 9 ms
11,776 KB
testcase_46 AC 9 ms
11,720 KB
testcase_47 AC 9 ms
11,648 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------


struct edge { int to; ll cap; int rev; };
struct Dinic {
private:
    int n;
    vector<vector<edge>> v;
    vector<int> dist, iter;
public:
    Dinic(int sz) :n(sz), v(sz), dist(sz), iter(sz) {}

    void addedge(int from, int to, ll cap) {
        int x = v[to].size(), y = v[from].size();
        v[from].push_back({ to,cap,x });
        v[to].push_back({ from,0,y });
    }

    void bfs(int s) {
        fill(dist.begin(), dist.end(), -1);
        queue<int> q;
        dist[s] = 0;
        q.push(s);
        while (q.size()) {
            int x = q.front(); q.pop();
            rep(i, v[x].size()) {
                edge& e = v[x][i];
                if (e.cap > 0 && dist[e.to] < 0) {
                    dist[e.to] = dist[x] + 1;
                    q.push(e.to);
                }
            }
        }
    }

    ll dfs(int x, int t, ll f) {
        if (x == t)return f;
        for (int& i = iter[x]; i < (int)v[x].size(); ++i) {
            edge& e = v[x][i];
            if (e.cap > 0 && dist[x] < dist[e.to]) {
                ll d = dfs(e.to, t, min(f, e.cap));
                if (d > 0) {
                    e.cap -= d;
                    v[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }

    ll max_flow(int s, int t) {
        ll flow = 0;
        while (1) {
            bfs(s);
            if (dist[t] < 0)return flow;
            fill(iter.begin(), iter.end(), 0);
            ll f;
            while ((f = dfs(s, t, 1LL << 62)) > 0)flow += f;
        }
    }
};

void solve() {
    int h, w; cin >> h >> w;
    vector<vector<int>> g(h, vector<int>(w));
    rep(i, h)rep(j, w)cin >> g[i][j];
    vector<int> a(h), b(w);
    rep(i, h)cin >> a[i];
    rep(j, w)cin >> b[j];
    int sta = h + w;
    int goa = sta + 1;
    Dinic dc(goa + 1);
    ll ans = 0;
    rep(i, h) {
        ll sum = -a[i];
        rep(j, w)sum += g[i][j];
        if (sum >= 0) {
            dc.addedge(sta, i, sum);
        }
        else {
            ans -= sum;
            dc.addedge(i, goa, -sum);
        }
    }
    rep(j, w) {
        ans += b[j];
        dc.addedge(j + h, goa, b[j]);
    }
    rep(i, h)rep(j, w) {
        dc.addedge(i, j + h, g[i][j]);
    }
    ans -= dc.max_flow(sta, goa);
    cout << ans << "\n";
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0