結果

問題 No.2291 Union Find Estimate
ユーザー 👑 KazunKazun
提出日時 2023-05-05 21:49:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 233 ms / 2,000 ms
コード長 4,653 bytes
コンパイル時間 852 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 92,020 KB
最終ジャッジ日時 2024-11-23 06:55:28
合計ジャッジ時間 3,943 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

class Coloring_Union_Find():
__slots__=("n", "parents", "rank", "data", "merge", "__group_number")
def __init__(self, N, merge, unit):
""" 0,1,...,N-1 .
N:
merge:
e:
"""
self.n=N
self.parents=[-1]*N
self.data=[unit]*N
self.rank=[0]*N
self.merge=merge
self.__group_number=N
def find(self, x):
""" x 調.
x:
"""
V=[]
while self.parents[x]>=0:
V.append(x)
x=self.parents[x]
for v in V:
self.parents[v]=x
return x
def union(self, x, y):
""" x,y , .
x,y:
"""
x=self.find(x)
y=self.find(y)
if x==y:
return
self.__group_number-=1
self.data[x]=self.data[y]=self.merge(self.data[x], self.data[y])
if self.rank[x]<self.rank[y]:
x,y=y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
if self.rank[x]==self.rank[y]:
self.rank[x]+=1
def size(self, x):
""" x .
x:
"""
return -self.parents[self.find(x)]
def same(self, x, y):
""" x,y ?
x,y:
"""
return self.find(x) == self.find(y)
def update(self, x, color):
""" x color .
x:
color:
"""
self.data[self.find(x)]=color
def get(self, x):
""" x .
x:
"""
return self.data[self.find(x)]
def members(self, x):
""" x .
size 使!!
x:
"""
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
"""
"""
return [i for i,x in enumerate(self.parents) if x < 0]
def group_count(self):
"""
"""
return self.__group_number
def all_group_members(self):
"""
"""
X={r:[] for r in self.roots()}
for k in range(self.n):
X[self.find(k)].append(k)
return X
def list(self):
return [self.get(x) for x in range(self.n)]
def map(self):
return {x:self.get(x) for x in self.roots()}
def __str__(self):
string=[]
for x,g in self.all_group_members().items():
string.append(" ({}) {}".format(self.get(x), g))
return ",".join(string)
def __repr__(self):
return "Coloring Union Find:"+str(self)
def __getitem__(self,index):
return self.data[self.find(index)]
def __setitem__(self,index,value):
self.data[self.find(index)]=value
#==================================================
def solve():
from collections import defaultdict
W,H=map(int,input().split())
def merge(a,b):
if a!=-1:
return a
else:
return b
U=Coloring_Union_Find(W, merge, -1)
Mod=998244353
TEN=[0]*(W+1); TEN[0]=1
for j in range(1,W+1):
TEN[j]=(10*TEN[j-1])%Mod
flag=1
Ans=[0]*H
S=0
for i in range(H):
Q=input()
data=defaultdict(list)
for j in range(W):
if "0"<=Q[j]<="9":
x=int(Q[j])
if U.get(j)!=-1 and U.get(j)!=x:
flag=False
if U.get(j)==-1:
S+=1
U.update(j,x)
elif "a"<=Q[j]<="z":
data[Q[j]].append(j)
else:
pass
for a in data:
for k in range(len(data[a])-1):
p=U.get(data[a][k]); q=U.get(data[a][k+1])
if p!=-1 and q!=-1:
if p!=q:
flag=False
if p==q and not U.same(data[a][k], data[a][k+1]):
S-=1
U.union(data[a][k], data[a][k+1])
Ans[i]=TEN[U.group_count()-S] if flag else 0
return Ans
#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write
write("\n".join(map(str,solve())))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0