結果

問題 No.1301 Strange Graph Shortest Path
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-11-27 21:40:29
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 649 ms / 3,000 ms
コード長 4,119 bytes
コンパイル時間 1,403 ms
コンパイル使用メモリ 127,272 KB
実行使用メモリ 65,944 KB
最終ジャッジ日時 2023-09-04 11:14:18
合計ジャッジ時間 24,785 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 586 ms
47,216 KB
testcase_03 AC 497 ms
40,536 KB
testcase_04 AC 636 ms
45,352 KB
testcase_05 AC 547 ms
54,468 KB
testcase_06 AC 583 ms
52,548 KB
testcase_07 AC 576 ms
53,948 KB
testcase_08 AC 514 ms
49,444 KB
testcase_09 AC 548 ms
48,480 KB
testcase_10 AC 509 ms
46,268 KB
testcase_11 AC 603 ms
52,448 KB
testcase_12 AC 611 ms
52,384 KB
testcase_13 AC 589 ms
51,804 KB
testcase_14 AC 571 ms
48,412 KB
testcase_15 AC 557 ms
40,728 KB
testcase_16 AC 645 ms
51,508 KB
testcase_17 AC 616 ms
45,972 KB
testcase_18 AC 549 ms
42,272 KB
testcase_19 AC 592 ms
48,932 KB
testcase_20 AC 573 ms
47,096 KB
testcase_21 AC 592 ms
45,528 KB
testcase_22 AC 588 ms
51,376 KB
testcase_23 AC 598 ms
54,196 KB
testcase_24 AC 590 ms
49,256 KB
testcase_25 AC 643 ms
51,552 KB
testcase_26 AC 587 ms
56,556 KB
testcase_27 AC 598 ms
51,608 KB
testcase_28 AC 537 ms
41,684 KB
testcase_29 AC 633 ms
48,932 KB
testcase_30 AC 626 ms
65,944 KB
testcase_31 AC 613 ms
49,224 KB
testcase_32 AC 1 ms
4,380 KB
testcase_33 AC 414 ms
59,820 KB
testcase_34 AC 649 ms
55,960 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)); }


// Dijkstra
class MinCostFlow(Capa, Cost, Capa CAPA_EPS = 0) {
  int n, m;
  int[][] g;
  int[] as, bs;
  Capa[] capa;
  Cost[] cost, pot;
  Capa tof;
  Cost toc;
  this(int n) {
    this.n = n; m = 0; g = new int[][n]; as = []; bs = []; capa = []; cost = [];
  }
  int addEdge(int u, int v, Capa w, Cost c) {
    debug {
      writeln("addEdge ", u, " ", v, " ", w, " ", c);
    }
    const i = m;
    g[u] ~= m; as ~= u; bs ~= v; capa ~= w; cost ~= c; ++m;
    g[v] ~= m; as ~= v; bs ~= u; capa ~= 0; cost ~= -c; ++m;
    return i;
  }
  bool solve(int source, int sink, Capa flow) {
    pot = new Cost[n];
    pot[] = 0;
    for (; ; ) {
      bool cont;
      foreach (u; 0 .. n) foreach (i; g[u]) if (capa[i] > CAPA_EPS) {
        const v = bs[i];
        if (pot[v] > pot[u] + cost[i]) {
          pot[v] = pot[u] + cost[i];
          cont = true;
        }
      }
      if (!cont) break;
    }
    auto dist = new Cost[n];
    auto prei = new int[n];
    auto vis = new bool[n];
    for (tof = 0, toc = 0; tof + CAPA_EPS < flow; ) {
      alias Entry = Tuple!(Cost, "c", int, "u");
      BinaryHeap!(Array!Entry, "a > b") que;
      dist[] = -1;
      prei[] = -1;
      vis[] = false;
      dist[source] = 0;
      prei[source] = -2;
      que.insert(Entry(0, source));
      for (; !que.empty(); ) {
        const c = que.front.c;
        const u = que.front.u;
        que.removeFront;
        if (vis[u]) continue;
        vis[u] = true;
        foreach (i; g[u]) if (capa[i] > CAPA_EPS) {
          const v = bs[i];
          if (vis[v]) continue;
          const cc = c + cost[i] + pot[u] - pot[v];
          if (prei[v] == -1 || dist[v] > cc) {
            dist[v] = cc;
            prei[v] = i;
            que.insert(Entry(cc, v));
          }
        }
      }
      if (!vis[sink]) return false;
      Capa f = flow - tof;
      for (int v = sink; v != source; ) {
        const i = prei[v];
        if (f > capa[i]) f = capa[i];
        v = as[i];
      }
      for (int v = sink; v != source; ) {
        const i = prei[v];
        capa[i] -= f; capa[i ^ 1] += f;
        v = as[i];
      }
      tof += f;
      toc += f * (dist[sink] - pot[source] + pot[sink]);
      pot[] += dist[];
    }
    return true;
  }
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      auto B = new int[M];
      auto C = new long[M];
      auto D = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readLong();
        D[i] = readLong();
      }
      
      auto mcf = new MinCostFlow!(int, long)(N);
      foreach (i; 0 .. M) {
        mcf.addEdge(A[i], B[i], 1, C[i]);
        mcf.addEdge(A[i], B[i], 1, D[i]);
        mcf.addEdge(B[i], A[i], 1, C[i]);
        mcf.addEdge(B[i], A[i], 1, D[i]);
      }
      mcf.solve(0, N - 1, 2);
      writeln(mcf.toc);
    }
  } catch (EOFException e) {
  }
}
0