結果

問題 No.807 umg tours
ユーザー buey_tbuey_t
提出日時 2023-03-19 13:25:54
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,994 bytes
コンパイル時間 408 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 177,664 KB
最終ジャッジ日時 2024-09-18 13:48:29
合計ジャッジ時間 24,682 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 168 ms
89,728 KB
testcase_01 AC 167 ms
89,344 KB
testcase_02 AC 181 ms
89,856 KB
testcase_03 AC 180 ms
89,728 KB
testcase_04 AC 166 ms
89,728 KB
testcase_05 AC 171 ms
89,856 KB
testcase_06 AC 188 ms
89,600 KB
testcase_07 AC 184 ms
89,600 KB
testcase_08 AC 149 ms
89,216 KB
testcase_09 AC 150 ms
89,632 KB
testcase_10 AC 152 ms
89,564 KB
testcase_11 AC 2,928 ms
156,800 KB
testcase_12 AC 2,100 ms
139,136 KB
testcase_13 AC 3,023 ms
157,184 KB
testcase_14 AC 1,278 ms
119,552 KB
testcase_15 AC 919 ms
112,000 KB
testcase_16 AC 3,058 ms
159,488 KB
testcase_17 TLE -
testcase_18 AC 3,768 ms
175,488 KB
testcase_19 AC 3,582 ms
168,960 KB
testcase_20 AC 1,380 ms
128,512 KB
testcase_21 AC 1,485 ms
130,176 KB
testcase_22 AC 684 ms
106,624 KB
testcase_23 AC 563 ms
102,656 KB
testcase_24 AC 1,538 ms
162,560 KB
testcase_25 TLE -
権限があれば一括ダウンロードができます

ソースコード

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

def main():
try:
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
except:
pass
try:
import sys
sys.setrecursionlimit(10**7)
except:
pass
from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from decimal import Decimal,ROUND_HALF_UP
#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
from functools import lru_cache, reduce
#@lru_cache(maxsize=None)
from operator import add,sub,mul,xor,and_,or_,itemgetter
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353
#DecimalPython
'''
'''
N,M = map(int, input().split())
G = [[] for _ in range(N+1)]
for _ in range(M):
a,b,c = map(int, input().split())
G[a].append((b,c))
G[b].append((a,c))
Q = []
heappush(Q,(0,1,0))
dis = [[INF]*2 for _ in range(N+1)]
dis[0][1] = 0
while len(Q) > 0:
cnt,pos,f = heappop(Q)
if dis[pos][f] != INF:
continue
dis[pos][f] = cnt
if f == 1 and dis[pos][1] >= dis[pos][0]:
continue
for nx,d in G[pos]:
if dis[nx][f] == INF and cnt<dis[nx][0]:
heappush(Q,(cnt+d,nx,f))
if f == 0 and dis[nx][1] == INF and cnt<dis[nx][0]:
heappush(Q,(cnt,nx,1))
for i in range(1,N+1):
print(dis[i][0]+min(dis[i][0],dis[i][1]))
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0