結果
問題 | No.1601 With Animals into Institute |
ユーザー | Keroru |
提出日時 | 2021-07-10 14:52:13 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,683 ms / 3,000 ms |
コード長 | 4,425 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 151,436 KB |
最終ジャッジ日時 | 2023-09-14 19:29:06 |
合計ジャッジ時間 | 29,734 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
83,176 KB |
testcase_01 | AC | 229 ms
83,260 KB |
testcase_02 | AC | 232 ms
83,248 KB |
testcase_03 | AC | 318 ms
84,764 KB |
testcase_04 | AC | 319 ms
84,796 KB |
testcase_05 | AC | 321 ms
84,476 KB |
testcase_06 | AC | 1,538 ms
149,584 KB |
testcase_07 | AC | 1,573 ms
150,760 KB |
testcase_08 | AC | 1,559 ms
150,452 KB |
testcase_09 | AC | 1,683 ms
150,400 KB |
testcase_10 | AC | 1,652 ms
150,964 KB |
testcase_11 | AC | 1,617 ms
148,660 KB |
testcase_12 | AC | 1,618 ms
149,080 KB |
testcase_13 | AC | 1,629 ms
151,436 KB |
testcase_14 | AC | 1,662 ms
150,444 KB |
testcase_15 | AC | 1,672 ms
150,936 KB |
testcase_16 | AC | 1,629 ms
149,188 KB |
testcase_17 | AC | 1,606 ms
148,132 KB |
testcase_18 | AC | 329 ms
84,592 KB |
testcase_19 | AC | 321 ms
84,388 KB |
testcase_20 | AC | 317 ms
84,596 KB |
testcase_21 | AC | 310 ms
84,480 KB |
testcase_22 | AC | 306 ms
84,760 KB |
testcase_23 | AC | 311 ms
84,572 KB |
testcase_24 | AC | 319 ms
84,524 KB |
testcase_25 | AC | 322 ms
84,812 KB |
testcase_26 | AC | 316 ms
84,564 KB |
testcase_27 | AC | 229 ms
83,316 KB |
testcase_28 | AC | 225 ms
83,224 KB |
testcase_29 | AC | 229 ms
83,368 KB |
testcase_30 | AC | 226 ms
83,564 KB |
testcase_31 | AC | 229 ms
83,160 KB |
testcase_32 | AC | 228 ms
83,256 KB |
testcase_33 | AC | 229 ms
83,464 KB |
testcase_34 | AC | 231 ms
83,268 KB |
testcase_35 | AC | 233 ms
83,232 KB |
testcase_36 | AC | 230 ms
83,244 KB |
testcase_37 | AC | 226 ms
83,264 KB |
testcase_38 | AC | 228 ms
83,264 KB |
ソースコード
import sys read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip() import bisect,string,math,time,functools,random,fractions from bisect import* from heapq import heappush,heappop,heapify from collections import deque,defaultdict,Counter from itertools import permutations,combinations,groupby rep=range;R=range def I():return int(input()) def LI():return [int(i) for i in input().split()] def LI_():return [int(i)-1 for i in input().split()] def AI():return map(int,open(0).read().split()) def S_():return input() def IS():return input().split() def LS():return [i for i in input().split()] def NI(n):return [int(input()) for i in range(n)] def NI_(n):return [int(input())-1 for i in range(n)] def NLI(n):return [[int(i) for i in input().split()] for i in range(n)] def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)] def StoLI():return [ord(i)-97 for i in input()] def ItoS(n):return chr(n+97) def LtoS(ls):return ''.join([chr(i+97) for i in ls]) def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)] def RI(a=1,b=10):return random.randint(a,b) def INP(): N=10 n=random.randint(1,N) a=RLI(n,0,n-1) return n,a def Rtest(T): case,err=0,0 for i in range(T): inp=INP() a1=naive(*inp) a2=solve(*inp) if a1!=a2: print(inp) print('naive',a1) print('solve',a2) err+=1 case+=1 print('Tested',case,'case with',err,'errors') def GI(V,E,ls=None,Directed=False,index=1): org_inp=[];g=[[] for i in range(V)] FromStdin=True if ls==None else False for i in range(E): if FromStdin: inp=LI() org_inp.append(inp) else: inp=ls[i] if len(inp)==2:a,b=inp;c=1 else:a,b,c=inp if index==1:a-=1;b-=1 aa=(a,c);bb=(b,c);g[a].append(bb) if not Directed:g[b].append(aa) return g,org_inp def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1): #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage mp=[boundary]*(w+2);found={} for i in R(h): s=input() for char in search: if char in s: found[char]=((i+1)*(w+2)+s.index(char)+1) mp_def[char]=mp_def[replacement_of_found] mp+=[boundary]+[mp_def[j] for j in s]+[boundary] mp+=[boundary]*(w+2) return h+2,w+2,mp,found def TI(n):return GI(n,n-1) def accum(ls): rt=[0] for i in ls:rt+=[rt[-1]+i] return rt def bit_combination(n,base=2): rt=[] for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s] return rt def gcd(x,y): if y==0:return x if x%y==0:return y while x%y!=0:x,y=y,x%y return y def YN(x):print(['NO','YES'][x]) def Yn(x):print(['No','Yes'][x]) def show(*inp,end='\n'): if show_flg:print(*inp,end=end) def showf(inp,length=3,end='\n'): if show_flg:print([' '*(length-len(str(i)))+str(i)for i in inp],end=end) mo=10**9+7 #mo=998244353 inf=float('inf') FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb)) alp=[chr(ord('a')+i)for i in range(26)] #sys.setrecursionlimit(10**7) def gcj(c,x): print("Case #{0}:".format(c+1),x) show_flg=False show_flg=True ## Verified by ABC191F ## https://atcoder.jp/contests/abc191/tasks/abc191_e from heapq import heappush, heappop,heapify def dijkstra(edge,st): ## edge=[[(v_to,dist_to_v),...],[],...] ## initialize: def: d=dist(st,i), prev=[previous vertex in minimum path], q[] n=len(edge) d=[(0 if st==i else inf) for i in range(n)] # prev=[0]*n q=[(0,st)] heapify(q) v=[False]*n while q: dist,cur=heappop(q) if v[cur]: continue v[cur]=True for dst,dist in edge[cur]: alt=d[cur]+dist if alt<d[dst]: d[dst]=alt # prev[dst]=cur heappush(q,(alt,dst)) return d#,prev n,m=LI() g=[[]for i in range(n*2)] for i in range(m): a,b,c,x=LI() a-=1 b-=1 g[a]+=(b,c), g[b]+=(a,c), g[a+n]+=(b+n,c), g[b+n]+=(a+n,c), if x==1: g[a]+=(b+n,c), g[b]+=(a+n,c), d=dijkstra(g,n-1) for i in range(n-1): print(d[i+n])