結果
問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
ユーザー | ophhdn |
提出日時 | 2021-08-08 12:44:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,882 bytes |
コンパイル時間 | 590 ms |
コンパイル使用メモリ | 81,460 KB |
実行使用メモリ | 134,336 KB |
最終ジャッジ日時 | 2023-10-19 12:17:55 |
合計ジャッジ時間 | 17,328 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
79,900 KB |
testcase_01 | AC | 98 ms
79,904 KB |
testcase_02 | AC | 98 ms
79,904 KB |
testcase_03 | AC | 99 ms
79,908 KB |
testcase_04 | AC | 100 ms
79,888 KB |
testcase_05 | AC | 98 ms
79,904 KB |
testcase_06 | AC | 100 ms
79,904 KB |
testcase_07 | AC | 99 ms
79,900 KB |
testcase_08 | AC | 148 ms
83,820 KB |
testcase_09 | AC | 130 ms
81,112 KB |
testcase_10 | AC | 151 ms
83,296 KB |
testcase_11 | AC | 148 ms
83,152 KB |
testcase_12 | AC | 143 ms
83,172 KB |
testcase_13 | AC | 450 ms
118,032 KB |
testcase_14 | AC | 529 ms
117,352 KB |
testcase_15 | AC | 525 ms
122,740 KB |
testcase_16 | AC | 407 ms
107,980 KB |
testcase_17 | AC | 263 ms
107,908 KB |
testcase_18 | AC | 602 ms
128,976 KB |
testcase_19 | AC | 601 ms
132,596 KB |
testcase_20 | AC | 630 ms
132,628 KB |
testcase_21 | AC | 599 ms
128,976 KB |
testcase_22 | AC | 603 ms
134,336 KB |
testcase_23 | AC | 197 ms
91,420 KB |
testcase_24 | AC | 168 ms
88,668 KB |
testcase_25 | AC | 285 ms
99,052 KB |
testcase_26 | AC | 390 ms
107,688 KB |
testcase_27 | AC | 317 ms
100,496 KB |
testcase_28 | AC | 236 ms
94,192 KB |
testcase_29 | AC | 323 ms
100,484 KB |
testcase_30 | AC | 236 ms
94,116 KB |
testcase_31 | AC | 225 ms
92,756 KB |
testcase_32 | AC | 251 ms
96,368 KB |
testcase_33 | AC | 403 ms
104,252 KB |
testcase_34 | AC | 393 ms
105,048 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 236 ms
99,212 KB |
testcase_38 | AC | 321 ms
111,484 KB |
testcase_39 | AC | 323 ms
111,496 KB |
testcase_40 | AC | 318 ms
111,700 KB |
testcase_41 | AC | 313 ms
111,600 KB |
testcase_42 | AC | 316 ms
111,668 KB |
testcase_43 | AC | 232 ms
115,208 KB |
testcase_44 | AC | 235 ms
118,692 KB |
testcase_45 | AC | 191 ms
97,488 KB |
testcase_46 | AC | 152 ms
109,644 KB |
testcase_47 | WA | - |
ソースコード
from collections import defaultdict, deque, Counter from heapq import heappush, heappop, heapify import math import bisect import random from itertools import permutations, accumulate, combinations, product import sys import string from bisect import bisect_left, bisect_right from math import factorial, ceil, floor from operator import mul from functools import reduce import pprint sys.setrecursionlimit(10 ** 9) INF = 10 ** 20 def LI(): return list(map(int, sys.stdin.readline().split())) def I(): return int(sys.stdin.readline()) def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split() def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8') def IR(n): return [I() for i in range(n)] def LIR(n): return [LI() for i in range(n)] def SR(n): return [S() for i in range(n)] def LSR(n): return [LS() for i in range(n)] def SRL(n): return [list(S()) for i in range(n)] def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)] mod = 10**9+7 n,m=LI() G=[[]for _ in range(n+1)] for _ in range(m): u,v,l,a=LI() G[u]+=[(v,l,a)] def topological_sort(G): n = len(G) in_degree = [0] * n for u in range(n): for v,_,_ in G[u]: in_degree[v] += 1 topological_order = [] que = deque() for i in range(n): if in_degree[i] == 0: que += [i] while que: u = que.pop() topological_order += [u] for v,_,_ in G[u]: in_degree[v] -= 1 if in_degree[v] == 0: que += [v] return topological_order q=deque([0]) D=[0]*(n+1) D2=[0]*(n+1) D2[0]=1 D[0]=0 order=topological_sort(G) if len(order)!=n+1: print("INF") exit() s=set() for ui in order: s.add(ui) for vi,li,ai in G[ui]: D[vi]+=(D[ui]+D2[ui]*li)*ai%mod D[vi]%=mod D2[vi]+=D2[ui]*ai D2[vi]%=mod print(D[n])