結果

問題 No.1340 おーじ君をさがせ
ユーザー 👑 Kazun
提出日時 2021-01-15 22:16:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 737 ms / 2,000 ms
コード長 6,774 bytes
コンパイル時間 152 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 81,280 KB
最終ジャッジ日時 2024-11-27 23:11:03
合計ジャッジ時間 12,309 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 59
権限があれば一括ダウンロードができます

ソースコード

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

from copy import copy,deepcopy
class Matrix_Error(Exception):
pass
class Matrix():
#
def __init__(self,M=[]):
self.ele=M
R=len(M)
if R!=0:
C=len(M[0])
else:
C=0
self.row=R
self.col=C
self.size=(R,C)
#
def __str__(self):
T=""
(r,c)=self.size
for i in range(r):
U="["
for j in range(c):
U+=str(self.ele[i][j])+" "
T+=U[:-1]+"]\n"
return "["+T[:-1]+"]"
#+,-
def __pos__(self):
return self
def __neg__(self):
return self.__scale__(-1)
#
def __add__(self,other):
A=self
B=other
if A.size!=B.size:
raise Matrix_Error("2.({},{})".format(A.size,B.size))
M=A.ele
N=B.ele
L=[]
for i in range(A.row):
E=[]
for j in range(A.col):
E.append(M[i][j]|N[i][j])
L.append(E)
return Matrix(L)
#
def __sub__(self,other):
return self+(-other)
#
def __mul__(self,other):
A=self
B=other
if isinstance(B,Matrix):
R=A.row
C=B.col
if A.col!=B.row:
raise Matrix_Error(".({},{})".format(A.size,B.size))
G=A.col
M=A.ele
N=B.ele
E=[]
for i in range(R):
F=[]
for j in range(C):
S=0
for k in range(G):
S|=M[i][k]&N[k][j]
F.append(S)
E.append(F)
return Matrix(E)
elif isinstance(B,int):
return A.__scale__(B)
def __rmul__(self,other):
if isinstance(other,int):
return self*other
def Inverse(self):
from copy import copy
M=self
if M.row!=M.col:
raise Matrix_Error(".")
R=M.row
I=[[1*(i==j) for j in range(R)] for i in range(R)]
G=M.Column_Union(Matrix(I))
G=G.Row_Reduce()
A,B=[],[]
for i in range(R):
A.append(copy(G.ele[i][:R]))
B.append(copy(G.ele[i][R:]))
if A==I:
return Matrix(B)
else:
raise Matrix_Error(".")
#
def __scale__(self,r):
M=self.ele
L=[[r*M[i][j] for j in range(self.col)] for i in range(self.row)]
return Matrix(L)
#
def __pow__(self,n):
A=self
if A.row!=A.col:
raise Matrix_Error(".")
if n<0:
return (A**(-n)).Inverse()
R=Matrix([[1*(i==j) for j in range(A.row)] for i in range(A.row)])
D=A
while n>0:
if n%2==1:
R*=D
D*=D
n=n>>1
return R
#
def __eq__(self,other):
A=self
B=other
if A.size!=B.size:
return False
for i in range(A.row):
for j in range(A.col):
if A.ele[i][j]!=B.ele[i][j]:
return False
return True
#
def __neq__(self,other):
return not(self==other)
#
def Transpose(self):
self.col,self.row=self.row,self.col
self.ele=list(map(list,zip(*self.ele)))
#
def Row_Reduce(self):
M=self
(R,C)=M.size
T=[]
for i in range(R):
U=[]
for j in range(C):
U.append(M.ele[i][j])
T.append(U)
I=0
for J in range(C):
if T[I][J]==0:
for i in range(I+1,R):
if T[i][J]!=0:
T[i],T[I]=T[I],T[i]
break
if T[I][J]!=0:
u=T[I][J]
for j in range(C):
T[I][j]/=u
for i in range(R):
if i!=I:
v=T[i][J]
for j in range(C):
T[i][j]-=v*T[I][j]
I+=1
if I==R:
break
return Matrix(T)
#
def Column_Reduce(self):
M=self
(R,C)=M.size
T=[]
for i in range(R):
U=[]
for j in range(C):
U.append(M.ele[i][j])
T.append(U)
J=0
for I in range(R):
if T[I][J]==0:
for j in range(J+1,C):
if T[I][j]!=0:
for k in range(R):
T[k][j],T[k][J]=T[k][J],T[k][j]
break
if T[I][J]!=0:
u=T[I][J]
for i in range(R):
T[i][J]/=u
for j in range(C):
if j!=J:
v=T[I][j]
for i in range(R):
T[i][j]-=v*T[i][J]
J+=1
if J==C:
break
return Matrix(T)
#
def Rank(self,ep=None):
M=self.Row_Reduce()
(R,C)=M.size
T=M.ele
S=0
for i in range(R):
f=False
if ep==None:
for j in range(C):
if T[i][j]!=0:
f=True
else:
for j in range(C):
if abs(T[i][j])>=ep:
f=True
if f:
S+=1
else:
break
return S
#
def Row_Union(self,other):
return Matrix(self.ele+other.ele)
#
def Column_Union(self,other):
E=[]
for i in range(self.row):
E.append(self.ele[i]+other.ele[i])
return Matrix(E)
def __getitem__(self,index):
assert isinstance(index,tuple) and len(index)==2
return self.ele[index[0]][index[1]]
def __setitem__(self,index,val):
assert isinstance(index,tuple) and len(index)==2
self.ele[index[0]][index[1]]=val
#================================================
import sys
input=sys.stdin.readline
N,M,T=map(int,input().split())
X=Matrix([[0]*N for _ in range(N)])
for _ in range(M):
a,b=map(int,input().split())
X[b,a]=1
v=X**T*Matrix([[1 if i==0 else 0] for i in range(N)])
K=0
for i in range(N):
if v[i,0]:
K+=1
print(K)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0