結果

問題 No.483 マッチ並べ
ユーザー rlangevinrlangevin
提出日時 2024-02-14 12:16:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 96 ms / 2,000 ms
コード長 5,030 bytes
コンパイル時間 281 ms
コンパイル使用メモリ 82,404 KB
実行使用メモリ 80,664 KB
最終ジャッジ日時 2024-09-28 18:49:14
合計ジャッジ時間 7,158 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 82 ms
80,104 KB
testcase_01 AC 88 ms
80,352 KB
testcase_02 AC 85 ms
79,996 KB
testcase_03 AC 86 ms
80,296 KB
testcase_04 AC 88 ms
80,060 KB
testcase_05 AC 87 ms
80,016 KB
testcase_06 AC 86 ms
80,324 KB
testcase_07 AC 85 ms
79,996 KB
testcase_08 AC 87 ms
79,932 KB
testcase_09 AC 85 ms
80,372 KB
testcase_10 AC 86 ms
79,984 KB
testcase_11 AC 87 ms
80,384 KB
testcase_12 AC 85 ms
80,248 KB
testcase_13 AC 86 ms
80,048 KB
testcase_14 AC 87 ms
80,372 KB
testcase_15 AC 88 ms
80,112 KB
testcase_16 AC 84 ms
80,128 KB
testcase_17 AC 85 ms
80,008 KB
testcase_18 AC 81 ms
80,664 KB
testcase_19 AC 85 ms
80,228 KB
testcase_20 AC 86 ms
80,316 KB
testcase_21 AC 88 ms
80,012 KB
testcase_22 AC 86 ms
80,316 KB
testcase_23 AC 86 ms
80,016 KB
testcase_24 AC 86 ms
80,196 KB
testcase_25 AC 85 ms
80,264 KB
testcase_26 AC 86 ms
79,776 KB
testcase_27 AC 91 ms
79,688 KB
testcase_28 AC 90 ms
79,696 KB
testcase_29 AC 92 ms
79,760 KB
testcase_30 AC 89 ms
80,104 KB
testcase_31 AC 94 ms
79,908 KB
testcase_32 AC 91 ms
79,796 KB
testcase_33 AC 89 ms
79,884 KB
testcase_34 AC 88 ms
79,848 KB
testcase_35 AC 87 ms
80,152 KB
testcase_36 AC 86 ms
79,976 KB
testcase_37 AC 86 ms
80,040 KB
testcase_38 AC 88 ms
79,932 KB
testcase_39 AC 86 ms
79,732 KB
testcase_40 AC 91 ms
79,756 KB
testcase_41 AC 86 ms
79,704 KB
testcase_42 AC 86 ms
79,648 KB
testcase_43 AC 92 ms
79,408 KB
testcase_44 AC 89 ms
80,548 KB
testcase_45 AC 86 ms
79,944 KB
testcase_46 AC 83 ms
79,920 KB
testcase_47 AC 86 ms
79,696 KB
testcase_48 AC 90 ms
79,648 KB
testcase_49 AC 87 ms
79,884 KB
testcase_50 AC 96 ms
79,716 KB
testcase_51 AC 89 ms
79,716 KB
testcase_52 AC 88 ms
79,492 KB
testcase_53 AC 83 ms
79,880 KB
testcase_54 AC 86 ms
80,340 KB
testcase_55 AC 85 ms
80,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#https://github.com/not522/ac-library-python/blob/master/atcoder/maxflow.py
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int

    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None

    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []

    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m

    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )

    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]

    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow

    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))

        current_edge = [0] * self._n
        level = [0] * self._n

        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value

        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False

        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0

        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow

    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited
    
    
N = int(input())
M = 10 ** 4
G = MFGraph(N + M + 2)
s, g = 0, N + M + 1
for i in range(N):
    r0, c0, r1, c1 = map(int, input().split())
    n0 = (r0 - 1) * 100 + c0 - 1 + N + 1
    n1 = (r1 - 1) * 100 + c1 - 1 + N + 1
    G.add_edge(s, i + 1, 1)
    G.add_edge(i + 1, n0, 1)
    G.add_edge(i + 1, n1, 1)
    
for r in range(100):
    for c in range(100):
        n = r * 100 + c + N + 1
        G.add_edge(n, g, 1)
        
print("YES") if G.flow(s, g) == N else print("NO")
0