結果
問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
ユーザー | mkawa2 |
提出日時 | 2021-10-29 17:45:03 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 2,006 ms / 2,500 ms |
コード長 | 2,882 bytes |
コンパイル時間 | 142 ms |
コンパイル使用メモリ | 11,088 KB |
実行使用メモリ | 140,532 KB |
最終ジャッジ日時 | 2023-09-05 16:06:59 |
合計ジャッジ時間 | 46,350 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 17 ms
8,288 KB |
testcase_01 | AC | 17 ms
8,504 KB |
testcase_02 | AC | 17 ms
8,368 KB |
testcase_03 | AC | 18 ms
8,316 KB |
testcase_04 | AC | 18 ms
8,364 KB |
testcase_05 | AC | 18 ms
8,316 KB |
testcase_06 | AC | 18 ms
8,316 KB |
testcase_07 | AC | 18 ms
8,284 KB |
testcase_08 | AC | 93 ms
16,820 KB |
testcase_09 | AC | 45 ms
11,040 KB |
testcase_10 | AC | 87 ms
14,880 KB |
testcase_11 | AC | 81 ms
15,448 KB |
testcase_12 | AC | 85 ms
14,932 KB |
testcase_13 | AC | 1,379 ms
100,284 KB |
testcase_14 | AC | 1,530 ms
109,780 KB |
testcase_15 | AC | 1,633 ms
115,536 KB |
testcase_16 | AC | 1,090 ms
83,388 KB |
testcase_17 | AC | 727 ms
67,768 KB |
testcase_18 | AC | 1,976 ms
140,360 KB |
testcase_19 | AC | 1,987 ms
140,460 KB |
testcase_20 | AC | 1,984 ms
140,348 KB |
testcase_21 | AC | 1,961 ms
140,412 KB |
testcase_22 | AC | 2,006 ms
140,532 KB |
testcase_23 | AC | 438 ms
42,892 KB |
testcase_24 | AC | 248 ms
22,960 KB |
testcase_25 | AC | 645 ms
48,092 KB |
testcase_26 | AC | 962 ms
65,396 KB |
testcase_27 | AC | 728 ms
53,168 KB |
testcase_28 | AC | 467 ms
38,624 KB |
testcase_29 | AC | 701 ms
52,960 KB |
testcase_30 | AC | 480 ms
38,824 KB |
testcase_31 | AC | 478 ms
42,740 KB |
testcase_32 | AC | 557 ms
44,344 KB |
testcase_33 | AC | 920 ms
62,208 KB |
testcase_34 | AC | 1,053 ms
66,712 KB |
testcase_35 | AC | 1,400 ms
96,648 KB |
testcase_36 | AC | 1,265 ms
84,836 KB |
testcase_37 | AC | 553 ms
40,524 KB |
testcase_38 | AC | 1,287 ms
79,224 KB |
testcase_39 | AC | 1,235 ms
79,472 KB |
testcase_40 | AC | 1,268 ms
79,052 KB |
testcase_41 | AC | 1,387 ms
79,064 KB |
testcase_42 | AC | 1,466 ms
79,160 KB |
testcase_43 | AC | 970 ms
99,204 KB |
testcase_44 | AC | 824 ms
88,404 KB |
testcase_45 | AC | 436 ms
50,216 KB |
testcase_46 | AC | 401 ms
55,436 KB |
testcase_47 | AC | 18 ms
8,368 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (1, 0), (0, -1), (-1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 1 << 63 # md = 998244353 md = 10**9+7 # 各強連結成分をリストにしてトポロジカル順に返す def SCC(to, ot): n = len(to) # トポロジカルソート fin = [-1]*n topo = [] for u in range(n): if fin[u] != -1: continue stack = [u] while stack: u = stack[-1] if fin[u] == -1: fin[u] = 0 for v, _, _ in to[u]: if fin[v] != -1: continue stack.append(v) else: stack.pop() if fin[u] == 0: fin[u] = 1 topo.append(u) # 逆辺でdfs res = [] while topo: u = topo.pop() if fin[u] != 1: continue fin[u] = 2 cur = [u] i = 0 while i < len(cur): u = cur[i] for v, _, _ in ot[u]: if fin[v] == 2: continue fin[v] = 2 cur.append(v) i += 1 res.append(cur) return res n, m = LI() to = [[] for _ in range(n+1)] ot = [[] for _ in range(n+1)] for i in range(m): u, v, l, a = LI() to[u].append((v, l, a)) ot[v].append((u, l, a)) gg = SCC(to, ot) gn = len(gg) # print(gg) utog = [-1]*(n+1) for g, uu in enumerate(gg): for u in uu: utog[u] = g # print(utog) to2 = [[] for _ in range(gn)] ot2 = [[] for _ in range(gn)] for u in range(n+1): g = utog[u] for v, l, a in to[u]: h = utog[v] if g == h: continue to2[g].append((h, l, a)) ot2[h].append((g, l, a)) # print(to2, ot2) def reach(g, to): res = [False]*gn res[g] = True stack = [g] while stack: g = stack.pop() for h, _, _ in to[g]: if res[h]: continue res[h] = True stack.append(h) return res s = utog[0] t = utog[n] r1 = reach(s, to2) r2 = reach(t, ot2) # print(r1, r2) for g in range(gn): if r1[g] and r2[g] and len(gg[g]) > 1: print("INF") exit() dd = [0]*gn cc = [0]*gn cc[t] = 1 for g in range(t-1, s-1, -1): for h, l, a in to2[g]: cc[g] += cc[h]*a%md dd[g] += (dd[h]+l*cc[h]%md)%md*a%md cc[g] %= md dd[g] %= md print(dd[s])