結果

問題 No.2523 Trick Flower
ユーザー MasKoaTSMasKoaTS
提出日時 2023-10-26 17:00:50
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 680 ms / 4,000 ms
コード長 2,359 bytes
コンパイル時間 301 ms
コンパイル使用メモリ 81,836 KB
実行使用メモリ 260,144 KB
最終ジャッジ日時 2023-10-26 17:01:02
合計ジャッジ時間 11,669 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
53,568 KB
testcase_01 AC 35 ms
53,568 KB
testcase_02 AC 36 ms
53,568 KB
testcase_03 AC 36 ms
53,568 KB
testcase_04 AC 36 ms
53,568 KB
testcase_05 AC 36 ms
53,568 KB
testcase_06 AC 37 ms
53,568 KB
testcase_07 AC 37 ms
53,568 KB
testcase_08 AC 98 ms
73,732 KB
testcase_09 AC 67 ms
72,584 KB
testcase_10 AC 49 ms
63,904 KB
testcase_11 AC 50 ms
63,904 KB
testcase_12 AC 50 ms
63,916 KB
testcase_13 AC 67 ms
72,580 KB
testcase_14 AC 65 ms
70,528 KB
testcase_15 AC 680 ms
260,144 KB
testcase_16 AC 615 ms
259,620 KB
testcase_17 AC 280 ms
132,488 KB
testcase_18 AC 245 ms
122,588 KB
testcase_19 AC 585 ms
239,176 KB
testcase_20 AC 595 ms
208,188 KB
testcase_21 AC 596 ms
212,516 KB
testcase_22 AC 588 ms
202,116 KB
testcase_23 AC 621 ms
194,120 KB
testcase_24 AC 349 ms
154,228 KB
testcase_25 AC 523 ms
176,036 KB
testcase_26 AC 496 ms
183,808 KB
testcase_27 AC 522 ms
189,212 KB
testcase_28 AC 477 ms
182,456 KB
testcase_29 AC 170 ms
87,984 KB
testcase_30 AC 400 ms
148,624 KB
testcase_31 AC 124 ms
78,792 KB
testcase_32 AC 266 ms
116,220 KB
testcase_33 AC 553 ms
216,924 KB
権限があれば一括ダウンロードができます

ソースコード

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 = [0] * n
b = [0] * n
for i, group in enumerate(groups):
	a[i] = sum(A[x] for x in group)
	b[i] = sum(B[x] for x in group)
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