結果
問題 | No.2320 Game World for PvP |
ユーザー | googol_S0 |
提出日時 | 2023-05-26 21:29:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 200 ms / 2,000 ms |
コード長 | 3,775 bytes |
コンパイル時間 | 350 ms |
コンパイル使用メモリ | 87,124 KB |
実行使用メモリ | 84,028 KB |
最終ジャッジ日時 | 2023-08-26 10:21:54 |
合計ジャッジ時間 | 8,298 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
71,452 KB |
testcase_01 | AC | 97 ms
71,600 KB |
testcase_02 | AC | 99 ms
72,064 KB |
testcase_03 | AC | 101 ms
72,016 KB |
testcase_04 | AC | 197 ms
84,028 KB |
testcase_05 | AC | 183 ms
83,584 KB |
testcase_06 | AC | 196 ms
83,692 KB |
testcase_07 | AC | 193 ms
83,016 KB |
testcase_08 | AC | 178 ms
82,776 KB |
testcase_09 | AC | 187 ms
82,912 KB |
testcase_10 | AC | 173 ms
82,824 KB |
testcase_11 | AC | 195 ms
83,484 KB |
testcase_12 | AC | 189 ms
83,116 KB |
testcase_13 | AC | 171 ms
82,884 KB |
testcase_14 | AC | 199 ms
83,180 KB |
testcase_15 | AC | 193 ms
83,088 KB |
testcase_16 | AC | 197 ms
83,512 KB |
testcase_17 | AC | 187 ms
83,344 KB |
testcase_18 | AC | 200 ms
83,096 KB |
testcase_19 | AC | 196 ms
83,144 KB |
testcase_20 | AC | 198 ms
83,168 KB |
testcase_21 | AC | 178 ms
82,704 KB |
testcase_22 | AC | 197 ms
83,620 KB |
testcase_23 | AC | 194 ms
83,760 KB |
testcase_24 | AC | 185 ms
83,356 KB |
testcase_25 | AC | 177 ms
83,044 KB |
testcase_26 | AC | 186 ms
83,316 KB |
testcase_27 | AC | 96 ms
71,624 KB |
testcase_28 | AC | 164 ms
81,792 KB |
testcase_29 | AC | 167 ms
81,980 KB |
testcase_30 | AC | 157 ms
81,972 KB |
testcase_31 | AC | 162 ms
82,104 KB |
testcase_32 | AC | 98 ms
71,616 KB |
testcase_33 | AC | 161 ms
81,676 KB |
ソースコード
from collections import deque class mf_graph: n=1 g=[[] for i in range(1)] pos=[] def __init__(self,N): self.n=N self.g=[[] for i in range(N)] self.pos=[] def add_edge(self,From,To,cap): assert 0<=From and From<self.n assert 0<=To and To<self.n assert 0<=cap m=len(self.pos) from_id=len(self.g[From]) self.pos.append([From,from_id]) to_id=len(self.g[To]) if From==To:to_id+=1 self.g[From].append([To,to_id,cap]) self.g[To].append([From,from_id,0]) return m 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[0]][_e[1]] return [self.pos[i][0],_e[0],_e[2]+_re[2],_re[2]] def edges(self): m=len(self.pos) result=[] for i in range(m): a,b,c,d=self.get_edge(i) result.append({"from":a,"to":b,"cap":c,"flow":d}) return result def change_edge(self,i,new_cap,new_flow): m=len(self.pos) assert 0<=i and i<m assert 0<=new_flow and new_flow<=new_cap _e=self.g[self.pos[i][0]][self.pos[i][1]] _re=self.g[_e[0]][_e[1]] _e[2]=new_cap-new_flow _re[2]=new_flow def flow(self,s,t,flow_limit=(1<<63)-1): assert 0<=s and s<self.n assert 0<=t and t<self.n assert s!=t def bfs(): level=[-1 for i in range(self.n)] level[s]=0 que=deque([]) que.append(s) while(que): v=que.popleft() for to,rev,cap in self.g[v]: if cap==0 or level[to]>=0:continue level[to]=level[v]+1 if to==t:return level que.append(to) return level def dfs(v,up): if (v==s):return up res=0 level_v=level[v] for i in range(Iter[v],len(self.g[v])): to,rev,cap=self.g[v][i] if (level_v<=level[to] or self.g[to][rev][2]==0):continue d=dfs(to,min(up-res,self.g[to][rev][2])) if d<=0:continue self.g[v][i][2]+=d self.g[to][rev][2]-=d res+=d if res==up:return res level[v]=self.n return res flow=0 while(flow<flow_limit): level=bfs() if level[t]==-1:break Iter=[0 for i in range(self.n)] f=dfs(t,flow_limit-flow) if not(f):break flow+=f return flow def min_cut(self,s): visited=[False for i in range(self.n)] que=deque([]) que.append(s) while(len(que)>0): p=que.popleft() visited[p]=True for to,rev,cap in self.g[p]: if cap and not(visited[to]): visited[to]=True que.append(to) return visited N,S,T=map(int,input().split()) X=[-1]*N E=list(map(int,input().split())) R=list(map(int,input().split())) C=[list(map(int,input().split())) for i in range(N)] for i in range(S): X[E[i]-1]=0 for i in range(T): X[R[i]-1]=1 SZ=N*N*2+N*2+2 G=mf_graph(SZ) s,t=SZ-2,SZ-1 for i in range(N): if X[i]==0: G.add_edge(s,i,10**15) if X[i]==1: G.add_edge(i,t,10**15) ANS=0 v=N for i in range(N): for j in range(i+1,N): ANS+=C[i][j] G.add_edge(s,v,C[i][j]) G.add_edge(v,i,10**15) G.add_edge(v,j,10**15) v+=1 ANS+=C[i][j] G.add_edge(v,t,C[i][j]) G.add_edge(i,v,10**15) G.add_edge(j,v,10**15) v+=1 print(ANS-G.flow(s,t))