結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | Shirotsume |
提出日時 | 2023-04-21 22:11:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 509 ms / 2,000 ms |
コード長 | 2,334 bytes |
コンパイル時間 | 410 ms |
コンパイル使用メモリ | 82,400 KB |
実行使用メモリ | 108,652 KB |
最終ジャッジ日時 | 2024-04-25 18:59:25 |
合計ジャッジ時間 | 19,020 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
54,236 KB |
testcase_01 | AC | 36 ms
54,784 KB |
testcase_02 | AC | 40 ms
55,068 KB |
testcase_03 | AC | 411 ms
90,208 KB |
testcase_04 | AC | 442 ms
95,336 KB |
testcase_05 | AC | 169 ms
89,796 KB |
testcase_06 | AC | 369 ms
84,480 KB |
testcase_07 | AC | 367 ms
86,300 KB |
testcase_08 | AC | 175 ms
108,652 KB |
testcase_09 | AC | 366 ms
95,840 KB |
testcase_10 | AC | 321 ms
81,928 KB |
testcase_11 | AC | 260 ms
80,128 KB |
testcase_12 | AC | 168 ms
78,628 KB |
testcase_13 | AC | 401 ms
87,136 KB |
testcase_14 | AC | 132 ms
77,248 KB |
testcase_15 | AC | 165 ms
87,136 KB |
testcase_16 | AC | 388 ms
85,512 KB |
testcase_17 | AC | 294 ms
81,036 KB |
testcase_18 | AC | 453 ms
95,092 KB |
testcase_19 | AC | 450 ms
94,624 KB |
testcase_20 | AC | 401 ms
89,360 KB |
testcase_21 | AC | 293 ms
81,192 KB |
testcase_22 | AC | 400 ms
87,984 KB |
testcase_23 | AC | 282 ms
80,244 KB |
testcase_24 | AC | 399 ms
92,252 KB |
testcase_25 | AC | 366 ms
100,408 KB |
testcase_26 | AC | 130 ms
103,360 KB |
testcase_27 | AC | 253 ms
79,136 KB |
testcase_28 | AC | 186 ms
86,044 KB |
testcase_29 | AC | 247 ms
90,656 KB |
testcase_30 | AC | 305 ms
79,864 KB |
testcase_31 | AC | 366 ms
81,276 KB |
testcase_32 | AC | 259 ms
92,124 KB |
testcase_33 | AC | 476 ms
93,916 KB |
testcase_34 | AC | 407 ms
81,812 KB |
testcase_35 | AC | 113 ms
96,076 KB |
testcase_36 | AC | 337 ms
81,392 KB |
testcase_37 | AC | 329 ms
80,272 KB |
testcase_38 | AC | 147 ms
77,772 KB |
testcase_39 | AC | 221 ms
78,736 KB |
testcase_40 | AC | 109 ms
89,972 KB |
testcase_41 | AC | 406 ms
82,004 KB |
testcase_42 | AC | 339 ms
80,392 KB |
testcase_43 | AC | 431 ms
82,452 KB |
testcase_44 | AC | 477 ms
98,500 KB |
testcase_45 | AC | 470 ms
98,676 KB |
testcase_46 | AC | 491 ms
98,260 KB |
testcase_47 | AC | 509 ms
99,292 KB |
testcase_48 | AC | 494 ms
101,500 KB |
testcase_49 | AC | 436 ms
83,200 KB |
testcase_50 | AC | 415 ms
82,304 KB |
testcase_51 | AC | 394 ms
82,192 KB |
testcase_52 | AC | 421 ms
82,720 KB |
ソースコード
import sys from collections import deque, Counter input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.num = 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 x self.num -= 1 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 x 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 def count(self): return self.num n, q = mi() U = dsu(2 * n) for _ in range(q): a, b, c = mi() a -= 1; b -= 1 if c == 0: U.merge(a, b) U.merge(a + n, b + n) else: U.merge(a, n + b) U.merge(a + n, b) for i in range(n): if U.same(i, n + i): print(0) exit() ans = pow(2, len(U.groups()) // 2, mod) print(ans)