結果
問題 | No.2604 Initial Motion |
ユーザー | ゼット |
提出日時 | 2024-01-12 23:27:27 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,582 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 82,176 KB |
最終ジャッジ日時 | 2024-09-28 00:13:51 |
合計ジャッジ時間 | 11,416 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
58,752 KB |
testcase_01 | AC | 42 ms
53,120 KB |
testcase_02 | AC | 55 ms
60,032 KB |
testcase_03 | AC | 603 ms
81,608 KB |
testcase_04 | AC | 631 ms
81,536 KB |
testcase_05 | AC | 600 ms
81,460 KB |
testcase_06 | AC | 650 ms
82,176 KB |
testcase_07 | AC | 715 ms
81,152 KB |
testcase_08 | AC | 595 ms
81,664 KB |
testcase_09 | AC | 833 ms
81,792 KB |
testcase_10 | AC | 604 ms
81,408 KB |
testcase_11 | AC | 678 ms
81,928 KB |
testcase_12 | AC | 502 ms
80,828 KB |
testcase_13 | TLE | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
ソースコード
class MinCostFlow: def __init__(self, n): self.n = n self.G = [[] for i in range(n)] def addEdge(self, f, t, cap, cost): # [to, cap, cost, rev] self.G[f].append([t, cap, cost, len(self.G[t])]) self.G[t].append([f, 0, -cost, len(self.G[f])-1]) def minCostFlow(self, s, t, f): n = self.n G = self.G prevv = [0]*n; preve = [0]*n INF = 10**9+7 res = 0 while f: dist = [INF]*n dist[s] = 0 update = 1 while update: update = 0 for v in range(n): if dist[v] == INF: continue gv = G[v] for i in range(len(gv)): to, cap, cost, rev = gv[i] if cap > 0 and dist[v] + cost < dist[to]: dist[to] = dist[v] + cost prevv[to] = v; preve[to] = i update = 1 if dist[t] == INF: return -1 d = f; v = t while v != s: d = min(d, G[prevv[v]][preve[v]][1]) v = prevv[v] f -= d res += d * dist[t] v = t while v != s: e = G[prevv[v]][preve[v]] e[1] -= d G[v][e[3]][1] += d v = prevv[v] return res K,N,M=map(int,input().split()) A=list(map(int,input().split())) G=[[] for i in range(N)] B=list(map(int,input().split())) for i in range(M): a,b,c=map(int,input().split()) G[a-1].append((b-1,c)) G[b-1].append((a-1,c)) from heapq import heappush,heappop dist=[[10**16]*N for i in range(N)] for i in range(N): dist[i][i]=0 S=[] heappush(S,i) kaku=[False]*N while S: w=heappop(S) time=w//(10**4) x=w%(10**4) if kaku[x]==True: continue kaku[x]=True for B2 in G[x]: y,c=B2[:] if dist[i][y]>dist[i][x]+c: dist[i][y]=dist[i][x]+c heappush(S,dist[i][y]*10**4+y) Z=MinCostFlow(K+N+2) used=[False]*(K+1) count=0 for i in range(1,K+1): x=A[i-1]-1 if B[x]>0: B[x]-=1 used[i]=True count+=1 if count==K: print(0) exit() for i in range(1,K+1): if used[i]==True: continue Z.addEdge(0,i,1,0) pos=A[i-1]-1 for j in range(N): if B[j]==0: continue Z.addEdge(i,j+1+K,1,dist[pos][j]) for j in range(N): if B[j]==0: continue Z.addEdge(j+1+K,N+K+1,B[j],0) ans=Z.minCostFlow(0,N+K+1,K-count) print(ans)