結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2023-04-21 22:56:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 606 ms / 2,000 ms |
コード長 | 4,476 bytes |
コンパイル時間 | 670 ms |
コンパイル使用メモリ | 82,628 KB |
実行使用メモリ | 152,896 KB |
最終ジャッジ日時 | 2024-04-25 19:06:19 |
合計ジャッジ時間 | 22,586 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
53,384 KB |
testcase_01 | AC | 35 ms
53,992 KB |
testcase_02 | AC | 36 ms
54,824 KB |
testcase_03 | AC | 444 ms
124,508 KB |
testcase_04 | AC | 484 ms
135,912 KB |
testcase_05 | AC | 276 ms
104,028 KB |
testcase_06 | AC | 349 ms
109,396 KB |
testcase_07 | AC | 372 ms
111,520 KB |
testcase_08 | AC | 264 ms
103,820 KB |
testcase_09 | AC | 330 ms
118,312 KB |
testcase_10 | AC | 259 ms
98,412 KB |
testcase_11 | AC | 193 ms
88,388 KB |
testcase_12 | AC | 180 ms
92,684 KB |
testcase_13 | AC | 417 ms
119,936 KB |
testcase_14 | AC | 187 ms
98,132 KB |
testcase_15 | AC | 232 ms
98,476 KB |
testcase_16 | AC | 346 ms
111,668 KB |
testcase_17 | AC | 221 ms
91,952 KB |
testcase_18 | AC | 510 ms
130,756 KB |
testcase_19 | AC | 465 ms
137,128 KB |
testcase_20 | AC | 408 ms
125,552 KB |
testcase_21 | AC | 285 ms
101,384 KB |
testcase_22 | AC | 343 ms
113,760 KB |
testcase_23 | AC | 332 ms
110,952 KB |
testcase_24 | AC | 308 ms
113,340 KB |
testcase_25 | AC | 417 ms
123,188 KB |
testcase_26 | AC | 207 ms
97,752 KB |
testcase_27 | AC | 214 ms
93,516 KB |
testcase_28 | AC | 255 ms
98,736 KB |
testcase_29 | AC | 301 ms
106,844 KB |
testcase_30 | AC | 232 ms
96,060 KB |
testcase_31 | AC | 386 ms
117,348 KB |
testcase_32 | AC | 287 ms
106,004 KB |
testcase_33 | AC | 486 ms
135,500 KB |
testcase_34 | AC | 471 ms
128,736 KB |
testcase_35 | AC | 159 ms
90,424 KB |
testcase_36 | AC | 323 ms
108,504 KB |
testcase_37 | AC | 398 ms
115,796 KB |
testcase_38 | AC | 140 ms
84,552 KB |
testcase_39 | AC | 208 ms
88,640 KB |
testcase_40 | AC | 185 ms
88,960 KB |
testcase_41 | AC | 514 ms
136,844 KB |
testcase_42 | AC | 379 ms
119,372 KB |
testcase_43 | AC | 595 ms
147,512 KB |
testcase_44 | AC | 594 ms
147,292 KB |
testcase_45 | AC | 603 ms
152,896 KB |
testcase_46 | AC | 606 ms
149,284 KB |
testcase_47 | AC | 580 ms
149,880 KB |
testcase_48 | AC | 579 ms
151,272 KB |
testcase_49 | AC | 603 ms
151,132 KB |
testcase_50 | AC | 572 ms
150,700 KB |
testcase_51 | AC | 605 ms
149,724 KB |
testcase_52 | AC | 587 ms
150,848 KB |
ソースコード
import sys input = sys.stdin.readline class SCC: def __init__(self,n): self.n = n self.edges = [] def csr(self): self.start = [0]*(self.n+1) self.elist = [0]*len(self.edges) for e in self.edges: self.start[e[0]+1] += 1 for i in range(1,self.n+1): self.start[i] += self.start[i-1] counter = self.start[:] for e in self.edges: self.elist[counter[e[0]]] = e[1] counter[e[0]] += 1 def add_edge(self,u,v): self.edges.append((u,v)) def scc_ids(self): self.csr() n = self.n now_ord = group_num = 0 visited = [] low = [0]*n order = [-1]*n ids = [0]*n parent = [-1]*n stack = [] for i in range(n): if order[i] == -1: stack.append(i) stack.append(i) while stack: v = stack.pop() if order[v] == -1: low[v] = order[v] = now_ord now_ord += 1 visited.append(v) for i in range(self.start[v],self.start[v+1]): to = self.elist[i] if order[to] == -1: stack.append(to) stack.append(to) parent[to] = v else: low[v] = min(low[v],order[to]) else: if low[v] == order[v]: while True: u = visited.pop() order[u] = n ids[u] = group_num if u == v: break group_num += 1 if parent[v] != -1: low[parent[v]] = min(low[parent[v]],low[v]) for i,x in enumerate(ids): ids[i] = group_num-1-x return group_num,ids def scc(self): group_num,ids = self.scc_ids() groups = [[] for i in range(group_num)] for i,x in enumerate(ids): groups[x].append(i) return groups class Unionfind: def __init__(self,n): self.uf = [-1]*n def find(self,x): if self.uf[x] < 0: return x else: self.uf[x] = self.find(self.uf[x]) return self.uf[x] def same(self,x,y): return self.find(x) == self.find(y) def union(self,x,y): x = self.find(x) y = self.find(y) if x == y: return False if self.uf[x] > self.uf[y]: x,y = y,x self.uf[x] += self.uf[y] self.uf[y] = x return True def size(self,x): x = self.find(x) return -self.uf[x] n,q = map(int,input().split()) e = [[] for i in range(n)] re = [[] for i in range(n)] mod = 998244353 ans = 1 scc = SCC(n) for i in range(q): a,b,c = map(int,input().split()) a,b = a-1,b-1 scc.add_edge(a,b) e[a].append([b,c]) re[b].append([a,c]) vis = [0]*n id = 0 def search(u,c,id): dic = {} dic[u] = c vis[u] = id q = [u] ok = 1 # print(u,c,dic) while q: now = q.pop() c = dic[now] # print(now,c) for nex,nc in e[now]: if c == 0: judge = nc else: judge = nc^1 # print(now,nex,nc,judge,dic) if nex in dic and dic[nex] != judge: ok = 0 if vis[nex] == id: continue dic[nex] = judge vis[nex] = id q.append(nex) for nex,nc in re[now]: if nc == c: judge = 0 else: judge = 1 if nex in dic and dic[nex] != judge: ok = 0 if vis[nex] == id: continue dic[nex] = judge vis[nex] = id q.append(nex) # print(ok) return ok gr = scc.scc() for g in gr: # print(g) if vis[g[0]]: continue u = g[0] num = search(u,0,id+1) + search(u,1,id+2) ans *= num ans %= mod id += 2 print(ans)