結果
| 問題 | No.1954 CHECKER×CHECKER(2) |
| ユーザー |
 Kazun
|
| 提出日時 | 2022-05-21 00:06:15 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 85 ms / 1,000 ms |
| コード長 | 10,301 bytes |
| コンパイル時間 | 327 ms |
| コンパイル使用メモリ | 82,460 KB |
| 実行使用メモリ | 77,972 KB |
| 最終ジャッジ日時 | 2024-09-20 10:30:13 |
| 合計ジャッジ時間 | 3,052 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 42 ms
57,992 KB |
| testcase_01 | AC | 43 ms
56,184 KB |
| testcase_02 | AC | 43 ms
56,984 KB |
| testcase_03 | AC | 44 ms
56,772 KB |
| testcase_04 | AC | 43 ms
57,612 KB |
| testcase_05 | AC | 41 ms
56,660 KB |
| testcase_06 | AC | 42 ms
56,984 KB |
| testcase_07 | AC | 43 ms
57,124 KB |
| testcase_08 | AC | 43 ms
56,636 KB |
| testcase_09 | AC | 42 ms
56,964 KB |
| testcase_10 | AC | 45 ms
56,128 KB |
| testcase_11 | AC | 44 ms
57,640 KB |
| testcase_12 | AC | 43 ms
56,316 KB |
| testcase_13 | AC | 55 ms
69,344 KB |
| testcase_14 | AC | 66 ms
74,464 KB |
| testcase_15 | AC | 43 ms
56,900 KB |
| testcase_16 | AC | 44 ms
57,888 KB |
| testcase_17 | AC | 43 ms
57,928 KB |
| testcase_18 | AC | 67 ms
74,596 KB |
| testcase_19 | AC | 45 ms
58,060 KB |
| testcase_20 | AC | 54 ms
67,060 KB |
| testcase_21 | AC | 56 ms
69,544 KB |
| testcase_22 | AC | 81 ms
77,380 KB |
| testcase_23 | AC | 53 ms
65,448 KB |
| testcase_24 | AC | 51 ms
67,632 KB |
| testcase_25 | AC | 81 ms
77,340 KB |
| testcase_26 | AC | 66 ms
73,868 KB |
| testcase_27 | AC | 78 ms
77,584 KB |
| testcase_28 | AC | 66 ms
74,760 KB |
| testcase_29 | AC | 63 ms
72,920 KB |
| testcase_30 | AC | 85 ms
77,972 KB |
| testcase_31 | AC | 43 ms
56,408 KB |
ソースコード
class Modulo_Matrix():
__slots__=("ele","row","col","size")
#入力
def __init__(self,M):
""" 行列 M の定義
M: 行列
※ Mod: 法はグローバル変数から指定
"""
self.ele=[[x%Mod for x in X] for X in 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 __repr__(self):
return str(self)
#+,-
def __pos__(self):
return self
def __neg__(self):
return self.__scale__(-1)
#加法
def __add__(self,other):
M=self.ele; N=other.ele
L=[[0]*self.col for _ in range(self.row)]
for i in range(self.row):
Li,Mi,Ni=L[i],M[i],N[i]
for j in range(self.col):
Li[j]=Mi[j]+Ni[j]
return Modulo_Matrix(L)
def __iadd__(self,other):
M=self.ele; N=other.ele
for i in range(self.row):
Mi,Ni=M[i],N[i]
for j in range(self.col):
Mi[j]+=Ni[j]
Mi[j]%=Mod
return self
#減法
def __sub__(self,other):
M=self.ele; N=other.ele
L=[[0]*self.col for _ in range(self.row)]
for i in range(self.row):
Li,Mi,Ni=L[i],M[i],N[i]
for j in range(self.col):
Li[j]=Mi[j]-Ni[j]
return Modulo_Matrix(L)
def __isub__(self,other):
M=self.ele; N=other.ele
for i in range(self.row):
Mi,Ni=M[i],N[i]
for j in range(self.col):
Mi[j]-=Ni[j]
Mi[j]%=Mod
return self
#乗法
def __mul__(self,other):
if isinstance(other,Modulo_Matrix):
assert self.col==other.row, "左側の列と右側の行が一致しません.({},{})".format(self.size,other.size)
M=self.ele; N=other.ele
E=[[0]*other.col for _ in range(self.row)]
for i in range(self.row):
Ei,Mi=E[i],M[i]
for k in range(self.col):
m_ik,Nk=Mi[k],N[k]
for j in range(other.col):
Ei[j]+=m_ik*Nk[j]
Ei[j]%=Mod
return Modulo_Matrix(E)
elif isinstance(other,int):
return self.__scale__(other)
def __rmul__(self,other):
if isinstance(other,int):
return self.__scale__(other)
def inverse(self):
assert self.row==self.col,"正方行列ではありません."
M=self
N=M.row
R=[[1 if i==j else 0 for j in range(N)] for i in range(N)]
T=deepcopy(M.ele)
for j in range(N):
if T[j][j]==0:
for i in range(j+1,N):
if T[i][j]:
break
else:
assert 0, "正則行列ではありません"
T[j],T[i]=T[i],T[j]
R[j],R[i]=R[i],R[j]
Tj,Rj=T[j],R[j]
inv=pow(Tj[j],Mod-2,Mod)
for k in range(N):
Tj[k]*=inv; Tj[k]%=Mod
Rj[k]*=inv; Rj[k]%=Mod
for i in range(N):
if i==j: continue
c=T[i][j]
Ti,Ri=T[i],R[i]
for k in range(N):
Ti[k]-=Tj[k]*c; Ti[k]%=Mod
Ri[k]-=Rj[k]*c; Ri[k]%=Mod
return Modulo_Matrix(R)
#スカラー倍
def __scale__(self,r):
M=self.ele
r%=Mod
L=[[(r*M[i][j])%Mod for j in range(self.col)] for i in range(self.row)]
return Modulo_Matrix(L)
#累乗
def __pow__(self,n):
assert self.row==self.col, "正方行列ではありません."
r=self.col
def __mat_mul(A,B):
E=[[0]*r for _ in range(r)]
for i in range(r):
a=A[i]; e=E[i]
for k in range(r):
b=B[k]
for j in range(r):
e[j]+=a[k]*b[j]
e[j]%=Mod
return E
X=deepcopy(self.ele)
E=[[1 if i==j else 0 for j in range(r)] for i in range(r)]
sgn=1 if n>=0 else -1
n=abs(n)
while True:
if n&1:
E=__mat_mul(E,X)
n>>=1
if n:
X=__mat_mul(X,X)
else:
break
if sgn==1:
return Modulo_Matrix(E)
else:
return Modulo_Matrix(E).inverse()
#等号
def __eq__(self,other):
return self.ele==other.ele
#不等号
def __neq__(self,other):
return not(self==other)
#転置
def transpose(self):
return Modulo_Matrix(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]
u_inv=pow(u,Mod-2,Mod)
for j in range(C):
T[I][j]*=u_inv
T[I][j]%=Mod
for i in range(R):
if i!=I:
v=T[i][J]
for j in range(C):
T[i][j]-=v*T[I][j]
T[i][j]%=Mod
I+=1
if I==R:
break
return Modulo_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]
u_inv=pow(u,Mod-2,Mod)
for i in range(R):
T[i][J]*=u_inv
T[i][J]%=Mod
for j in range(C):
if j!=J:
v=T[I][j]
for i in range(R):
T[i][j]-=v*T[i][J]
T[i][j]%=Mod
J+=1
if J==C:
break
return Modulo_Matrix(T)
#行列の階数
def rank(self):
M=self.row_reduce()
(R,C)=M.size
T=M.ele
rnk=0
for i in range(R):
f=False
for j in range(C):
if T[i][j]!=0:
f=True
break
if f:
rnk+=1
else:
break
return rnk
#行の結合
def row_union(self,other):
return Modulo_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 Modulo_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
def Linear_System_Equations(A,b):
if type(A) is Modulo_Matrix:
row,col=A.size
T=deepcopy(A.ele)
else:
row,col=len(A),len(A[0])
T=deepcopy(A)
assert row==len(b), "A の行と b の次元が一致しません."
for i in range(row):
T[i].append(b[i])
p=[]; q=[]
rnk=0
for j in range(col+1):
for i in range(rnk,row):
if T[i][j]!=0:
break
else:
q.append(j)
continue
if j==col:
return None
p.append(j)
T[rnk],T[i]=T[i],T[rnk]
inv=pow(T[rnk][j], Mod-2, Mod)
for k in range(col+1):
T[rnk][k]=(inv*T[rnk][k])%Mod
for s in range(row):
if s==rnk:
continue
c=-T[s][j]
for t in range(col+1):
T[s][t]=(T[s][t]+c*T[rnk][t])%Mod
rnk+=1
x=[0]*col
for i in range(rnk):
x[p[i]]=T[i][-1]
ker_dim=col-rnk
ker=[[0]*col for _ in range(ker_dim)]
for i in range(ker_dim):
ker[i][q[i]]=1
for i in range(ker_dim):
for j in range(rnk):
ker[i][p[j]]=-T[j][q[i]]%Mod
return x,ker
def solve():
h=len(E)-1; w=len(F)-1
for i in range(h):
for j in range(w):
a=S[E[i]][F[j]]
for x in range(E[i],E[i+1]):
for y in range(F[j],F[j+1]):
if S[x][y]!=a:
return False
A=[[0]*(h+w) for _ in range(h*w)]
for i in range(h):
for j in range(w):
A[i*w+j][i]=1
for j in range(w):
for i in range(h):
A[i*w+j][j+h]=1
b=[0]*(h*w)
for i in range(h):
for j in range(w):
b[i*w+j]=S[E[i]][F[j]]
return Linear_System_Equations(A,b)!=None
#==================================================
from copy import deepcopy
H,W=map(int,input().split())
S=[[0]*W for _ in range(H)]
for i in range(H):
for j,s in enumerate(input()):
t=1 if s=="#" else 0
S[i][j]=(i+j+t)%2
M=int(input())
E={0,H}; F={0,W}
for _ in range(M):
t,n=map(int,input().split())
if t==1:
E.add(n)
else:
F.add(n)
Mod=2
E=sorted(E); F=sorted(F)
print("Yes" if solve() else "No")