結果
問題 | No.2573 moving up |
ユーザー | mymelochan |
提出日時 | 2023-12-02 17:06:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,705 ms / 2,000 ms |
コード長 | 2,510 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 89,368 KB |
最終ジャッジ日時 | 2023-12-06 15:49:15 |
合計ジャッジ時間 | 16,368 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
76,612 KB |
testcase_01 | AC | 847 ms
88,392 KB |
testcase_02 | AC | 823 ms
88,516 KB |
testcase_03 | AC | 1,029 ms
89,240 KB |
testcase_04 | AC | 923 ms
89,368 KB |
testcase_05 | AC | 963 ms
89,368 KB |
testcase_06 | AC | 1,705 ms
89,240 KB |
testcase_07 | AC | 973 ms
88,728 KB |
testcase_08 | AC | 184 ms
79,072 KB |
testcase_09 | AC | 1,126 ms
85,376 KB |
testcase_10 | AC | 729 ms
87,192 KB |
testcase_11 | AC | 241 ms
80,192 KB |
testcase_12 | AC | 454 ms
83,992 KB |
testcase_13 | AC | 928 ms
88,728 KB |
testcase_14 | AC | 152 ms
78,320 KB |
testcase_15 | AC | 82 ms
74,696 KB |
testcase_16 | AC | 170 ms
78,440 KB |
testcase_17 | AC | 432 ms
83,480 KB |
testcase_18 | AC | 328 ms
81,816 KB |
testcase_19 | AC | 664 ms
86,680 KB |
testcase_20 | AC | 189 ms
79,316 KB |
testcase_21 | AC | 185 ms
78,816 KB |
testcase_22 | AC | 311 ms
81,304 KB |
testcase_23 | AC | 195 ms
79,336 KB |
testcase_24 | AC | 286 ms
81,052 KB |
testcase_25 | AC | 501 ms
84,376 KB |
testcase_26 | AC | 199 ms
79,460 KB |
testcase_27 | AC | 52 ms
63,412 KB |
testcase_28 | AC | 54 ms
63,412 KB |
testcase_29 | AC | 52 ms
63,412 KB |
testcase_30 | AC | 54 ms
64,180 KB |
ソースコード
############################################################# import sys sys.setrecursionlimit(10**7) from heapq import heappop,heappush from collections import deque,defaultdict,Counter from bisect import bisect_left, bisect_right from itertools import product,combinations,permutations from math import sin,cos #from math import isqrt #DO NOT USE PyPy ipt = sys.stdin.readline iin = lambda :int(ipt()) lmin = lambda :list(map(int,ipt().split())) from heapq import heappush, heappop class MinCostFlow: INF = 10**18 def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap, cost): forward = [to, cap, cost, None] backward = forward[3] = [fr, 0, -cost, forward] self.G[fr].append(forward) self.G[to].append(backward) def flow(self, s, t, f): N = self.N; G = self.G INF = MinCostFlow.INF res = 0 H = [0]*N prv_v = [0]*N prv_e = [None]*N d0 = [INF]*N dist = [INF]*N while f: dist[:] = d0 dist[s] = 0 que = [(0, s)] while que: c, v = heappop(que) if dist[v] < c: continue r0 = dist[v] + H[v] for e in G[v]: w, cap, cost, _ = e if cap > 0 and r0 + cost - H[w] < dist[w]: dist[w] = r = r0 + cost - H[w] prv_v[w] = v; prv_e[w] = e heappush(que, (r, w)) if dist[t] == INF: return None for i in range(N): H[i] += dist[i] d = f; v = t while v != s: d = min(d, prv_e[v][1]) v = prv_v[v] f -= d res += d * H[t] v = t while v != s: e = prv_e[v] e[1] -= d e[3][1] += d v = prv_v[v] return res ############################################################# H,W = lmin() L = [lmin() for _ in range(W)] mcf = MinCostFlow(2+W*2) start = W*2 end = W*2+1 for i in range(W): mcf.add_edge(start,i,1,0) mcf.add_edge(W+i,end,1,0) x,y = L[i] x,y = x-1,y-1 for j in range(W): if y-j >= 0: c = max(y-j,x) else: c = j-y+x #print(i,j,c,x,y) mcf.add_edge(i,W+j,1,c) print(mcf.flow(start,end,W))