結果
問題 | No.2251 Marking Grid |
ユーザー | googol_S0 |
提出日時 | 2023-03-17 21:32:54 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,130 bytes |
コンパイル時間 | 191 ms |
コンパイル使用メモリ | 81,648 KB |
実行使用メモリ | 232,340 KB |
最終ジャッジ日時 | 2023-10-18 14:01:47 |
合計ジャッジ時間 | 26,947 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,440 KB |
testcase_01 | AC | 39 ms
53,440 KB |
testcase_02 | AC | 38 ms
53,440 KB |
testcase_03 | AC | 38 ms
53,440 KB |
testcase_04 | AC | 39 ms
53,440 KB |
testcase_05 | AC | 38 ms
53,440 KB |
testcase_06 | AC | 39 ms
53,440 KB |
testcase_07 | AC | 38 ms
53,440 KB |
testcase_08 | AC | 39 ms
53,440 KB |
testcase_09 | AC | 39 ms
53,440 KB |
testcase_10 | AC | 37 ms
53,440 KB |
testcase_11 | AC | 39 ms
53,440 KB |
testcase_12 | AC | 37 ms
53,440 KB |
testcase_13 | AC | 38 ms
53,440 KB |
testcase_14 | AC | 37 ms
53,440 KB |
testcase_15 | AC | 39 ms
53,440 KB |
testcase_16 | AC | 39 ms
53,440 KB |
testcase_17 | AC | 38 ms
53,440 KB |
testcase_18 | AC | 37 ms
53,440 KB |
testcase_19 | AC | 39 ms
53,440 KB |
testcase_20 | AC | 38 ms
53,440 KB |
testcase_21 | AC | 38 ms
53,440 KB |
testcase_22 | AC | 2,762 ms
189,848 KB |
testcase_23 | TLE | - |
testcase_24 | AC | 142 ms
81,332 KB |
testcase_25 | TLE | - |
testcase_26 | AC | 738 ms
109,172 KB |
testcase_27 | AC | 1,786 ms
162,188 KB |
testcase_28 | AC | 122 ms
79,368 KB |
testcase_29 | AC | 1,923 ms
160,072 KB |
testcase_30 | AC | 612 ms
112,408 KB |
testcase_31 | AC | 419 ms
95,260 KB |
testcase_32 | AC | 169 ms
80,720 KB |
testcase_33 | AC | 2,315 ms
168,472 KB |
testcase_34 | AC | 207 ms
80,596 KB |
testcase_35 | AC | 1,071 ms
125,772 KB |
testcase_36 | AC | 1,368 ms
130,920 KB |
testcase_37 | AC | 1,892 ms
153,048 KB |
testcase_38 | AC | 127 ms
80,416 KB |
testcase_39 | AC | 90 ms
73,672 KB |
testcase_40 | AC | 910 ms
109,304 KB |
testcase_41 | AC | 405 ms
89,740 KB |
ソースコード
class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return False if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return True def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 mod=998244353 H,W=map(int,input().split()) A=[list(map(int,input().split())) for i in range(H)] D=dsu(H+W) P=pow(2,H+W-1,mod) Q=pow(2,mod-2,mod) S=[] for i in range(H): for j in range(W): S.append((A[i][j],i,j)) S.append((0,-1,-1)) S.sort(reverse=True) ANS=(P-1)*S[0][0]%mod for i in range(H*W): x,y=S[i][1],S[i][2] z=S[i][0]-S[i+1][0] if D.merge(x,H+y): P=P*Q%mod if P==1: break ANS=(ANS-(P-1)*z)%mod print(ANS%mod)