結果
問題 | No.654 Air E869120 |
ユーザー | marroncastle |
提出日時 | 2020-09-29 08:59:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,325 ms / 2,000 ms |
コード長 | 1,472 bytes |
コンパイル時間 | 304 ms |
コンパイル使用メモリ | 86,952 KB |
実行使用メモリ | 89,360 KB |
最終ジャッジ日時 | 2023-09-16 13:11:56 |
合計ジャッジ時間 | 9,949 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
71,320 KB |
testcase_01 | AC | 70 ms
71,292 KB |
testcase_02 | AC | 69 ms
71,364 KB |
testcase_03 | AC | 69 ms
71,084 KB |
testcase_04 | AC | 70 ms
71,176 KB |
testcase_05 | AC | 67 ms
71,336 KB |
testcase_06 | AC | 69 ms
71,172 KB |
testcase_07 | AC | 71 ms
71,228 KB |
testcase_08 | AC | 71 ms
71,116 KB |
testcase_09 | AC | 72 ms
71,340 KB |
testcase_10 | AC | 1,325 ms
89,360 KB |
testcase_11 | AC | 518 ms
85,880 KB |
testcase_12 | AC | 871 ms
87,132 KB |
testcase_13 | AC | 879 ms
86,856 KB |
testcase_14 | AC | 343 ms
85,056 KB |
testcase_15 | AC | 478 ms
87,352 KB |
testcase_16 | AC | 170 ms
81,536 KB |
testcase_17 | AC | 219 ms
83,220 KB |
testcase_18 | AC | 162 ms
81,704 KB |
testcase_19 | AC | 225 ms
83,076 KB |
testcase_20 | AC | 125 ms
79,396 KB |
testcase_21 | AC | 123 ms
79,568 KB |
testcase_22 | AC | 95 ms
76,524 KB |
testcase_23 | AC | 116 ms
79,364 KB |
testcase_24 | AC | 124 ms
79,724 KB |
testcase_25 | AC | 94 ms
76,304 KB |
testcase_26 | AC | 109 ms
79,556 KB |
testcase_27 | AC | 97 ms
76,308 KB |
testcase_28 | AC | 109 ms
78,948 KB |
testcase_29 | AC | 90 ms
76,156 KB |
testcase_30 | AC | 86 ms
76,128 KB |
testcase_31 | AC | 84 ms
76,060 KB |
testcase_32 | AC | 85 ms
76,460 KB |
testcase_33 | AC | 85 ms
75,876 KB |
testcase_34 | AC | 83 ms
76,196 KB |
testcase_35 | AC | 69 ms
71,172 KB |
testcase_36 | AC | 70 ms
71,436 KB |
testcase_37 | AC | 71 ms
71,304 KB |
testcase_38 | AC | 70 ms
71,336 KB |
testcase_39 | AC | 74 ms
76,160 KB |
ソースコード
# Ford-Fulkerson algorithm class FordFulkerson: def __init__(self, N): self.N = N self.edge = [[] for i in range(N)] def add_edge(self, fr, to, cap): forward = [to, cap, None] forward[2] = backward = [fr, 0, forward] self.edge[fr].append(forward) self.edge[to].append(backward) def add_multi_edge(self, v1, v2, cap1, cap2): edge1 = [v2, cap1, None] edge1[2] = edge2 = [v1, cap2, edge1] self.edge[v1].append(edge1) self.edge[v2].append(edge2) def dfs(self, v, t, f): if v == t: return f used = self.used used[v] = 1 for e in self.edge[v]: w, cap, rev = e if cap and not used[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 f = INF = 10**9 + 7 N = self.N while f: self.used = [0]*N f = self.dfs(s, t, INF) flow += f return flow import sys readline = sys.stdin.readline INF = 10**18 N, M, d = map(int, readline().split()) ff = FordFulkerson(2*M+2) fr = [0]*M to = [0]*M for i in range(M): u, v, p, q, w = map(int, readline().split()) ff.add_edge(1+i, 1+M+i, w) fr[i] = (u,p) to[i] = (v,q+d) if u==1: ff.add_edge(0,1+i,INF) if v==N: ff.add_edge(1+M+i,2*M+1,INF) for i,(v,q) in enumerate(to): for j,(u,p) in enumerate(fr): if v==u and q<=p: ff.add_edge(1+M+i,1+j,INF) ans = ff.flow(0, 2*M+1) print(ans)