結果

問題 No.3173 じゃんけんの勝ちの回数
ユーザー tassei903
提出日時 2025-06-06 22:04:03
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 447 ms / 2,000 ms
コード長 2,533 bytes
コンパイル時間 202 ms
コンパイル使用メモリ 82,632 KB
実行使用メモリ 83,624 KB
最終ジャッジ日時 2025-06-06 22:04:19
合計ジャッジ時間 12,989 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
n = 3
def solver(a, b):
    a = list(a)
    b = list(b)
    ans = 0
    for i in range(n):
        d = min(a[i], b[(i+1) % 3])
        a[i] -= d
        b[(i + 1) % 3] -= d
        ans += d
    return ans

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
inf = 10 ** 18
def solvel(a, b):
    dinic = Dinic(n * 2 + 2)
    S = n * 2
    T = n * 2 + 1
    for i in range(n):
        dinic.add_edge(i, i + n, inf)
        dinic.add_edge(i, (i - 1) % 3 + n, inf)
        dinic.add_edge(S, i, a[i])
        dinic.add_edge(i + n, T, b[i])
    return sum(a) - dinic.flow(S, T)

for _ in range(ni()):
    a = na()
    b = na()
    print(solvel(a, b), solver(a, b))
0