結果
問題 | 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 |
ソースコード
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 deepcopyfrom io import BytesIO,IOBasefrom types import GeneratorTypefrom 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,dequefrom itertools import accumulate,combinations,permutations#accumulate(a)用a序列生成一个累积迭代器,一般list化前面放个[0]做前缀和用#combinations(a,k)a序列选k个 组合迭代器#permutations(a,k)a序列选k个 排列迭代器from heapq import heapify,heappop,heappush#heapify将列表转为堆from typing import Generic,Iterable,Iterator,TypeVar,Union,Listfrom string import ascii_lowercase,ascii_uppercase,digits#小写字母,大写字母,十进制数字from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf#ceil向上取整,floor向下取整 ,sqrt开方 ,factorial阶乘from decimal import Decimal,getcontext#Decimal(s) 实例化Decimal对象,一般使用字符串#getcontext().prec=100 修改精度from sys import stdin, stdout, setrecursionlimitinput = 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) #998244353inf = 1<<60py = 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=Nself.weighted=weightedself.graph=[[] for x in range(self.N*3)]for i in range(1,self.N):a,b=i<<1,i<<1|1self.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!=Noneself.graph.append([])l,r=from_rangeif 0<=l<=self.N:l+=self.Nelse:raise IndexError("list index out of range")if 0<=r<=self.N:r+=self.Nelse: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+=1if r&1:r-=1self.graph[(r-self.N)%(2*self.N)].append((len(self.graph)-1,w) if self.weighted else len(self.graph)-1)l>>=1r>>=1l,r=to_rangeif 0<=l<=self.N:l+=self.Nelse:raise IndexError("list index out of range")if 0<=r<=self.N:r+=self.Nelse: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+=1if r&1:r-=1self.graph[len(self.graph)-1].append(((r-self.N)%(3*self.N),w) if self.weighted else (r-self.N)%(2*self.N))l>>=1r>>=1def Edges(self):edges=[]for x in range(len(self.graph)):for y in self.graph[x]:if self.weighted:y,d=yedges.append((x,y,d))else:edges.append((x,y))def dijkstra(g, start):dist = [inf] * len(g)dist[start] = 0h = [(0, start)]while h:d, x = heappop(h)if d > dist[x]:continuefor y, wt in g[x]:new_d = dist[x] + wtif new_d < dist[y]:dist[y] = new_dheappush(h, (new_d, y))return distn=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])