結果
問題 | No.654 Air E869120 |
ユーザー | 👑 rin204 |
提出日時 | 2022-11-03 00:30:06 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,316 bytes |
コンパイル時間 | 255 ms |
コンパイル使用メモリ | 87,072 KB |
実行使用メモリ | 87,256 KB |
最終ジャッジ日時 | 2023-09-24 11:13:09 |
合計ジャッジ時間 | 9,124 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 93 ms
71,980 KB |
testcase_01 | AC | 89 ms
71,604 KB |
testcase_02 | AC | 90 ms
71,596 KB |
testcase_03 | AC | 88 ms
71,172 KB |
testcase_04 | AC | 89 ms
71,604 KB |
testcase_05 | AC | 89 ms
71,220 KB |
testcase_06 | AC | 96 ms
76,536 KB |
testcase_07 | AC | 93 ms
72,272 KB |
testcase_08 | AC | 93 ms
71,992 KB |
testcase_09 | AC | 91 ms
71,736 KB |
testcase_10 | AC | 366 ms
86,684 KB |
testcase_11 | AC | 322 ms
85,728 KB |
testcase_12 | AC | 288 ms
83,776 KB |
testcase_13 | AC | 277 ms
83,196 KB |
testcase_14 | AC | 261 ms
81,448 KB |
testcase_15 | AC | 304 ms
83,164 KB |
testcase_16 | AC | 294 ms
86,032 KB |
testcase_17 | AC | 309 ms
84,016 KB |
testcase_18 | AC | 259 ms
82,792 KB |
testcase_19 | AC | 313 ms
87,256 KB |
testcase_20 | AC | 208 ms
82,392 KB |
testcase_21 | AC | 221 ms
83,196 KB |
testcase_22 | AC | 154 ms
81,536 KB |
testcase_23 | AC | 184 ms
82,244 KB |
testcase_24 | AC | 210 ms
82,928 KB |
testcase_25 | AC | 152 ms
81,364 KB |
testcase_26 | AC | 165 ms
82,716 KB |
testcase_27 | AC | 142 ms
80,704 KB |
testcase_28 | AC | 164 ms
81,328 KB |
testcase_29 | AC | 140 ms
80,872 KB |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | AC | 90 ms
71,532 KB |
testcase_36 | AC | 92 ms
71,664 KB |
testcase_37 | AC | 91 ms
71,536 KB |
testcase_38 | AC | 92 ms
71,404 KB |
testcase_39 | AC | 96 ms
72,104 KB |
ソースコード
from collections import deque import sys sys.setrecursionlimit(10 ** 9) class Dinic: def __init__(self, n): self.n = n self.links = [[] for _ in range(n)] self.depth = None self.progress = None def add_link(self, _from, to, cap): self.links[_from].append([cap, to, len(self.links[to])]) self.links[to].append([0, _from, len(self.links[_from]) - 1]) def bfs(self, s): depth = [-1] * self.n depth[s] = 0 q = deque([s]) while q: v = q.popleft() for cap, to, rev in self.links[v]: if cap > 0 and depth[to] < 0: depth[to] = depth[v] + 1 q.append(to) self.depth = depth def dfs(self, v, t, flow): if v == t: return flow links_v = self.links[v] for i in range(self.progress[v], len(links_v)): self.progress[v] = i cap, to, rev = link = links_v[i] if cap == 0 or self.depth[v] >= self.depth[to]: continue d = self.dfs(to, t, min(flow, cap)) if d == 0: continue link[0] -= d self.links[to][rev][0] += d return d return 0 def max_flow(self, s, t): flow = 0 while True: self.bfs(s) if self.depth[t] < 0: return flow self.progress = [0] * self.n current_flow = self.dfs(s, t, float('inf')) while current_flow > 0: flow += current_flow current_flow = self.dfs(s, t, float('inf')) n, m, d = map(int, input().split()) Q = [[] for _ in range(n)] Q[0].append(-1) Q[-1].append(1 << 60) E = [] for _ in range(m): u, v, p, q, w = map(int, input().split()) q += d u -= 1 v -= 1 E.append((u, v, p, q, w)) Q[u].append(p) Q[v].append(q) dic = {} ind = 0 for i in range(n): Q[i].sort() for j in Q[i]: dic[(i, j)] = ind ind += 1 G = Dinic(ind) for u, v, p, q, w in E: G.add_link(dic[(u, p)], dic[(v, q)], w) for i in range(n): b = dic[(i, Q[i][0])] for j in Q[i][1:]: c = dic[(i, j)] G.add_link(b, c, 1 << 60) b = c ans = G.max_flow(0, ind - 1) print(ans)