結果
問題 | No.2523 Trick Flower |
ユーザー |
|
提出日時 | 2023-10-25 12:28:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,315 ms / 4,000 ms |
コード長 | 3,146 bytes |
コンパイル時間 | 497 ms |
コンパイル使用メモリ | 82,196 KB |
実行使用メモリ | 356,384 KB |
最終ジャッジ日時 | 2024-09-25 05:49:41 |
合計ジャッジ時間 | 26,590 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
def scc(N,edges):M=len(edges)start=[0]*(N+1)elist=[0]*Mfor e in edges:start[e[0]+1]+=1for 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]]+=1visited=[]low=[0]*NOrd=[-1]*Nids=[0]*NNG=[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()continuelow[v]=NG[0]Ord[v]=NG[0]NG[0]+=1visited.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]=Nids[u]=NG[1]if u==v:breakNG[1]+=1low[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_numfor x in ids:counts[x]+=1groups=[[] for i in range(group_num)]for i in range(N):groups[ids[i]].append(i)return groupsimport sys, time, randomfrom collections import deque, Counter, defaultdictinput = lambda: sys.stdin.readline().rstrip()ii = lambda: int(input())mi = lambda: map(int, input().split())li = lambda: list(mi())inf = 2 ** 63 - 1mod = 998244353sys.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] * ncnt = 0for v in groups:for x in v:leader[x] = cntcnt += 1A = [0] * cntB = [0] * cntfor 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] * cntr = [0] * cntc = [0] * cntvisit = [False] * cntdef dfs(now):if visit[now]:return dp[now]visit[now] = Truefor to in graph[now]:r[now] += dfs(to)c[to] += 1dp[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:passelse:return Falsereturn Trueok = 0ng = 10 ** 15while abs(ok - ng) > 1:mid = (ok + ng) // 2if f(mid):ok = midelse:ng = midprint(ok)