結果

問題 No.957 植林
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-12-20 01:45:21
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 1,172 ms / 2,000 ms
コード長 3,837 bytes
コンパイル時間 675 ms
コンパイル使用メモリ 107,672 KB
実行使用メモリ 13,700 KB
最終ジャッジ日時 2023-09-04 04:23:11
合計ジャッジ時間 27,822 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 66 ms
8,508 KB
testcase_04 AC 63 ms
7,940 KB
testcase_05 AC 67 ms
7,988 KB
testcase_06 AC 76 ms
8,308 KB
testcase_07 AC 65 ms
7,784 KB
testcase_08 AC 55 ms
7,788 KB
testcase_09 AC 57 ms
7,804 KB
testcase_10 AC 60 ms
8,064 KB
testcase_11 AC 57 ms
7,848 KB
testcase_12 AC 54 ms
7,848 KB
testcase_13 AC 50 ms
11,408 KB
testcase_14 AC 63 ms
8,248 KB
testcase_15 AC 53 ms
8,016 KB
testcase_16 AC 50 ms
10,468 KB
testcase_17 AC 51 ms
7,676 KB
testcase_18 AC 871 ms
8,780 KB
testcase_19 AC 913 ms
10,876 KB
testcase_20 AC 929 ms
9,040 KB
testcase_21 AC 978 ms
11,992 KB
testcase_22 AC 1,020 ms
9,628 KB
testcase_23 AC 1,049 ms
13,700 KB
testcase_24 AC 1,079 ms
10,828 KB
testcase_25 AC 1,172 ms
9,844 KB
testcase_26 AC 1,159 ms
9,844 KB
testcase_27 AC 1,167 ms
11,340 KB
testcase_28 AC 1,162 ms
10,936 KB
testcase_29 AC 1,161 ms
10,352 KB
testcase_30 AC 1,156 ms
10,088 KB
testcase_31 AC 873 ms
8,780 KB
testcase_32 AC 912 ms
9,072 KB
testcase_33 AC 925 ms
9,824 KB
testcase_34 AC 976 ms
12,144 KB
testcase_35 AC 1,026 ms
10,052 KB
testcase_36 AC 1,052 ms
10,676 KB
testcase_37 AC 1,076 ms
11,176 KB
testcase_38 AC 1,168 ms
10,828 KB
testcase_39 AC 1,152 ms
10,032 KB
testcase_40 AC 1,158 ms
10,028 KB
testcase_41 AC 60 ms
11,316 KB
testcase_42 AC 60 ms
11,672 KB
testcase_43 AC 71 ms
8,332 KB
testcase_44 AC 73 ms
8,356 KB
testcase_45 AC 1 ms
4,380 KB
testcase_46 AC 1 ms
4,376 KB
testcase_47 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
  }
}

/*
  cost = \sum_x -R[x] a_x + \sum_y -C[y] b_y + \sum_{x,y} G[x][y] (a_x OR b_y)
  00 -> 0
  01 -> 1
  10 -> 1
  11 -> 1
  submodular
  
*/
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);
      auto sums = new long[H];
      long ans;
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        sums[x] += G[x][y];
        mf.addEdge(2 + x, 2 + H + y, G[x][y]);
      }
      foreach (x; 0 .. H) {
        if (sums[x] - R[x] > 0) {
          mf.addEdge(0, 2 + x, sums[x] - R[x]);
        } else if (sums[x] - R[x] < 0) {
          ans += sums[x] - R[x];
          mf.addEdge(2 + x, 1, R[x] - sums[x]);
        }
      }
      foreach (y; 0 .. W) {
        ans += -C[y];
        mf.addEdge(2 + H + y, 1, C[y]);
      }
      mf.dinic(0, 1);
      ans += mf.tof;
      ans *= -1;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0