結果
| 問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
| ユーザー |
👑  Kazun
|
| 提出日時 | 2021-01-20 04:03:52 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,776 bytes |
| コンパイル時間 | 177 ms |
| コンパイル使用メモリ | 82,560 KB |
| 実行使用メモリ | 224,732 KB |
| 最終ジャッジ日時 | 2024-06-07 12:03:23 |
| 合計ジャッジ時間 | 30,345 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 45 ms
60,288 KB |
| testcase_01 | AC | 45 ms
54,784 KB |
| testcase_02 | AC | 44 ms
55,168 KB |
| testcase_03 | AC | 45 ms
55,552 KB |
| testcase_04 | AC | 46 ms
56,192 KB |
| testcase_05 | AC | 44 ms
54,912 KB |
| testcase_06 | AC | 46 ms
55,936 KB |
| testcase_07 | AC | 46 ms
56,192 KB |
| testcase_08 | AC | 197 ms
88,064 KB |
| testcase_09 | AC | 130 ms
78,976 KB |
| testcase_10 | AC | 197 ms
83,520 KB |
| testcase_11 | AC | 191 ms
85,844 KB |
| testcase_12 | AC | 196 ms
83,352 KB |
| testcase_13 | AC | 907 ms
185,928 KB |
| testcase_14 | AC | 1,004 ms
155,120 KB |
| testcase_15 | AC | 1,040 ms
177,044 KB |
| testcase_16 | AC | 736 ms
135,116 KB |
| testcase_17 | AC | 531 ms
161,040 KB |
| testcase_18 | AC | 1,259 ms
224,236 KB |
| testcase_19 | AC | 1,271 ms
224,476 KB |
| testcase_20 | AC | 1,265 ms
223,840 KB |
| testcase_21 | AC | 1,260 ms
224,048 KB |
| testcase_22 | AC | 1,272 ms
224,600 KB |
| testcase_23 | AC | 393 ms
126,468 KB |
| testcase_24 | AC | 152 ms
77,696 KB |
| testcase_25 | AC | 662 ms
137,308 KB |
| testcase_26 | AC | 880 ms
146,648 KB |
| testcase_27 | AC | 574 ms
119,216 KB |
| testcase_28 | AC | 517 ms
124,024 KB |
| testcase_29 | AC | 528 ms
118,912 KB |
| testcase_30 | AC | 510 ms
120,608 KB |
| testcase_31 | AC | 451 ms
128,772 KB |
| testcase_32 | AC | 419 ms
117,176 KB |
| testcase_33 | AC | 830 ms
134,320 KB |
| testcase_34 | AC | 952 ms
169,416 KB |
| testcase_35 | AC | 1,127 ms
204,180 KB |
| testcase_36 | AC | 1,129 ms
191,288 KB |
| testcase_37 | AC | 342 ms
107,064 KB |
| testcase_38 | AC | 351 ms
84,148 KB |
| testcase_39 | AC | 338 ms
84,224 KB |
| testcase_40 | AC | 334 ms
84,120 KB |
| testcase_41 | AC | 339 ms
83,968 KB |
| testcase_42 | AC | 344 ms
84,352 KB |
| testcase_43 | AC | 501 ms
224,732 KB |
| testcase_44 | TLE | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
ソースコード
class Digraph:
"""重み[なし]有向グラフを生成する.
"""
#入力定義
def __init__(self,vertex=[]):
self.vertex=set(vertex)
self.edge_number=0
self.vertex_number=len(vertex)
self.adjacent_out={v:set() for v in vertex} #出近傍(vが始点)
self.adjacent_in={v:set() for v in vertex} #入近傍(vが終点)
#頂点の追加
def add_vertex(self,*adder):
for v in adder:
if v not in self.vertex:
self.adjacent_in[v]=set()
self.adjacent_out[v]=set()
self.vertex_number+=1
self.vertex.add(v)
#辺の追加
def add_edge(self,From,To):
for v in [From,To]:
if v not in self.vertex:
self.add_vertex(v)
if To not in self.adjacent_in[From]:
self.edge_number+=1
self.adjacent_out[From].add(To)
self.adjacent_in[To].add(From)
#辺を除く
def remove_edge(self,From,To):
for v in [From,To]:
if v not in self.vertex:
self.add_vertex(v)
if To in self.adjacent_out[From]:
self.adjacent_out[From].remove(To)
self.adjacent_in[To].remove(From)
self.edge_number-=1
#頂点を除く
def remove_vertex(self,*vertexes):
for v in vertexes:
if v in self.vertex:
self.vertex_number-=1
for u in self.adjacent_out[v]:
self.adjacent_in[u].remove(v)
self.edge_number-=1
del self.adjacent_out[v]
for u in self.adjacent_in[v]:
self.adjacent_out[u].remove(v)
self.edge_number-=1
del self.adjacent_in[v]
#Walkの追加
def add_walk(self,*walk):
N=len(walk)
for k in range(N-1):
self.add_edge(walk[k],walk[k+1])
#Cycleの追加
def add_cycle(self,*cycle):
self.add_walk(*cycle)
self.add_edge(cycle[-1],cycle[0])
#頂点の交換
def __vertex_swap(self,p,q):
self.vertex.sort()
#グラフに頂点が存在するか否か
def vertex_exist(self,v):
return v in self.vertex
#グラフに辺が存在するか否か
def edge_exist(self,From,To):
if not(self.vertex_exist(From) and self.vertex_exist(To)):
return False
return To in self.adjacent_out[From]
#近傍
def neighbohood(self,v):
if not self.vertex_exist(v):
return []
return list(self.adjacent[v])
#出次数
def out_degree(self,v):
if not self.vertex_exist(v):
return 0
return len(self.adjacent_out[v])
#入次数
def in_degree(self,v):
if not self.vertex_exist(v):
return 0
return len(self.adjacent_in[v])
#次数
def degree(self,v):
if not self.vertex_exist(v):
return 0
return self.out_degree(v)-self.in_degree(v)
#頂点数
def vertex_count(self):
return len(self.vertex)
#辺数
def edge_count(self):
return self.edge_number
#頂点vを含む連結成分
def connected_component(self,v):
pass
#強連結成分に分解
def Strongly_Connected_Component_Decomposition(D,Mode=0):
"""有向グラフDを強連結成分に分解
Mode:
0(Defalt)---各強連結成分の頂点のリスト
1 ---各頂点が属している強連結成分の番号
2 ---0,1の両方
※0で帰ってくるリストは各強連結成分に関してトポロジカルソートである.
"""
Group={v:0 for v in D.adjacent_out}
Order=[]
for v in D.adjacent_out:
if Group[v]:continue
S=[v]
Group[v]=-1
while S:
u=S.pop()
for w in D.adjacent_out[u]:
if Group[w]:continue
Group[w]=-1
S.append(u)
S.append(w)
break
else:
Order.append(u)
k=0
for v in Order[::-1]:
if Group[v]!=-1:
continue
S=[v]
Group[v]=k
while S:
u=S.pop()
for w in D.adjacent_in[u]:
if Group[w]!=-1:
continue
Group[w]=k
S.append(w)
k+=1
if Mode==0 or Mode==2:
T=[[] for _ in range(k)]
for v in D.adjacent_out:
T[Group[v]].append(v)
if Mode==0:
return T
elif Mode==1:
return Group
else:
return (Group,T)
#================================================
def f(p,z):
a,w=p
x,y=z
return [(x*a)%Mod,a*y+x*w]
#================================================
from collections import defaultdict
N,M=map(int,input().split())
Mod=10**9+7
D=Digraph(range(N+1))
E=[defaultdict(lambda :[0,0]) for _ in range(N+1)]
for _ in range(M):
u,v,w,a=map(int,input().split())
D.add_edge(u,v)
b,l=E[u][v]
E[u][v]=[b+a,(l+a*w)%Mod]
G,T=Strongly_Connected_Component_Decomposition(D,2)
inf=float("inf")
Flag=[0]*(N+1)
Flag[0]=1
DP=[[0,0] for _ in range(N+1)]
DP[0]=[1,0]
for U in T:
if len(U)>=2:
F=0
for v in U:
F|=Flag[v]
if F:
for v in U:
DP[v]=[inf,inf]
for u in U:
x,y=DP[u]
for v in E[u]:
Flag[v]|=Flag[u]
if x==inf:
DP[v]=[inf,inf]
else:
a,w=E[u][v]
DP[v][0]+=x*a
DP[v][1]+=y*a+x*w
DP[v][0]%=Mod
DP[v][1]%=Mod
print(DP[N][1] if DP[N][1]<inf else "INF")