結果
問題 | No.2291 Union Find Estimate |
ユーザー |
|
提出日時 | 2023-05-06 04:04:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,076 bytes |
コンパイル時間 | 215 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 95,528 KB |
最終ジャッジ日時 | 2024-11-23 15:28:30 |
合計ジャッジ時間 | 3,981 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 1 |
other | AC * 16 WA * 2 |
ソースコード
MOD = 998244353class UnionFind:def __init__(self, n):self.node = [-1 for _ in range(n)]def root(self, v):if self.node[v] < 0:return vst = []while self.node[v] >= 0:st.append(v)v = self.node[v]for u in st:self.node[u] = vreturn vdef size(self, v):v = self.root(v)return (- self.node[v])def same(self, u, v):return self.root(u) == self.root(v)def unite(self, u, v):ru = self.root(u)rv = self.root(v)if ru == rv:returndu = self.node[ru]dv = self.node[rv]if du <= dv:self.node[rv] = ruself.node[ru] += dvelse:self.node[ru] = rvself.node[rv] += duw, h = map(int, input().split())uf = UnionFind(w)num = [None for _ in range(w)]flg = Truefor _ in range(h):qi = input()ans = 1if not flg:ans = 0idx = {}for j in range(w * ans):if qi[j] == "?":continueelif ord("a") <= ord(qi[j]) <= ord("z"):if idx.get(qi[j], None) is None:idx[qi[j]] = jelse:uf.unite(idx[qi[j]], j)r = uf.root(j)none_r = num[r] is Nonenone_j = num[j] is Noneif not none_r and not none_j:if num[r] != num[j]:flg = Falseans = 0breakelif none_r and not none_j:num[r] = num[j]elif none_j and not none_r:num[j] = num[r]else:if num[j] is None:num[j] = int(qi[j])elif num[j] != int(qi[j]):flg = Falseans = 0breakpar = {}for v in range(w * ans):r = uf.root(v)none_r = num[r] is Nonenone_v = num[v] is Noneif not none_r and not none_v:if num[r] != num[v]:flg = Falseans = 0breakelif none_r and not none_v:num[r] = num[v]elif none_v and not none_r:num[v] = num[r]if par.get(r, None) is None:par[r] = num[r]for k, v in par.items():if v is None:ans = (ans * 10) % MODprint(ans)