結果
問題 | No.957 植林 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-12-19 22:34:34 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 1,440 ms / 2,000 ms |
コード長 | 3,513 bytes |
コンパイル時間 | 682 ms |
コンパイル使用メモリ | 108,448 KB |
実行使用メモリ | 24,240 KB |
最終ジャッジ日時 | 2023-09-04 04:22:01 |
合計ジャッジ時間 | 33,985 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 116 ms
16,544 KB |
testcase_04 | AC | 110 ms
17,004 KB |
testcase_05 | AC | 115 ms
18,004 KB |
testcase_06 | AC | 129 ms
22,432 KB |
testcase_07 | AC | 112 ms
17,272 KB |
testcase_08 | AC | 99 ms
16,548 KB |
testcase_09 | AC | 98 ms
18,064 KB |
testcase_10 | AC | 103 ms
23,452 KB |
testcase_11 | AC | 98 ms
17,908 KB |
testcase_12 | AC | 99 ms
18,928 KB |
testcase_13 | AC | 85 ms
15,832 KB |
testcase_14 | AC | 107 ms
21,868 KB |
testcase_15 | AC | 94 ms
17,508 KB |
testcase_16 | AC | 88 ms
15,460 KB |
testcase_17 | AC | 91 ms
16,560 KB |
testcase_18 | AC | 1,013 ms
18,532 KB |
testcase_19 | AC | 1,075 ms
17,564 KB |
testcase_20 | AC | 1,099 ms
21,800 KB |
testcase_21 | AC | 1,148 ms
21,284 KB |
testcase_22 | AC | 1,219 ms
19,292 KB |
testcase_23 | AC | 1,260 ms
22,028 KB |
testcase_24 | AC | 1,336 ms
21,656 KB |
testcase_25 | AC | 1,403 ms
23,752 KB |
testcase_26 | AC | 1,388 ms
23,144 KB |
testcase_27 | AC | 1,365 ms
23,908 KB |
testcase_28 | AC | 1,406 ms
23,132 KB |
testcase_29 | AC | 1,418 ms
23,176 KB |
testcase_30 | AC | 1,398 ms
23,092 KB |
testcase_31 | AC | 1,022 ms
17,872 KB |
testcase_32 | AC | 1,075 ms
17,608 KB |
testcase_33 | AC | 1,091 ms
21,132 KB |
testcase_34 | AC | 1,142 ms
21,372 KB |
testcase_35 | AC | 1,231 ms
19,652 KB |
testcase_36 | AC | 1,286 ms
22,184 KB |
testcase_37 | AC | 1,334 ms
20,412 KB |
testcase_38 | AC | 1,440 ms
23,592 KB |
testcase_39 | AC | 1,401 ms
23,912 KB |
testcase_40 | AC | 1,388 ms
24,240 KB |
testcase_41 | AC | 105 ms
22,860 KB |
testcase_42 | AC | 105 ms
22,388 KB |
testcase_43 | AC | 117 ms
22,364 KB |
testcase_44 | AC | 123 ms
21,908 KB |
testcase_45 | AC | 2 ms
4,376 KB |
testcase_46 | AC | 1 ms
4,380 KB |
testcase_47 | AC | 1 ms
4,376 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } class MaxFlow(Capa) { enum Capa wEPS = 0; enum Capa wINF = 10L^^18; int n, m; int[][] g; int[] zu; Capa[] capa; Capa tof; int[] lev, see, que; this(int n) { this.n = n; m = 0; g = new int[][n]; zu = []; capa = []; lev = new int[n]; see = new int[n]; que = new int[n]; } void addEdge(int u, int v, Capa w0, Capa w1 = 0) { g[u] ~= m; zu ~= v; capa ~= w0; ++m; g[v] ~= m; zu ~= u; capa ~= w1; ++m; } Capa augment(int src, int ink, Capa flo) { if (src == ink) return flo; foreach (i; g[src][see[src] .. $]) { if (capa[i] > wEPS && lev[src] < lev[zu[i]]) { Capa f = augment(zu[i], ink, min(flo, capa[i])); if (f > wEPS) { capa[i] -= f; capa[i ^ 1] += f; return f; } } ++see[src]; } return 0; } bool dinic(int src, int ink, Capa flo = wINF) { for (tof = 0; tof + wEPS < flo; ) { int[] q; lev[] = -1; dinicBFS: for (lev[src] = 0, q ~= src; !q.empty; ) { int u = q.front; q.popFront; foreach (i; g[u]) { int v = zu[i]; if (capa[i] > wEPS && lev[v] == -1) { lev[v] = lev[u] + 1; q ~= v; if (v == ink) break dinicBFS; } } } if (lev[ink] == -1) return false; see[] = 0; for (; ; ) { Capa f = augment(src, ink, flo - tof); if (f <= wEPS) break; tof += f; } } return true; } } void main() { try { for (; ; ) { const H = readInt(); const W = readInt(); auto G = new long[][](H, W); foreach (x; 0 .. H) foreach (y; 0 .. W) { G[x][y] = readLong(); } auto R = new long[H]; foreach (x; 0 .. H) { R[x] = readLong(); } auto C = new long[W]; foreach (y; 0 .. W) { C[y] = readLong(); } auto mf = new MaxFlow!long(2 + H + W); foreach (x; 0 .. H) { mf.addEdge(2 + x, 1, R[x]); } foreach (y; 0 .. W) { mf.addEdge(2 + H + y, 1, C[y]); } foreach (x; 0 .. H) foreach (y; 0 .. W) { mf.addEdge(0, 2 + x, G[x][y]); mf.addEdge(2 + x, 2 + H + y, G[x][y]); } mf.dinic(0, 1); long ans = mf.tof; ans -= R.sum; ans -= C.sum; ans *= -1; writeln(ans); } } catch (EOFException e) { } }