結果
問題 | No.2293 無向辺 2-SAT |
ユーザー | vwxyz |
提出日時 | 2023-11-30 13:31:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,090 ms / 4,000 ms |
コード長 | 5,453 bytes |
コンパイル時間 | 814 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 195,248 KB |
最終ジャッジ日時 | 2023-11-30 13:32:42 |
合計ジャッジ時間 | 87,805 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 151 ms
88,556 KB |
testcase_01 | AC | 205 ms
159,636 KB |
testcase_02 | AC | 151 ms
88,556 KB |
testcase_03 | AC | 2,090 ms
162,972 KB |
testcase_04 | AC | 920 ms
171,960 KB |
testcase_05 | AC | 819 ms
132,360 KB |
testcase_06 | AC | 788 ms
131,812 KB |
testcase_07 | AC | 379 ms
161,564 KB |
testcase_08 | AC | 842 ms
171,608 KB |
testcase_09 | AC | 728 ms
162,204 KB |
testcase_10 | AC | 849 ms
162,200 KB |
testcase_11 | AC | 892 ms
171,724 KB |
testcase_12 | AC | 832 ms
171,604 KB |
testcase_13 | AC | 701 ms
96,000 KB |
testcase_14 | AC | 837 ms
97,508 KB |
testcase_15 | AC | 1,167 ms
105,088 KB |
testcase_16 | AC | 902 ms
171,504 KB |
testcase_17 | AC | 989 ms
179,248 KB |
testcase_18 | AC | 837 ms
171,588 KB |
testcase_19 | AC | 533 ms
131,848 KB |
testcase_20 | AC | 1,610 ms
183,692 KB |
testcase_21 | AC | 1,707 ms
185,248 KB |
testcase_22 | AC | 1,759 ms
193,732 KB |
testcase_23 | AC | 1,633 ms
191,836 KB |
testcase_24 | AC | 1,640 ms
192,000 KB |
testcase_25 | AC | 1,641 ms
189,864 KB |
testcase_26 | AC | 1,664 ms
192,648 KB |
testcase_27 | AC | 1,717 ms
192,532 KB |
testcase_28 | AC | 1,722 ms
193,416 KB |
testcase_29 | AC | 1,668 ms
192,928 KB |
testcase_30 | AC | 1,773 ms
194,264 KB |
testcase_31 | AC | 1,638 ms
188,724 KB |
testcase_32 | AC | 1,921 ms
162,768 KB |
testcase_33 | AC | 1,918 ms
162,772 KB |
testcase_34 | AC | 2,004 ms
162,716 KB |
testcase_35 | AC | 1,961 ms
163,804 KB |
testcase_36 | AC | 1,975 ms
164,676 KB |
testcase_37 | AC | 1,979 ms
164,616 KB |
testcase_38 | AC | 1,926 ms
163,228 KB |
testcase_39 | AC | 1,953 ms
163,888 KB |
testcase_40 | AC | 1,948 ms
164,900 KB |
testcase_41 | AC | 1,023 ms
161,684 KB |
testcase_42 | AC | 1,637 ms
162,200 KB |
testcase_43 | AC | 1,914 ms
164,120 KB |
testcase_44 | AC | 1,991 ms
175,832 KB |
testcase_45 | AC | 1,011 ms
161,820 KB |
testcase_46 | AC | 1,785 ms
184,744 KB |
testcase_47 | AC | 1,677 ms
184,900 KB |
testcase_48 | AC | 1,619 ms
184,784 KB |
testcase_49 | AC | 1,610 ms
184,532 KB |
testcase_50 | AC | 1,586 ms
183,960 KB |
testcase_51 | AC | 1,580 ms
185,064 KB |
testcase_52 | AC | 1,575 ms
185,168 KB |
testcase_53 | AC | 1,523 ms
188,032 KB |
testcase_54 | AC | 1,574 ms
193,192 KB |
testcase_55 | AC | 1,530 ms
195,248 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) class UnionFind: def __init__(self,N,label=None,f=None,weighted=False,rollback=False): self.N=N self.parents=[None]*self.N self.size=[1]*self.N self.roots={i for i in range(self.N)} self.label=label if self.label!=None: self.label=[x for x in label] self.f=f self.weighted=weighted if self.weighted: self.weight=[0]*self.N self.rollback=rollback if self.rollback: self.operate_list=[] self.operate_set=[] def Find(self,x): stack=[] while self.parents[x]!=None: stack.append(x) x=self.parents[x] if not self.rollback: if self.weighted: w=0 for y in stack[::-1]: self.parents[y]=x w+=self.weight[y] self.weight[y]=w else: for y in stack[::-1]: self.parents[y]=x return x def Union(self,x,y,w=None): root_x=self.Find(x) root_y=self.Find(y) if self.rollback: self.operate_list.append([]) self.operate_set.append([]) if root_x==root_y: if self.weighted: if self.weight[y]-self.weight[x]==w: return True else: return False else: if self.size[root_x]<self.size[root_y]: x,y=y,x root_x,root_y=root_y,root_x if self.weighted: w=-w if self.rollback: self.operate_list[-1].append((self.parents,root_y,self.parents[root_y])) self.operate_list[-1].append((self.size,root_x,self.size[root_x])) self.operate_set[-1].append(root_y) if self.label!=None: self.operate_list[-1]((self.label,root_x,self.label[root_x])) if self.weighted: self.operate_list[-1].append((self.weight,root_y,self.weight[root_y])) self.parents[root_y]=root_x self.size[root_x]+=self.size[root_y] self.roots.remove(root_y) if self.label!=None: self.label[root_x]=self.f(self.label[root_x],self.label[root_y]) if self.weighted: self.weight[root_y]=w+self.weight[x]-self.weight[y] def Size(self,x): return self.size[self.Find(x)] def Same(self,x,y): return self.Find(x)==self.Find(y) def Label(self,x): return self.label[self.Find(x)] def Weight(self,x,y): root_x=self.Find(x) root_y=self.Find(y) if root_x!=root_y: return None return self.weight[y]-self.weight[x] def Roots(self): return list(self.roots) def Linked_Components_Count(self): return len(self.roots) def Linked_Components(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return linked_components def Rollback(self): assert self.rollback if self.operate_list: for lst,x,v in self.operate_list.pop(): lst[x]=v for x in self.operate_set.pop(): self.roots.add(x) return True else: return False def __str__(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys()))) N,Q=map(int,readline().split()) mod=998244353 UF=UnionFind(2*N) exist=True record=set() for q in range(Q): query=tuple(map(int,readline().split())) if query[0]==2: _,u,v=query u-=1;v-=1 UF.Union(u*2,v*2+1) UF.Union(v*2,u*2+1) record.add(u) record.add(v) if UF.Same(u*2,u*2+1): exist=False elif query[0]==1: _,u,v=query u-=1;v-=1 UF.Union(u*2,v*2) UF.Union(v*2+1,u*2+1) record.add(u) record.add(v) if UF.Same(u*2,u*2+1): exist=False else: for x in record: UF.parents[2*x]=None UF.parents[2*x+1]=None UF.size[2*x]=1 UF.size[2*x+1]=1 UF.roots.add(2*x) UF.roots.add(2*x+1) record=set() exist=True if exist: ans=pow(2,UF.Linked_Components_Count()//2,mod) else: ans=0 print(ans)