結果
問題 | No.119 旅行のツアーの問題 |
ユーザー | vwxyz |
提出日時 | 2021-07-20 01:27:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 163 ms / 5,000 ms |
コード長 | 5,534 bytes |
コンパイル時間 | 528 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 90,156 KB |
最終ジャッジ日時 | 2024-07-17 13:39:12 |
合計ジャッジ時間 | 4,808 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 154 ms
89,596 KB |
testcase_01 | AC | 161 ms
90,156 KB |
testcase_02 | AC | 156 ms
89,344 KB |
testcase_03 | AC | 150 ms
89,344 KB |
testcase_04 | AC | 148 ms
89,500 KB |
testcase_05 | AC | 150 ms
89,216 KB |
testcase_06 | AC | 163 ms
89,984 KB |
testcase_07 | AC | 150 ms
89,344 KB |
testcase_08 | AC | 152 ms
89,600 KB |
testcase_09 | AC | 148 ms
89,492 KB |
testcase_10 | AC | 147 ms
89,344 KB |
testcase_11 | AC | 147 ms
89,344 KB |
testcase_12 | AC | 147 ms
89,600 KB |
testcase_13 | AC | 150 ms
89,300 KB |
testcase_14 | AC | 149 ms
89,408 KB |
testcase_15 | AC | 149 ms
89,344 KB |
testcase_16 | AC | 155 ms
89,608 KB |
testcase_17 | AC | 151 ms
89,472 KB |
testcase_18 | AC | 146 ms
89,472 KB |
testcase_19 | AC | 148 ms
89,216 KB |
testcase_20 | AC | 157 ms
89,812 KB |
testcase_21 | AC | 159 ms
89,280 KB |
testcase_22 | AC | 158 ms
89,636 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines 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(readline()) MFG=MFGraph(2*N+2) inf=1<<60 ans=0 for i in range(N): B,C=map(int,readline().split()) m=max(B,C) ans+=m MFG.add_edge(0,i+1,m-B) MFG.add_edge(i+1,i+N+1,m) MFG.add_edge(i+N+1,2*N+1,m-C) MFG.add_edge(i+N+1,i+1,inf) M=int(readline()) for _ in range(M): D,E=map(int,readline().split()) MFG.add_edge(E+N+1,D+1,inf) ans-=MFG.flow(0,2*N+1) print(ans)