結果
問題 | No.654 Air E869120 |
ユーザー | 👑 rin204 |
提出日時 | 2022-11-03 00:29:33 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,274 bytes |
コンパイル時間 | 283 ms |
コンパイル使用メモリ | 86,984 KB |
実行使用メモリ | 87,056 KB |
最終ジャッジ日時 | 2023-09-24 11:12:41 |
合計ジャッジ時間 | 10,268 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
72,368 KB |
testcase_01 | AC | 95 ms
71,372 KB |
testcase_02 | AC | 104 ms
71,492 KB |
testcase_03 | AC | 96 ms
71,832 KB |
testcase_04 | AC | 98 ms
71,720 KB |
testcase_05 | AC | 96 ms
71,792 KB |
testcase_06 | AC | 102 ms
76,472 KB |
testcase_07 | AC | 100 ms
72,292 KB |
testcase_08 | AC | 100 ms
71,944 KB |
testcase_09 | AC | 96 ms
71,556 KB |
testcase_10 | AC | 400 ms
84,976 KB |
testcase_11 | AC | 346 ms
85,756 KB |
testcase_12 | AC | 311 ms
83,804 KB |
testcase_13 | AC | 306 ms
82,500 KB |
testcase_14 | AC | 283 ms
81,388 KB |
testcase_15 | AC | 326 ms
83,492 KB |
testcase_16 | AC | 325 ms
85,984 KB |
testcase_17 | AC | 341 ms
83,988 KB |
testcase_18 | AC | 288 ms
82,680 KB |
testcase_19 | AC | 336 ms
87,056 KB |
testcase_20 | AC | 225 ms
82,280 KB |
testcase_21 | AC | 232 ms
83,652 KB |
testcase_22 | AC | 164 ms
81,532 KB |
testcase_23 | AC | 200 ms
82,532 KB |
testcase_24 | AC | 217 ms
83,380 KB |
testcase_25 | AC | 159 ms
81,144 KB |
testcase_26 | AC | 170 ms
81,924 KB |
testcase_27 | AC | 151 ms
81,068 KB |
testcase_28 | AC | 176 ms
80,608 KB |
testcase_29 | AC | 152 ms
80,560 KB |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | AC | 97 ms
71,624 KB |
testcase_36 | AC | 97 ms
71,640 KB |
testcase_37 | AC | 98 ms
71,596 KB |
testcase_38 | AC | 95 ms
71,360 KB |
testcase_39 | AC | 99 ms
72,300 KB |
ソースコード
from collections import deque 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)