結果
問題 | No.1744 Selfish Spies 1 (à la Princess' Perfectionism) |
ユーザー | chineristAC |
提出日時 | 2021-11-14 21:32:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,059 ms / 5,000 ms |
コード長 | 2,942 bytes |
コンパイル時間 | 440 ms |
コンパイル使用メモリ | 82,392 KB |
実行使用メモリ | 119,076 KB |
最終ジャッジ日時 | 2024-05-07 13:32:04 |
合計ジャッジ時間 | 11,926 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
56,832 KB |
testcase_01 | AC | 46 ms
56,320 KB |
testcase_02 | AC | 45 ms
56,576 KB |
testcase_03 | AC | 46 ms
56,320 KB |
testcase_04 | AC | 45 ms
56,320 KB |
testcase_05 | AC | 46 ms
56,448 KB |
testcase_06 | AC | 46 ms
56,448 KB |
testcase_07 | AC | 46 ms
56,576 KB |
testcase_08 | AC | 47 ms
56,448 KB |
testcase_09 | AC | 56 ms
65,408 KB |
testcase_10 | AC | 60 ms
68,352 KB |
testcase_11 | AC | 67 ms
71,040 KB |
testcase_12 | AC | 90 ms
77,796 KB |
testcase_13 | AC | 83 ms
77,720 KB |
testcase_14 | AC | 120 ms
79,232 KB |
testcase_15 | AC | 111 ms
78,848 KB |
testcase_16 | AC | 195 ms
79,696 KB |
testcase_17 | AC | 197 ms
80,836 KB |
testcase_18 | AC | 188 ms
80,944 KB |
testcase_19 | AC | 58 ms
68,508 KB |
testcase_20 | AC | 60 ms
68,224 KB |
testcase_21 | AC | 91 ms
78,336 KB |
testcase_22 | AC | 91 ms
78,108 KB |
testcase_23 | AC | 82 ms
77,568 KB |
testcase_24 | AC | 211 ms
86,176 KB |
testcase_25 | AC | 127 ms
79,328 KB |
testcase_26 | AC | 165 ms
79,856 KB |
testcase_27 | AC | 190 ms
81,308 KB |
testcase_28 | AC | 858 ms
118,912 KB |
testcase_29 | AC | 185 ms
81,404 KB |
testcase_30 | AC | 231 ms
81,008 KB |
testcase_31 | AC | 193 ms
81,168 KB |
testcase_32 | AC | 221 ms
81,196 KB |
testcase_33 | AC | 890 ms
118,644 KB |
testcase_34 | AC | 905 ms
118,680 KB |
testcase_35 | AC | 875 ms
118,832 KB |
testcase_36 | AC | 949 ms
118,724 KB |
testcase_37 | AC | 1,059 ms
118,924 KB |
testcase_38 | AC | 1,027 ms
119,076 KB |
ソースコード
from collections import deque class Dinic: def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap): forward = [to, cap, None] forward[2] = backward = [fr, 0, forward] self.G[fr].append(forward) self.G[to].append(backward) def add_multi_edge(self, v1, v2, cap1, cap2): edge1 = [v2, cap1, None] edge1[2] = edge2 = [v1, cap2, edge1] self.G[v1].append(edge1) self.G[v2].append(edge2) def bfs(self, s, t): self.level = level = [None]*self.N deq = deque([s]) level[s] = 0 G = self.G while deq: v = deq.popleft() lv = level[v] + 1 for w, cap, _ in G[v]: if cap and level[w] is None: level[w] = lv deq.append(w) return level[t] is not None def dfs(self, v, t, f): if v == t: return f level = self.level for e in self.it[v]: w, cap, rev = e if cap and level[v] < level[w]: d = self.dfs(w, t, min(f, cap)) if d: e[1] -= d rev[1] += d return d return 0 def flow(self, s, t): flow = 0 INF = 10**9 + 7 G = self.G while self.bfs(s, t): *self.it, = map(iter, self.G) f = INF while f: f = self.dfs(s, t, INF) flow += f return flow import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import log,gcd input = lambda :sys.stdin.readline() mi = lambda :map(int,input().split()) li = lambda :list(mi()) N,M,L = mi() G = Dinic(2+N+M) E = [tuple(mi()) for i in range(L)] for i in range(N): G.add_edge(0,i+1,1) for j in range(M): G.add_edge(N+1+j,N+M+1,1) for u,v in E: u,v = u-1,v-1 G.add_edge(u+1,v+N+1,1) G.flow(0,N+M+1) rest_edge = [[] for i in range(N+M+2)] for v in range(N+M+2): for w,cap,_ in G.G[v]: if cap: rest_edge[v].append(w) rest_edge = [set(rest_edge[v]) for v in range(N+M+2)] ans = ["Yes" for i in range(L)] start = [[] for i in range(N+1)] for i in range(L): u,v = E[i] start[u].append(i) for s in range(1,N+1): visit = [False] * (N+M+2) deq = deque([s]) visit[s] = True while deq: v = deq.popleft() for nv in rest_edge[v]: if not visit[nv]: visit[nv] = True deq.append(nv) for i in start[s]: u,v = E[i] v = v-1 + N + 1 if v in rest_edge[s]: ans[i] = "Yes" else: if visit[v]: ans[i] = "Yes" else: ans[i] = "No" print(*ans,sep="\n")