結果

問題 No.119 旅行のツアーの問題
ユーザー maspymaspy
提出日時 2020-03-25 22:16:55
言語 Python3
(3.11.6 + numpy 1.26.0 + scipy 1.11.3)
結果
AC  
実行時間 23 ms / 5,000 ms
コード長 3,495 bytes
コンパイル時間 941 ms
コンパイル使用メモリ 11,324 KB
実行使用メモリ 9,116 KB
最終ジャッジ日時 2023-08-30 11:49:09
合計ジャッジ時間 2,669 ms
ジャッジサーバーID
(参考情報)
judge13 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
8,992 KB
testcase_01 AC 22 ms
8,852 KB
testcase_02 AC 20 ms
8,812 KB
testcase_03 AC 20 ms
8,816 KB
testcase_04 AC 20 ms
8,856 KB
testcase_05 AC 21 ms
8,816 KB
testcase_06 AC 22 ms
8,976 KB
testcase_07 AC 20 ms
8,820 KB
testcase_08 AC 20 ms
8,868 KB
testcase_09 AC 21 ms
8,988 KB
testcase_10 AC 20 ms
8,964 KB
testcase_11 AC 21 ms
8,988 KB
testcase_12 AC 21 ms
8,904 KB
testcase_13 AC 20 ms
8,960 KB
testcase_14 AC 20 ms
8,848 KB
testcase_15 AC 20 ms
8,972 KB
testcase_16 AC 22 ms
9,056 KB
testcase_17 AC 20 ms
8,904 KB
testcase_18 AC 21 ms
8,952 KB
testcase_19 AC 21 ms
8,812 KB
testcase_20 AC 21 ms
9,032 KB
testcase_21 AC 23 ms
9,116 KB
testcase_22 AC 23 ms
9,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque


class Dinic:
    def __init__(self, N, source, sink):
        self.N = N
        self.G = [[] for _ in range(N)]
        self.source = source
        self.sink = sink

    def add_edge(self, fr, to, cap):
        n1 = len(self.G[fr])
        n2 = len(self.G[to])
        self.G[fr].append([to, cap, n2])
        self.G[to].append([fr, 0, n1])  # 逆辺を cap 0 で追加

    def add_edge_undirected(self, fr, to, cap):
        n1 = len(self.G[fr])
        n2 = len(self.G[to])
        self.G[fr].append([to, cap, n2])
        self.G[to].append([fr, cap, n1])

    def bfs(self):
        level = [0] * self.N
        G = self.G
        source = self.source
        sink = self.sink
        q = deque([source])
        level[source] = 1
        pop = q.popleft
        append = q.append
        while q:
            v = pop()
            lv = level[v] + 1
            for to, cap, rev in G[v]:
                if not cap:
                    continue
                if level[to]:
                    continue
                level[to] = lv
                if to == sink:
                    self.level = level
                    return
                append(to)
        self.level = level

    def dfs(self):
        INF = 10**18
        G = self.G
        sink = self.sink
        prog = self.progress
        level = self.level
        ascend = False
        ff = 0
        stack = [(self.source, INF)]
        while stack:
            if ff:
                # このまま更新だけして戻っていく
                v, f = stack.pop()
                p = prog[v]
                to, cap, rev = G[v][p]
                G[v][p][1] -= ff
                G[to][rev][1] += ff
                continue
            v, f = stack[-1]
            if v == sink:
                ff = f
                stack.pop()
                continue
            E = G[v]
            lv = level[v]
            if ascend:
                # 流せずに戻ってきた
                prog[v] += 1
            find_flag = False
            for i in range(prog[v], len(E)):
                to, cap, rev = E[i]
                prog[v] = i
                if not cap:
                    continue
                if level[to] <= lv:
                    continue
                find_flag = True
                break
            if not find_flag:
                ascend = True
                stack.pop()
                continue
            ascend = False
            x = f if f < cap else cap
            stack.append((to, x))
        return ff

    def max_flow(self):
        flow = 0
        while True:
            self.bfs()
            if not self.level[self.sink]:
                return flow
            self.progress = [0] * self.N
            while True:
                f = self.dfs()
                if not f:
                    break
                flow += f
        return flow


N = int(readline())
source = N + N
sink = N + N + 1
dinic = Dinic(N + N + 2, source, sink)
X = 100
INF = 10 ** 9
add = dinic.add_edge

for i in range(N):
    B, C = map(int, readline().split())
    add(source, i, X - C)
    add(i, i + N, X)
    add(i + N, sink, X - B)
    add(i + N, i, INF)

M = int(readline())
m = map(int, read().split())
for D, E in zip(m, m):
    add(D + N, E, INF)


f = dinic.max_flow()
answer = X * N - f
print(answer)
0