結果

問題 No.1868 Teleporting Cyanmond
ユーザー 已经死了
提出日時 2024-06-25 23:24:18
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 371 ms / 2,000 ms
コード長 4,803 bytes
コンパイル時間 251 ms
コンパイル使用メモリ 82,708 KB
実行使用メモリ 116,104 KB
最終ジャッジ日時 2024-06-25 23:24:31
合計ジャッジ時間 9,107 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import os,sys,random,threading
#sys.exit() 退
#sys.setrecursionlimit(10**6) #
from random import randint,choice,shuffle
#randint(a,b)[a,b]
#choice(seq)seq,,seq
#shuffle(x)x
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,)
from bisect import bisect_left,bisect_right
#bisect_left(x) x
#bisect_right(x) x
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)alist[0]
#combinations(a,k)ak
#permutations(a,k)ak
from heapq import heapify,heappop,heappush
#heapify
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceilfloor sqrt factorial
from decimal import Decimal,getcontext
#Decimal(s) Decimal,使
#getcontext().prec=100
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] #
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗
class Interval_Edge_Graph: #[l,r)0
def __init__(self,N,weighted=False):
self.N=N
self.weighted=weighted
self.graph=[[] for x in range(self.N*3)]
for i in range(1,self.N):
a,b=i<<1,i<<1|1
self.graph[(a-self.N)%(2*self.N)].append((i+self.N,0) if self.weighted else i+self.N)
self.graph[(b-self.N)%(2*self.N)].append((i+self.N,0) if self.weighted else i+self.N)
self.graph[i+2*self.N].append(((a-self.N)%(3*self.N),0) if self.weighted else (a-self.N)%(3*self.N))
self.graph[i+2*self.N].append(((b-self.N)%(3*self.N),0) if self.weighted else (b-self.N)%(3*self.N))
def Add_Edge(self,from_range,to_range,w=None):
if self.weighted:
assert w!=None
self.graph.append([])
l,r=from_range
if 0<=l<=self.N:
l+=self.N
else:
raise IndexError("list index out of range")
if 0<=r<=self.N:
r+=self.N
else:
raise IndexError("list index out of range")
while l<r:
if l&1:
self.graph[(l-self.N)%(2*self.N)].append((len(self.graph)-1,w) if self.weighted else len(self.graph)-1)
l+=1
if r&1:
r-=1
self.graph[(r-self.N)%(2*self.N)].append((len(self.graph)-1,w) if self.weighted else len(self.graph)-1)
l>>=1
r>>=1
l,r=to_range
if 0<=l<=self.N:
l+=self.N
else:
raise IndexError("list index out of range")
if 0<=r<=self.N:
r+=self.N
else:
raise IndexError("list index out of range")
while l<r:
if l&1:
self.graph[len(self.graph)-1].append(((l-self.N)%(3*self.N),w) if self.weighted else (l-self.N)%(2*self.N))
l+=1
if r&1:
r-=1
self.graph[len(self.graph)-1].append(((r-self.N)%(3*self.N),w) if self.weighted else (r-self.N)%(2*self.N))
l>>=1
r>>=1
def Edges(self):
edges=[]
for x in range(len(self.graph)):
for y in self.graph[x]:
if self.weighted:
y,d=y
edges.append((x,y,d))
else:
edges.append((x,y))
def dijkstra(g, start):
dist = [inf] * len(g)
dist[start] = 0
h = [(0, start)]
while h:
d, x = heappop(h)
if d > dist[x]:
continue
for y, wt in g[x]:
new_d = dist[x] + wt
if new_d < dist[y]:
dist[y] = new_d
heappush(h, (new_d, y))
return dist
n=ii()
g=[[] for _ in range(n+1)]
for u,v in enumerate(li(),1):
g[u].append((v,1))
for i in range(1,n):
g[i+1].append((i,0))
dij=dijkstra(g,1)
print(dij[n])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0