結果
問題 | No.2320 Game World for PvP |
ユーザー | Shirotsume |
提出日時 | 2023-05-26 23:08:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 181 ms / 2,000 ms |
コード長 | 3,945 bytes |
コンパイル時間 | 982 ms |
コンパイル使用メモリ | 87,232 KB |
実行使用メモリ | 82,328 KB |
最終ジャッジ日時 | 2023-08-26 13:33:12 |
合計ジャッジ時間 | 6,612 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,444 KB |
testcase_01 | AC | 94 ms
71,708 KB |
testcase_02 | AC | 97 ms
71,956 KB |
testcase_03 | AC | 94 ms
72,424 KB |
testcase_04 | AC | 149 ms
78,760 KB |
testcase_05 | AC | 133 ms
78,872 KB |
testcase_06 | AC | 135 ms
78,816 KB |
testcase_07 | AC | 132 ms
78,732 KB |
testcase_08 | AC | 133 ms
79,088 KB |
testcase_09 | AC | 140 ms
78,904 KB |
testcase_10 | AC | 120 ms
77,988 KB |
testcase_11 | AC | 154 ms
81,536 KB |
testcase_12 | AC | 155 ms
82,328 KB |
testcase_13 | AC | 121 ms
77,940 KB |
testcase_14 | AC | 161 ms
81,768 KB |
testcase_15 | AC | 125 ms
78,864 KB |
testcase_16 | AC | 152 ms
81,684 KB |
testcase_17 | AC | 131 ms
79,100 KB |
testcase_18 | AC | 163 ms
81,680 KB |
testcase_19 | AC | 153 ms
81,492 KB |
testcase_20 | AC | 151 ms
82,040 KB |
testcase_21 | AC | 136 ms
78,984 KB |
testcase_22 | AC | 142 ms
78,680 KB |
testcase_23 | AC | 158 ms
81,840 KB |
testcase_24 | AC | 125 ms
78,364 KB |
testcase_25 | AC | 126 ms
78,512 KB |
testcase_26 | AC | 153 ms
81,984 KB |
testcase_27 | AC | 95 ms
71,776 KB |
testcase_28 | AC | 179 ms
81,504 KB |
testcase_29 | AC | 171 ms
78,844 KB |
testcase_30 | AC | 181 ms
78,820 KB |
testcase_31 | AC | 170 ms
81,520 KB |
testcase_32 | AC | 95 ms
71,644 KB |
testcase_33 | AC | 181 ms
78,816 KB |
ソースコード
import sys from collections import deque, Counter input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 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) self.pos.append((From,len(self.g[From]))) self.g[From].append({"to":To,"rev":len(self.g[To]),"cap":cap}) self.g[To].append({"to":From,"rev":len(self.g[From])-1,"cap":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["to"]][_e["rev"]] return {"from":self.pos[i][0], "to":_e["to"], "cap":_e["cap"]+_re["cap"], "flow":_re["cap"]} def edges(self): m=len(self.pos) result=[] for i in range(m): result.append(self.get_edge(i)) 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["to"]][_e["rev"]] _e["cap"]=new_cap-new_flow _re["cap"]=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 level=[0 for i in range(self.n)] Iter=[0 for i in range(self.n)] que=deque([]) def bfs(): for i in range(self.n):level[i]=-1 level[s]=0 que=deque([]) que.append(s) while(len(que)>0): v=que.popleft() for e in self.g[v]: if e["cap"]==0 or level[e["to"]]>=0:continue level[e["to"]]=level[v]+1 if e["to"]==t:return que.append(e["to"]) def dfs(func,v,up): if (v==s):return up res=0 level_v=level[v] for i in range(Iter[v],len(self.g[v])): e=self.g[v][i] if (level_v<=level[e["to"]] or self.g[e["to"]][e["rev"]]["cap"]==0):continue d=func(func,e["to"],min(up-res,self.g[e["to"]][e["rev"]]["cap"])) if d<=0:continue self.g[v][i]["cap"]+=d self.g[e["to"]][e["rev"]]["cap"]-=d res+=d if res==up:return res level[v]=self.n return res flow=0 while(flow<flow_limit): bfs() if level[t]==-1:break for i in range(self.n):Iter[i]=0 while(flow<flow_limit): f=dfs(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 e in self.g[p]: if e["cap"] and not(visited[e["to"]]): visited[e["to"]]=True que.append(e["to"]) return visited n, s, t = mi() e = [v - 1 for v in li()] r = [v - 1 for v in li()] G = mf_graph(n + 3) S = n T = n + 1 W = n + 2 for i in range(n): if i in e: G.add_edge(S, i, inf) elif i in r: G.add_edge(i, T, inf) c = [li() for _ in range(n)] ans = 0 for i in range(n): for j in range(i + 1, n): ans += c[i][j] G.add_edge(i, j, c[i][j]) G.add_edge(j, i, c[i][j]) f = G.flow(S, T) print(ans - f)