結果
問題 | No.904 サメトロ |
ユーザー | rlangevin |
提出日時 | 2023-01-24 12:30:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 136 ms / 1,000 ms |
コード長 | 2,000 bytes |
コンパイル時間 | 309 ms |
コンパイル使用メモリ | 87,300 KB |
実行使用メモリ | 78,552 KB |
最終ジャッジ日時 | 2023-09-08 08:43:48 |
合計ジャッジ時間 | 5,536 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,360 KB |
testcase_01 | AC | 98 ms
71,532 KB |
testcase_02 | AC | 107 ms
76,700 KB |
testcase_03 | AC | 115 ms
77,204 KB |
testcase_04 | AC | 109 ms
76,852 KB |
testcase_05 | AC | 98 ms
71,392 KB |
testcase_06 | AC | 109 ms
77,056 KB |
testcase_07 | AC | 116 ms
77,120 KB |
testcase_08 | AC | 114 ms
77,184 KB |
testcase_09 | AC | 96 ms
71,580 KB |
testcase_10 | AC | 129 ms
77,456 KB |
testcase_11 | AC | 121 ms
77,348 KB |
testcase_12 | AC | 104 ms
76,436 KB |
testcase_13 | AC | 101 ms
76,476 KB |
testcase_14 | AC | 109 ms
77,012 KB |
testcase_15 | AC | 110 ms
77,308 KB |
testcase_16 | AC | 136 ms
78,552 KB |
testcase_17 | AC | 96 ms
71,548 KB |
testcase_18 | AC | 97 ms
71,664 KB |
testcase_19 | AC | 106 ms
76,712 KB |
testcase_20 | AC | 97 ms
71,660 KB |
testcase_21 | AC | 118 ms
77,288 KB |
testcase_22 | AC | 112 ms
77,332 KB |
testcase_23 | AC | 119 ms
77,496 KB |
testcase_24 | AC | 108 ms
77,024 KB |
testcase_25 | AC | 96 ms
71,548 KB |
testcase_26 | AC | 130 ms
78,432 KB |
testcase_27 | AC | 109 ms
77,424 KB |
testcase_28 | AC | 94 ms
71,552 KB |
testcase_29 | AC | 101 ms
77,140 KB |
testcase_30 | AC | 96 ms
71,536 KB |
testcase_31 | AC | 96 ms
71,808 KB |
testcase_32 | AC | 95 ms
71,556 KB |
testcase_33 | AC | 98 ms
71,404 KB |
testcase_34 | AC | 94 ms
71,768 KB |
testcase_35 | AC | 94 ms
71,680 KB |
ソースコード
# Dinic's algorithm # https://tjkendev.github.io/procon-library/python/max_flow/dinic.html from collections import deque class Dinic: def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap): forward = [to, cap, None] forward[2] = backward = [fr, 0, forward] self.G[fr].append(forward) self.G[to].append(backward) def add_multi_edge(self, v1, v2, cap1, cap2): edge1 = [v2, cap1, None] edge1[2] = edge2 = [v1, cap2, edge1] self.G[v1].append(edge1) self.G[v2].append(edge2) def bfs(self, s, t): self.level = level = [None]*self.N deq = deque([s]) level[s] = 0 G = self.G while deq: v = deq.popleft() lv = level[v] + 1 for w, cap, _ in G[v]: if cap and level[w] is None: level[w] = lv deq.append(w) return level[t] is not None def dfs(self, v, t, f): if v == t: return f level = self.level for e in self.it[v]: w, cap, rev = e if cap and level[v] < level[w]: d = self.dfs(w, t, min(f, cap)) if d: e[1] -= d rev[1] += d return d return 0 def flow(self, s, t): flow = 0 INF = 10**9 + 7 G = self.G while self.bfs(s, t): *self.it, = map(iter, self.G) f = INF while f: f = self.dfs(s, t, INF) flow += f return flow N = int(input()) G = Dinic(2 * N) for i in range(N - 1): A, B = map(int, input().split()) G.add_edge(0, i + 1, A) G.add_edge(i + N, 2 * N - 1, B) inf = 10 ** 18 for i in range(N - 1): for j in range(N - 1): if i == j: continue G.add_edge(i + 1, j + N, inf) print(G.flow(0, 2 * N - 1) + 1)