結果

問題 No.1480 Many Complete Graphs
ユーザー 已经死了已经死了
提出日時 2024-06-26 14:03:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 727 ms / 2,000 ms
コード長 2,790 bytes
コンパイル時間 313 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 154,740 KB
最終ジャッジ日時 2024-06-26 14:04:20
合計ジャッジ時間 27,311 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

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)] # →↘↓↙←↖↑↗
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,m=li()
g=[[] for _ in range(n+4*m+10)]
for i in range(1,m+1):
s=li()
c=s[1]
s=s[2:]
for x in s:
if x%2==0:
g[x].append([n+4*i+1,x+c])
g[x].append([n+4*i+2,x+c])
g[n+4*i+2].append([x,x+c])
g[n+4*i+4].append([x,x+c])
else:
g[x].append([n+4*i+3,x+c])
g[x].append([n+4*i+4,x+c+1])
g[n+4*i+1].append([x,x+c+1])
g[n+4*i+3].append([x,x+c])
dij=dijkstra(g,1)
if dij[n]==inf:
print(-1)
else:
print(dij[n]//2)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0