結果

問題 No.2523 Trick Flower
ユーザー MasKoaTSMasKoaTS
提出日時 2023-04-01 17:13:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 929 ms / 4,000 ms
コード長 2,462 bytes
コンパイル時間 460 ms
コンパイル使用メモリ 82,232 KB
実行使用メモリ 262,456 KB
最終ジャッジ日時 2024-09-25 05:56:00
合計ジャッジ時間 14,512 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,800 KB
testcase_01 AC 41 ms
52,892 KB
testcase_02 AC 40 ms
53,684 KB
testcase_03 AC 39 ms
52,648 KB
testcase_04 AC 39 ms
54,220 KB
testcase_05 AC 40 ms
54,572 KB
testcase_06 AC 40 ms
53,620 KB
testcase_07 AC 42 ms
54,732 KB
testcase_08 AC 87 ms
77,060 KB
testcase_09 AC 80 ms
76,856 KB
testcase_10 AC 56 ms
65,904 KB
testcase_11 AC 60 ms
67,244 KB
testcase_12 AC 57 ms
65,516 KB
testcase_13 AC 74 ms
75,160 KB
testcase_14 AC 73 ms
73,424 KB
testcase_15 AC 929 ms
262,456 KB
testcase_16 AC 896 ms
260,812 KB
testcase_17 AC 354 ms
150,580 KB
testcase_18 AC 293 ms
137,240 KB
testcase_19 AC 865 ms
219,972 KB
testcase_20 AC 809 ms
260,820 KB
testcase_21 AC 786 ms
254,508 KB
testcase_22 AC 777 ms
260,776 KB
testcase_23 AC 784 ms
225,032 KB
testcase_24 AC 504 ms
190,780 KB
testcase_25 AC 687 ms
260,912 KB
testcase_26 AC 650 ms
232,412 KB
testcase_27 AC 690 ms
260,656 KB
testcase_28 AC 606 ms
223,312 KB
testcase_29 AC 208 ms
107,124 KB
testcase_30 AC 554 ms
232,328 KB
testcase_31 AC 134 ms
79,292 KB
testcase_32 AC 384 ms
172,928 KB
testcase_33 AC 800 ms
259,768 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]
		group = [[] 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)
			group[lb].append(v)
		return dag, group



"""
Main Code
"""

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
c = list(map(int, input().split()))

scc = SCC(N)
for i, k in enumerate(c):
	if(i == k - 1):
		continue
	scc.add_edge(k - 1, i)
dag, groups = scc.construct()

n = len(groups)
a = [0] * n
b = [0] * n
for i, g in enumerate(groups):
	a[i] = sum(A[k] for k in g)
	b[i] = sum(B[k] for k in g)

rdag = [[] for _ in [0] * n]
for i, lis in enumerate(dag):
	for v in lis:
		rdag[v].append(i)

def check(mid):
	visited = set([])
	dp = [aa - mid * bb for aa, bb in zip(a, b)]
	for x in range(n - 1, -1, -1):
		if(x in visited):
			continue
		visited.add(x)
		if(dp[x] > 0):
			dp[x] = 0
		if(not(rdag[x]) and dp[x] < 0):
			return False
		for y in rdag[x]:
			dp[y] += dp[x]
	return True

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