結果

問題 No.1744 Selfish Spies 1 (à la Princess' Perfectionism)
コンテスト
ユーザー chineristAC
提出日時 2021-11-14 21:32:52
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,375 ms / 5,000 ms
コード長 2,942 bytes
コンパイル時間 198 ms
コンパイル使用メモリ 81,888 KB
実行使用メモリ 118,800 KB
最終ジャッジ日時 2024-11-30 06:36:34
合計ジャッジ時間 14,018 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff # 

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")
0