結果

問題 No.2523 Trick Flower
コンテスト
ユーザー MasKoaTS
提出日時 2023-10-26 17:20:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 599 ms / 4,000 ms
コード長 2,894 bytes
コンパイル時間 178 ms
コンパイル使用メモリ 82,152 KB
実行使用メモリ 260,332 KB
最終ジャッジ日時 2024-09-25 12:26:09
合計ジャッジ時間 10,231 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline


class SCC:
    def __init__(self, n):
        self.n = n
        self.route = [[] for _ in [0] * n]
        self.rev_route = [[] for _ in [0] * n]
        self.label = [-1] * n
        self.count = 0
    
    def add_edge(self, v_first, v_second):
        self.route[v_first].append(v_second)
        self.rev_route[v_second].append(v_first)

    def _build(self):
        self.v_list = []
        self.visited = set([])
        for v in range(self.n):
            if(v in self.visited):
                continue
            self._dfs(v)
        for v in reversed(self.v_list):
            if(self.label[v] != -1):
                continue
            self._rev_dfs(v)
            self.count += 1

    def _dfs(self, v_start):
        stack = [v_start, 0]
        while(stack):
            v, id = stack[-2:]
            if(id == 0 and v in self.visited):
                stack.pop()
                stack.pop()
                continue
            self.visited.add(v)
            if(id < len(self.route[v])):
                stack[-1] += 1
                stack.extend([self.route[v][id], 0])
                continue
            stack.pop()
            self.v_list.append(stack.pop())

    def _rev_dfs(self, v_start):
        stack = [v_start]
        self.label[v_start] = self.count
        while(stack):
            v_now = stack.pop()
            for v_next in self.rev_route[v_now]:
                if(self.label[v_next] != -1):
                    continue
                self.label[v_next] = self.count
                stack.append(v_next)

    def construct(self):
        self._build()
        dag = [[] for _ in [0] * self.count]
        groups = [[] for _ in [0] * self.count]
        for v, lb in enumerate(self.label):
            for v_next in self.route[v]:
                lb_next = self.label[v_next]
                if(lb == lb_next):
                    continue
                dag[lb].append(lb_next)
            groups[lb].append(v)
        return dag, groups


"""
Main Code
"""

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = [x - 1 for x in map(int, input().split())]

scc = SCC(N)
for i, x in enumerate(C):
    if(i == x):
        continue
    scc.add_edge(x, i)
dag, groups = scc.construct()

n = len(groups)
a = [sum(A[x] for x in group) for group in groups]
b = [sum(B[x] for x in group) for group in groups]
rtree = [-1] * n
for x, ys in enumerate(dag):
    for y in ys:
        rtree[y] = x

def check(mid):
    dp = [x - mid * y for x, y in zip(a, b)]
    for x in range(n - 1, -1, -1):
        y = rtree[x]
        if(y == -1 and dp[x] < 0):
            return False
        dp[y] += min(dp[x], 0)
    return True

ok = 0
ng = sum(a) // sum(b) + 1
while(abs(ok - ng) > 1):
    mid = (ok + ng) >> 1
    if check(mid):
        ok = mid
    else:
        ng = mid
print(ok)
0