結果
問題 | No.957 植林 |
ユーザー | hitonanode |
提出日時 | 2021-08-26 23:19:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 191 ms / 2,000 ms |
コード長 | 5,697 bytes |
コンパイル時間 | 1,183 ms |
コンパイル使用メモリ | 96,520 KB |
実行使用メモリ | 9,280 KB |
最終ジャッジ日時 | 2024-11-18 21:58:03 |
合計ジャッジ時間 | 7,229 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 55 ms
8,516 KB |
testcase_04 | AC | 60 ms
8,264 KB |
testcase_05 | AC | 63 ms
8,648 KB |
testcase_06 | AC | 71 ms
8,768 KB |
testcase_07 | AC | 58 ms
8,532 KB |
testcase_08 | AC | 22 ms
8,480 KB |
testcase_09 | AC | 20 ms
8,476 KB |
testcase_10 | AC | 23 ms
8,728 KB |
testcase_11 | AC | 23 ms
8,732 KB |
testcase_12 | AC | 22 ms
8,448 KB |
testcase_13 | AC | 16 ms
7,752 KB |
testcase_14 | AC | 20 ms
9,020 KB |
testcase_15 | AC | 18 ms
8,636 KB |
testcase_16 | AC | 16 ms
7,616 KB |
testcase_17 | AC | 16 ms
8,260 KB |
testcase_18 | AC | 139 ms
8,752 KB |
testcase_19 | AC | 142 ms
8,744 KB |
testcase_20 | AC | 148 ms
8,744 KB |
testcase_21 | AC | 157 ms
8,884 KB |
testcase_22 | AC | 163 ms
9,000 KB |
testcase_23 | AC | 169 ms
9,140 KB |
testcase_24 | AC | 175 ms
9,012 KB |
testcase_25 | AC | 177 ms
9,276 KB |
testcase_26 | AC | 180 ms
9,280 KB |
testcase_27 | AC | 187 ms
9,148 KB |
testcase_28 | AC | 186 ms
9,152 KB |
testcase_29 | AC | 185 ms
9,276 KB |
testcase_30 | AC | 184 ms
9,272 KB |
testcase_31 | AC | 142 ms
8,492 KB |
testcase_32 | AC | 146 ms
8,616 KB |
testcase_33 | AC | 151 ms
8,616 KB |
testcase_34 | AC | 159 ms
8,884 KB |
testcase_35 | AC | 165 ms
9,132 KB |
testcase_36 | AC | 168 ms
9,076 KB |
testcase_37 | AC | 178 ms
9,140 KB |
testcase_38 | AC | 186 ms
9,148 KB |
testcase_39 | AC | 184 ms
9,276 KB |
testcase_40 | AC | 191 ms
9,272 KB |
testcase_41 | AC | 15 ms
9,152 KB |
testcase_42 | AC | 15 ms
9,152 KB |
testcase_43 | AC | 21 ms
9,272 KB |
testcase_44 | AC | 23 ms
9,152 KB |
testcase_45 | AC | 2 ms
5,248 KB |
testcase_46 | AC | 2 ms
5,248 KB |
testcase_47 | AC | 2 ms
5,248 KB |
ソースコード
#line 1 "combinatorial_opt/test/maxflow.pushrelabel.yuki957.test.cpp"#define PROBLEM "https://yukicoder.me/problems/no/957"#line 2 "combinatorial_opt/maxflow_pushrelabel.hpp"#include <cassert>#include <limits>#include <utility>#include <vector>// Maxflow (push-relabel, highest-label)// Complexity: O(N^2 M^(1/2))template <class Cap, Cap INF = std::numeric_limits<Cap>::max() / 2, bool UseGlobalRelabeling = true, bool UseGapRelabeling = true>struct mf_pushrelabel {struct pque_ {std::vector<std::pair<int, int>> even_, odd_;int se, so;void init(int n) { even_.resize(n), odd_.resize(n), se = so = 0; };void clear() { se = so = 0; }bool empty() const { return se + so == 0; }void push(int i, int h) { (h & 1 ? odd_[so++] : even_[se++]) = {i, h}; }int highest() const {int a = se ? even_[se - 1].second : -1, b = so ? odd_[so - 1].second : -1;return a > b ? a : b;}int pop() {if (!se or (so and odd_[so - 1].second > even_[se - 1].second)) {return odd_[--so].first;} else {return even_[--se].first;}}} pque;int _n;struct _edge {int to, rev;Cap cap;};std::vector<std::vector<_edge>> g;std::vector<std::pair<int, int>> pos;mf_pushrelabel(int n) : _n(n), g(n) { static_assert(INF > 0, "INF must be positive."); }int add_edge(int from, int to, Cap cap) {assert(0 <= from and from < _n);assert(0 <= to and to < _n);assert(0 <= cap);int m = int(pos.size());pos.emplace_back(from, int(g[from].size()));int from_id = g[from].size(), to_id = g[to].size() + (from == to);g[from].push_back({to, to_id, cap});g[to].push_back({from, from_id, Cap(0)});return m;}std::vector<int> dist;std::vector<int> dcnt;std::vector<Cap> excess;int gap;void global_relabeling(int t) {dist.assign(_n, _n), dist[t] = 0;static std::vector<int> q;if (q.empty()) q.resize(_n);q[0] = t;int qb = 0, qe = 1;pque.clear();if (UseGapRelabeling) gap = 1, dcnt.assign(_n * 2, 0);while (qb < qe) {int now = q[qb++];if (UseGapRelabeling) gap = dist[now] + 1, dcnt[dist[now]]++;if (excess[now] > 0) pque.push(now, dist[now]);for (const auto &e : g[now]) {if (g[e.to][e.rev].cap and dist[e.to] == _n) {dist[e.to] = dist[now] + 1;q[qe++] = e.to;}}}}Cap flow(const int &s, const int &t) {assert(0 <= s and s < _n);assert(0 <= t and t < _n);assert(s != t);excess.assign(_n, 0);excess[s] = INF, excess[t] = -INF;dist.assign(_n, 0);dist[s] = _n;pque.init(_n);for (auto &e : g[s]) push(s, e);if (UseGapRelabeling) gap = 1, dcnt.assign(_n * 2, 0), dcnt[0] = _n - 1;if (UseGlobalRelabeling) global_relabeling(t);int tick = _n;while (!pque.empty()) {int i = pque.pop();if (UseGapRelabeling and dist[i] > gap) continue;int dnxt = _n * 2 - 1;for (auto &e : g[i]) {if (!e.cap) continue;if (dist[e.to] == dist[i] - 1) {push(i, e);if (excess[i] == 0) break;} else {if (dist[e.to] + 1 < dnxt) dnxt = dist[e.to] + 1;}}if (excess[i] > 0) {if (UseGapRelabeling) {if (dnxt != dist[i]) {dcnt[dist[i]]--, dcnt[dnxt]++;if (!dcnt[dist[i]] and dist[i] < gap) gap = dist[i];}if (dnxt == gap) gap++;while (pque.highest() > gap) pque.pop();if (dnxt > gap) dnxt = _n;}dist[i] = dnxt;if (!UseGapRelabeling or dist[i] < gap) pque.push(i, dist[i]);}if (UseGlobalRelabeling and --tick == 0) tick = _n, global_relabeling(t);}return excess[t] + INF;}void push(int i, _edge &e) {Cap delta = e.cap < excess[i] ? e.cap : excess[i];excess[i] -= delta, e.cap -= delta;excess[e.to] += delta, g[e.to][e.rev].cap += delta;if (excess[e.to] > 0 and excess[e.to] <= delta) pque.push(e.to, dist[e.to]);}};#line 3 "combinatorial_opt/test/maxflow.pushrelabel.yuki957.test.cpp"#include <algorithm>#include <iostream>#include <numeric>using namespace std;int main() {cin.tie(nullptr), ios::sync_with_stdio(false);int H, W;cin >> H >> W;vector<vector<int>> G(H, vector<int>(W));for (auto &v : G) {for (auto &x : v) cin >> x;}vector<int> R(H), C(W);for (auto &x : R) cin >> x;for (auto &x : C) cin >> x;long long tot = accumulate(R.begin(), R.end(), 0LL) + accumulate(C.begin(), C.end(), 0LL);long long f1 = 0;int Z = 1 + H + W;mf_pushrelabel<long long> g(Z + 1);for (int i = 0; i < H; i++) {auto gtot = accumulate(G[i].begin(), G[i].end(), 0LL);auto f0 = min<long long>(gtot, R[i]);f1 += f0;g.add_edge(0, i + 1, gtot - f0);for (int j = 0; j < W; j++) g.add_edge(i + 1, H + 1 + j, G[i][j]);}for (int j = 0; j < W; j++) g.add_edge(H + 1 + j, Z, C[j]);cout << tot - f1 - g.flow(0, Z) << '\n';}