結果
問題 | No.1703 Much Matching |
ユーザー |
![]() |
提出日時 | 2021-08-26 18:42:12 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,617 bytes |
コンパイル時間 | 160 ms |
コンパイル使用メモリ | 82,832 KB |
実行使用メモリ | 315,584 KB |
最終ジャッジ日時 | 2024-07-23 03:27:19 |
合計ジャッジ時間 | 10,494 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 WA * 18 |
ソースコード
from sys import stderrperr=lambda x:stderr.write(str(x)+"\n")class INPUT:def __init__(self):self._l=open(0).read().split()self._length=len(self._l)self._index=0returndef stream(self,k=1,f=int,f2=False):assert(-1<k)if self._length==self._index or self._length-self._index<k:raise Exception("There is no input!")elif f!=str:if k==0:ret=list(map(f,self._l[self._index:]))self._index=self._lengthreturn retif k==1 and not f2:ret=f(self._l[self._index])self._index+=1return retif k==1 and f2:ret=[f(self._l[self._index])]self._index+=1return retret=[]for _ in [0]*k:ret.append(f(self._l[self._index]))self._index+=1return retelse:if k==0:ret=list(self._l[self._index:])self._index=self._lengthreturn retif k==1 and not f2:ret=self._l[self._index]self._index+=1return retif k==1 and f2:ret=[self._l[self._index]]self._index+=1return retret=[]for _ in [0]*k:ret.append(self._l[self._index])self._index+=1return retpin=INPUT().stream#pin(number[default:1],f[default:int],f2[default:False])#if number==0 -> return left all#listを変数で受け取るとき、必ずlistをTrueにすること。class dsu:def __init__(self,n):assert n>0,"n must be Natural"self.n=nself.parents=[-1]*nreturndef find(self,x):assert x<self.n,"warning!! this is 0 index"if self.parents[x]<0:return xself.parents[x]=self.find(self.parents[x])return self.parents[x]def merge(self,x,y):assert x<self.n and y<self.n,"warning!! this is 0 index"x=self.find(x)y=self.find(y)if x==y:returnif self.parents[x]>self.parents[y]:x,y=y,xself.parents[x]+=self.parents[y]self.parents[y]=xreturndef size(self,x):assert x<self.n,"warning!! this is 0 index"return -self.parents[self.find(x)]def same(self,x,y):assert x<self.n and y<self.n,"warning!! this is 0 index"return self.find(x)==self.find(y)def leader(self,x):assert x<self.n,"warning!! this is 0 index"if self.parents[x]<0:return xself.parents[x]=self.leader(self.parents[x])return self.parents[x]def groups(self):ld=[self.leader(i) for i in range(self.n)]res=[[] for _ in range(self.n)]for i in range(self.n):res[ld[i]].append(i)return list(filter(lambda a:a !=[],res))def lcs(S,T):dp=[[0]*(len(T)+1)for _ in[0]*(len(S)+1)]for i in range(1,len(S)+1):for j in range(1,len(T)+1):if S[i-1]==T[j-1]:dp[i][j]=dp[i-1][j-1]+1else:dp[i][j]=max(dp[i-1][j],dp[i][j-1])length=dp[len(S)][len(T)]i=len(S)j=len(T)ans=[]while length>0:if S[i-1]==T[j-1]:ans.append(S[i-1])i-=1j-=1length-=1elif dp[i][j]==dp[i-1][j]:i-=1else:j-=1return len(ans[::-1])def main():N,M,Q=pin(3)assert(1<=N<=1000)assert(1<=M<=1000)assert(1<=Q<=N*M)uf=dsu(N+M)validation_set=set()for _ in[0]*Q:a,b=pin(2)assert(1<=a<=N)assert(1<=b<=M)validation_set.add((a,b))uf.merge(a-1,N+b-1)assert(len(validation_set)==Q)A=list(range(0,N))B=list(range(N,N+M))g=uf.groups()for i in g:for j in i:if j<N:A[j]=i[0]else:B[j-N]=i[0]ans=lcs(A,B)print(ans)returnmain()