結果
問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
ユーザー |
![]() |
提出日時 | 2021-10-29 16:13:44 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,992 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 218,996 KB |
最終ジャッジ日時 | 2024-10-07 08:35:25 |
合計ジャッジ時間 | 23,580 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 WA * 25 RE * 1 |
ソースコード
import sys# sys.setrecursionlimit(200005)int1 = lambda x: int(x)-1p2D = 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 = 998244353md = 10**9+7# 各強連結成分をリストにしてトポロジカル順に返すdef SCC(to, ot):n = len(to)# トポロジカルソートfin = [-1]*ntopo = []for u in range(n):if fin[u] != -1: continuestack = [u]while stack:u = stack[-1]if fin[u] == -1:fin[u] = 0for v, _, _ in to[u]:if fin[v] != -1: continuestack.append(v)else:stack.pop()if fin[u] == 0:fin[u] = 1topo.append(u)# 逆辺でdfsres = []while topo:u = topo.pop()if fin[u] != 1: continuefin[u] = 2cur = [u]i = 0while i < len(cur):u = cur[i]for v, _, _ in ot[u]:if fin[v] == 2: continuefin[v] = 2cur.append(v)i += 1res.append(cur)return resn, 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: continueto2[g].append((h, l, a))ot2[h].append((g, l, a))# print(to2, ot2)def reach(g, to):res = [False]*gnres[g] = Truestack = [g]while stack:g = stack.pop()for h, _, _ in to[g]:if res[h]: continueres[h] = Truestack.append(h)return resr1 = reach(utog[0], to2)r2 = reach(utog[n], ot2)# print(r1, r2)cnt = []for c0, c1 in zip(r1, r2):cnt.append(c0+c1)for g in range(gn):if cnt[g] < 2: continueif len(gg[g]) > 1:print("INF")exit()ss = [0]*gncc = [0]*gng = utog[n]cc[g] = 1for g in range(utog[n], utog[0]-1, -1):if cnt[g] < 2: continuefor h, l, a in to[g]:c = cc[h]*a%mdcc[g] += css[g] += c*l%md+ss[h]cc[g] %= mdss[g] %= mdprint(ss[utog[0]])