結果
問題 | No.2293 無向辺 2-SAT |
ユーザー | minimum |
提出日時 | 2023-05-05 22:27:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,959 ms / 4,000 ms |
コード長 | 2,330 bytes |
コンパイル時間 | 398 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 123,120 KB |
最終ジャッジ日時 | 2024-05-02 17:14:24 |
合計ジャッジ時間 | 91,681 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
52,480 KB |
testcase_01 | AC | 46 ms
55,552 KB |
testcase_02 | AC | 45 ms
52,096 KB |
testcase_03 | AC | 2,959 ms
123,120 KB |
testcase_04 | AC | 875 ms
80,252 KB |
testcase_05 | AC | 828 ms
79,012 KB |
testcase_06 | AC | 859 ms
79,016 KB |
testcase_07 | AC | 602 ms
79,616 KB |
testcase_08 | AC | 802 ms
80,920 KB |
testcase_09 | AC | 785 ms
80,768 KB |
testcase_10 | AC | 898 ms
82,840 KB |
testcase_11 | AC | 838 ms
80,960 KB |
testcase_12 | AC | 916 ms
81,516 KB |
testcase_13 | AC | 875 ms
79,016 KB |
testcase_14 | AC | 1,017 ms
81,236 KB |
testcase_15 | AC | 1,318 ms
82,052 KB |
testcase_16 | AC | 834 ms
80,360 KB |
testcase_17 | AC | 912 ms
86,340 KB |
testcase_18 | AC | 807 ms
80,764 KB |
testcase_19 | AC | 482 ms
78,720 KB |
testcase_20 | AC | 1,723 ms
89,924 KB |
testcase_21 | AC | 1,949 ms
90,904 KB |
testcase_22 | AC | 1,703 ms
96,216 KB |
testcase_23 | AC | 1,631 ms
93,964 KB |
testcase_24 | AC | 1,688 ms
95,452 KB |
testcase_25 | AC | 1,575 ms
93,704 KB |
testcase_26 | AC | 1,620 ms
93,304 KB |
testcase_27 | AC | 1,678 ms
94,224 KB |
testcase_28 | AC | 1,686 ms
94,052 KB |
testcase_29 | AC | 1,670 ms
94,032 KB |
testcase_30 | AC | 1,660 ms
96,912 KB |
testcase_31 | AC | 1,646 ms
95,916 KB |
testcase_32 | AC | 2,201 ms
95,472 KB |
testcase_33 | AC | 2,276 ms
94,212 KB |
testcase_34 | AC | 1,628 ms
87,948 KB |
testcase_35 | AC | 2,196 ms
94,696 KB |
testcase_36 | AC | 2,191 ms
94,740 KB |
testcase_37 | AC | 2,227 ms
95,868 KB |
testcase_38 | AC | 2,234 ms
94,840 KB |
testcase_39 | AC | 2,220 ms
94,832 KB |
testcase_40 | AC | 2,239 ms
96,540 KB |
testcase_41 | AC | 908 ms
83,232 KB |
testcase_42 | AC | 1,769 ms
91,040 KB |
testcase_43 | AC | 2,140 ms
92,612 KB |
testcase_44 | AC | 2,249 ms
96,080 KB |
testcase_45 | AC | 2,160 ms
94,040 KB |
testcase_46 | AC | 2,032 ms
93,344 KB |
testcase_47 | AC | 1,853 ms
91,068 KB |
testcase_48 | AC | 1,784 ms
90,612 KB |
testcase_49 | AC | 1,681 ms
89,660 KB |
testcase_50 | AC | 1,669 ms
90,448 KB |
testcase_51 | AC | 1,611 ms
89,708 KB |
testcase_52 | AC | 1,599 ms
90,692 KB |
testcase_53 | AC | 1,567 ms
94,004 KB |
testcase_54 | AC | 1,500 ms
93,484 KB |
testcase_55 | AC | 1,371 ms
94,812 KB |
ソースコード
class DisjointSetUnion(): def __init__(self, n): self.n = n self.par_or_size = [-1] * n def merge(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) la = self.leader(a) lb = self.leader(b) if la == lb: return la if -self.par_or_size[la] < -self.par_or_size[lb]: la, lb = lb, la self.par_or_size[la] += self.par_or_size[lb] self.par_or_size[lb] = la return la def same(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) return self.leader(a) == self.leader(b) def leader(self, a): assert(0 <= a < self.n) if (self.par_or_size[a] < 0): return a else: self.par_or_size[a] = self.leader(self.par_or_size[a]) return self.par_or_size[a] def size(self, a): assert(0 <= a < self.n) return - self.par_or_size[self.leader(a)] def group(self): result = dict() for a in range(self.n): la = self.leader(a) if la not in result: result[la] = [] result[la].append(a) return result MOD = 998244353 N, Q = map(int, input().split()) cnt = N valid = 1 dsu = DisjointSetUnion(2 * N) done = set() for _ in range(Q): query = list(map(int, input().split())) if query[0] == 2: u, v = query[1] - 1, query[2] - 1 if u != v: done.add(u) done.add(v) if not dsu.same(u, v + N): cnt -= 1 dsu.merge(u, v + N) dsu.merge(v, u + N) if dsu.same(u, u + N): valid = 0 else: valid = 0 elif query[0] == 1: u, v = query[1] - 1, query[2] - 1 if u != v: done.add(u) done.add(v) if not dsu.same(u, v): cnt -= 1 dsu.merge(u, v) dsu.merge(u + N, v + N) if dsu.same(u, u + N): valid = 0 else: pass else: cnt = N for i in done: dsu.par_or_size[i] = -1 dsu.par_or_size[i + N] = -1 done = set() valid = 1 if valid: print(pow(2, cnt, MOD)) else: print(0)