結果
問題 | No.2604 Initial Motion |
ユーザー | rlangevin |
提出日時 | 2024-01-19 12:09:30 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,426 bytes |
コンパイル時間 | 848 ms |
コンパイル使用メモリ | 82,220 KB |
実行使用メモリ | 142,504 KB |
最終ジャッジ日時 | 2024-09-28 03:23:00 |
合計ジャッジ時間 | 8,601 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
142,504 KB |
testcase_01 | AC | 41 ms
55,172 KB |
testcase_02 | AC | 50 ms
61,736 KB |
testcase_03 | AC | 249 ms
78,772 KB |
testcase_04 | AC | 270 ms
79,296 KB |
testcase_05 | AC | 245 ms
78,580 KB |
testcase_06 | AC | 250 ms
78,924 KB |
testcase_07 | AC | 249 ms
79,108 KB |
testcase_08 | AC | 279 ms
79,560 KB |
testcase_09 | AC | 244 ms
78,716 KB |
testcase_10 | AC | 252 ms
78,756 KB |
testcase_11 | AC | 244 ms
78,676 KB |
testcase_12 | AC | 271 ms
78,864 KB |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | AC | 1,507 ms
84,392 KB |
testcase_16 | TLE | - |
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 | -- | - |
ソースコード
import sys input = sys.stdin.readline #https://github.com/shakayami/ACL-for-python/blob/master/mincostflow.py import heapq class mcf_graph(): n=1 pos=[] g=[[]] def __init__(self,N): self.n=N self.pos=[] self.g=[[] for i in range(N)] def add_edge(self,From,To,cap,cost): assert 0<=From and From<self.n assert 0<=To and To<self.n m=len(self.pos) self.pos.append((From,len(self.g[From]))) self.g[From].append({"to":To,"rev":len(self.g[To]),"cap":cap,"cost":cost}) self.g[To].append({"to":From,"rev":len(self.g[From])-1,"cap":0,"cost":-cost}) def get_edge(self,i): m=len(self.pos) assert 0<=i and i<m _e=self.g[self.pos[i][0]][self.pos[i][1]] _re=self.g[_e["to"]][_e["rev"]] return {"from":self.pos[i][0],"to":_e["to"],"cap":_e["cap"]+_re["cap"], "flow":_re["cap"],"cost":_e["cost"]} def edges(self): m=len(self.pos) result=[{} for i in range(m)] for i in range(m): tmp=self.get_edge(i) result[i]["from"]=tmp["from"] result[i]["to"]=tmp["to"] result[i]["cap"]=tmp["cap"] result[i]["flow"]=tmp["flow"] result[i]["cost"]=tmp["cost"] return result def flow(self,s,t,flow_limit=-1-(-1<<63)): return self.slope(s,t,flow_limit)[-1] def slope(self,s,t,flow_limit=-1-(-1<<63)): assert 0<=s and s<self.n assert 0<=t and t<self.n assert s!=t ''' variants (C = maxcost): -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0 reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge ''' dual=[0 for i in range(self.n)] dist=[0 for i in range(self.n)] pv=[0 for i in range(self.n)] pe=[0 for i in range(self.n)] vis=[False for i in range(self.n)] def dual_ref(): for i in range(self.n): dist[i]=-1-(-1<<63) pv[i]=-1 pe[i]=-1 vis[i]=False que=[] heapq.heappush(que,(0,s)) dist[s]=0 while(que): v=heapq.heappop(que)[1] if vis[v]:continue vis[v]=True if v==t:break ''' dist[v] = shortest(s, v) + dual[s] - dual[v] dist[v] >= 0 (all reduced cost are positive) dist[v] <= (n-1)C ''' for i in range(len(self.g[v])): e=self.g[v][i] if vis[e["to"]] or (not(e["cap"])):continue ''' |-dual[e.to]+dual[v]| <= (n-1)C cost <= C - -(n-1)C + 0 = nC ''' cost=e["cost"]-dual[e["to"]]+dual[v] if dist[e["to"]]-dist[v]>cost: dist[e["to"]]=dist[v]+cost pv[e["to"]]=v pe[e["to"]]=i heapq.heappush(que,(dist[e["to"]],e["to"])) if not(vis[t]): return False for v in range(self.n): if not(vis[v]):continue dual[v]-=dist[t]-dist[v] return True flow=0 cost=0 prev_cost=-1 result=[(flow,cost)] while(flow<flow_limit): if not(dual_ref()): break c=flow_limit-flow v=t while(v!=s): c=min(c,self.g[pv[v]][pe[v]]["cap"]) v=pv[v] v=t while(v!=s): self.g[pv[v]][pe[v]]["cap"]-=c self.g[v][self.g[pv[v]][pe[v]]["rev"]]["cap"]+=c v=pv[v] d=-dual[s] flow+=c cost+=c*d if(prev_cost==d): result.pop() result.append((flow,cost)) prev_cost=cost return result K, N, M = map(int, input().split()) A = list(map(int, input().split())) B = list(map(int, input().split())) G = mcf_graph(N + 2) s, g = 0, N + 1 for i in range(M): u, v, d = map(int, input().split()) G.add_edge(u, v, K, d) G.add_edge(v, u, K, d) for i in range(K): G.add_edge(s, A[i], 1, 0) for i in range(N): G.add_edge(i + 1, g, B[i], 0) print(G.flow(s, g, K)[1])