結果

問題 No.2523 Trick Flower
ユーザー ShirotsumeShirotsume
提出日時 2023-10-25 12:28:59
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
TLE  
実行時間 -
コード長 3,146 bytes
コンパイル時間 182 ms
コンパイル使用メモリ 12,400 KB
実行使用メモリ 286,624 KB
最終ジャッジ日時 2023-10-25 12:30:35
合計ジャッジ時間 60,410 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
10,788 KB
testcase_01 AC 32 ms
10,784 KB
testcase_02 AC 34 ms
10,784 KB
testcase_03 AC 33 ms
10,784 KB
testcase_04 AC 35 ms
10,784 KB
testcase_05 AC 33 ms
10,788 KB
testcase_06 AC 33 ms
10,784 KB
testcase_07 AC 35 ms
10,892 KB
testcase_08 AC 50 ms
12,316 KB
testcase_09 AC 50 ms
12,844 KB
testcase_10 AC 36 ms
11,008 KB
testcase_11 AC 39 ms
11,500 KB
testcase_12 AC 38 ms
11,260 KB
testcase_13 AC 44 ms
12,052 KB
testcase_14 AC 42 ms
12,052 KB
testcase_15 TLE -
testcase_16 AC 9,915 ms
107,520 KB
testcase_17 AC 9,632 ms
286,624 KB
testcase_18 AC 855 ms
222,004 KB
testcase_19 AC 2,219 ms
164,964 KB
testcase_20 AC 3,070 ms
189,728 KB
testcase_21 AC 3,295 ms
189,576 KB
testcase_22 AC 2,082 ms
181,404 KB
testcase_23 AC 2,005 ms
142,232 KB
testcase_24 AC 1,248 ms
111,192 KB
testcase_25 AC 1,063 ms
151,920 KB
testcase_26 AC 5,047 ms
189,396 KB
testcase_27 AC 1,349 ms
206,628 KB
testcase_28 AC 1,924 ms
164,484 KB
testcase_29 AC 201 ms
49,548 KB
testcase_30 AC 1,200 ms
133,820 KB
testcase_31 AC 96 ms
21,676 KB
testcase_32 AC 531 ms
87,768 KB
testcase_33 AC 1,878 ms
222,140 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def scc(N,edges):
    M=len(edges)
    start=[0]*(N+1)
    elist=[0]*M
    for e in edges:
        start[e[0]+1]+=1
    for i in range(1,N+1):
        start[i]+=start[i-1]
    counter=start[:]
    for e in edges:
        elist[counter[e[0]]]=e[1]
        counter[e[0]]+=1
    visited=[]
    low=[0]*N
    Ord=[-1]*N
    ids=[0]*N
    NG=[0,0]
    def dfs(v):
        stack=[(v,-1,0),(v,-1,1)]
        while stack:
            v,bef,t=stack.pop()
            if t:
                if bef!=-1 and Ord[v]!=-1:
                    low[bef]=min(low[bef],Ord[v])
                    stack.pop()
                    continue
                low[v]=NG[0]
                Ord[v]=NG[0]
                NG[0]+=1
                visited.append(v)
                for i in range(start[v],start[v+1]):
                    to=elist[i]
                    if Ord[to]==-1:
                        stack.append((to,v,0))
                        stack.append((to,v,1))
                    else:
                        low[v]=min(low[v],Ord[to])
            else:
                if low[v]==Ord[v]:
                    while(True):
                        u=visited.pop()
                        Ord[u]=N
                        ids[u]=NG[1]
                        if u==v:
                            break
                    NG[1]+=1
                low[bef]=min(low[bef],low[v])
    for i in range(N):
        if Ord[i]==-1:
            dfs(i)
    for i in range(N):
        ids[i]=NG[1]-1-ids[i]
    group_num=NG[1]
    counts=[0]*group_num
    for x in ids:
        counts[x]+=1
    groups=[[] for i in range(group_num)]
    for i in range(N):
        groups[ids[i]].append(i)
    return groups

import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
sys.setrecursionlimit(10 ** 6)
n = ii()

a = li()

b = li()

c = li()
E = []
for i in range(n):
    E.append((c[i] - 1, i))
    
groups = scc(n, E)

leader = [0] * n
cnt = 0
for v in groups:
    for x in v:
        leader[x] = cnt
    cnt += 1
A = [0] * cnt
B = [0] * cnt

for i in range(n):
    A[leader[i]] += a[i]
    B[leader[i]] += b[i]
    
graph = [[] for _ in range(cnt)]
S = set()
for u, v in E:
    if leader[v] != leader[u]:
        S.add((leader[u], leader[v]))

for u, v in S:
    graph[u].append(v)

def f(x):
    dp = [0] * cnt
    r = [0] * cnt
    c = [0] * cnt
    visit = [False] * cnt
    def dfs(now):
        if visit[now]:
            return dp[now]
        visit[now] = True
        for to in graph[now]:
            r[now] += dfs(to)
            c[to] += 1
        dp[now] = min(0, A[now] - x * B[now] + r[now])
       
        return dp[now]
    
    
    for now in range(cnt):
        dfs(now)
        if c[now] == 0:
            if dp[now] == 0:
                pass
            else:
                return False
    return True
ok = 0
ng = 10 ** 15
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if f(mid):
        ok = mid
    else:
        ng = mid
        
print(ok)
0