結果
問題 | No.119 旅行のツアーの問題 |
ユーザー | Mao-beta |
提出日時 | 2024-03-11 11:43:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 95 ms / 5,000 ms |
コード長 | 5,569 bytes |
コンパイル時間 | 224 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 78,720 KB |
最終ジャッジ日時 | 2024-09-29 21:49:08 |
合計ジャッジ時間 | 2,716 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
68,992 KB |
testcase_01 | AC | 74 ms
71,936 KB |
testcase_02 | AC | 67 ms
68,480 KB |
testcase_03 | AC | 64 ms
68,224 KB |
testcase_04 | AC | 64 ms
68,224 KB |
testcase_05 | AC | 65 ms
69,248 KB |
testcase_06 | AC | 76 ms
73,600 KB |
testcase_07 | AC | 64 ms
68,608 KB |
testcase_08 | AC | 64 ms
68,608 KB |
testcase_09 | AC | 63 ms
68,352 KB |
testcase_10 | AC | 67 ms
68,224 KB |
testcase_11 | AC | 65 ms
68,480 KB |
testcase_12 | AC | 65 ms
68,352 KB |
testcase_13 | AC | 72 ms
68,480 KB |
testcase_14 | AC | 72 ms
68,992 KB |
testcase_15 | AC | 74 ms
68,992 KB |
testcase_16 | AC | 77 ms
73,216 KB |
testcase_17 | AC | 64 ms
68,352 KB |
testcase_18 | AC | 64 ms
68,864 KB |
testcase_19 | AC | 67 ms
68,608 KB |
testcase_20 | AC | 75 ms
72,832 KB |
testcase_21 | AC | 80 ms
73,216 KB |
testcase_22 | AC | 95 ms
78,720 KB |
ソースコード
import sys import math import bisect from heapq import heapify, heappop, heappush from collections import deque, defaultdict, Counter from functools import lru_cache from itertools import accumulate, combinations, permutations, product sys.setrecursionlimit(1000000) MOD = 10 ** 9 + 7 MOD99 = 998244353 input = lambda: sys.stdin.readline().strip() NI = lambda: int(input()) NMI = lambda: map(int, input().split()) NLI = lambda: list(NMI()) SI = lambda: input() SMI = lambda: input().split() SLI = lambda: list(SMI()) EI = lambda m: [NLI() for _ in range(m)] # ACL_maxflow(Dinic) 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 def main(): N = NI() BC = EI(N) M = NI() DE = EI(M) # フロー # https://t98slider.hatenablog.com/entry/2022/05/25/212342 S = 2*N T = S+1 G = MFGraph(N*2+2) ans = 0 INF = 10**10 for i, (b, c) in enumerate(BC): m = b+c ans += m G.add_edge(S, i, m-c) G.add_edge(i, i+N, m-0) G.add_edge(i+N, T, m-b) for d, e in DE: G.add_edge(d+N, e, INF) f = G.flow(S, T) print(ans-f) if __name__ == "__main__": main()