結果

問題 No.2523 Trick Flower
ユーザー MasKoaTSMasKoaTS
提出日時 2023-04-01 17:13:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 825 ms / 4,000 ms
コード長 2,462 bytes
コンパイル時間 226 ms
コンパイル使用メモリ 81,868 KB
実行使用メモリ 262,076 KB
最終ジャッジ日時 2023-10-25 21:08:45
合計ジャッジ時間 12,445 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
53,552 KB
testcase_01 AC 35 ms
53,552 KB
testcase_02 AC 34 ms
53,552 KB
testcase_03 AC 37 ms
53,552 KB
testcase_04 AC 34 ms
53,552 KB
testcase_05 AC 33 ms
53,552 KB
testcase_06 AC 34 ms
53,552 KB
testcase_07 AC 36 ms
53,552 KB
testcase_08 AC 77 ms
76,632 KB
testcase_09 AC 72 ms
76,244 KB
testcase_10 AC 49 ms
66,104 KB
testcase_11 AC 54 ms
66,380 KB
testcase_12 AC 51 ms
66,192 KB
testcase_13 AC 67 ms
74,336 KB
testcase_14 AC 65 ms
73,280 KB
testcase_15 AC 825 ms
262,076 KB
testcase_16 AC 801 ms
261,580 KB
testcase_17 AC 285 ms
150,092 KB
testcase_18 AC 239 ms
137,276 KB
testcase_19 AC 713 ms
219,664 KB
testcase_20 AC 686 ms
260,612 KB
testcase_21 AC 694 ms
254,264 KB
testcase_22 AC 670 ms
260,696 KB
testcase_23 AC 680 ms
224,220 KB
testcase_24 AC 426 ms
190,580 KB
testcase_25 AC 578 ms
260,660 KB
testcase_26 AC 542 ms
231,756 KB
testcase_27 AC 595 ms
260,156 KB
testcase_28 AC 520 ms
223,100 KB
testcase_29 AC 182 ms
106,800 KB
testcase_30 AC 470 ms
232,192 KB
testcase_31 AC 121 ms
78,924 KB
testcase_32 AC 312 ms
172,912 KB
testcase_33 AC 647 ms
259,732 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