結果
問題 | No.2293 無向辺 2-SAT |
ユーザー |
|
提出日時 | 2023-05-05 22:36:11 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 174 ms / 4,000 ms |
コード長 | 1,631 bytes |
コンパイル時間 | 1,714 ms |
コンパイル使用メモリ | 171,060 KB |
実行使用メモリ | 73,716 KB |
最終ジャッジ日時 | 2024-11-23 09:43:16 |
合計ジャッジ時間 | 12,225 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
#include<bits/stdc++.h> using namespace std; typedef long long ll; const ll mod = 998244353; ll t = 1,n,m,k,q,l,r,a,b,c,u,v,x,y,z,sz,cnt,o,fl,pw[400009],id[400009]; string s; struct st{ll x,y; /*bool operator < (const st &a) const{return x < a.x;};*/}; vector <st> del; bool cmp(const st &a,const st &b){return a.x < b.x;} inline ll read(){ ll s = 0,w = 1; char ch = getchar(); while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();} while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar(); return s * w; } ll qp(ll x,ll y){ ll a = 1,b = x; while (y){ if (y & 1) a = a * b % mod; b = b * b % mod,y >>= 1; } return a; } ll find(ll x){ if (x == id[x]) return x; ll qwq = find(id[x]); del.emplace_back((st){x,id[x]}),id[x] = qwq; return qwq; } void merge(ll x,ll y){ ll qwq = find(x),awa = find(y); if (qwq == awa) return; sz -= 1; del.emplace_back((st){qwq,id[qwq]}),id[qwq] = awa; if (x > n) x -= n; if (y > n) y -= n; if (find(x) == find(x + n)) fl = 1; if (find(y) == find(y + n)) fl = 1; } void clear(){ while (del.size()) id[del.back().x] = del.back().y,del.pop_back(); sz = 2 * n,fl = 0; } int main(){//t = read(); while (t --){ pw[0] = 1; n = read(),q = read(),sz = 2 * n; for (ll i = 1;i <= n;i += 1) pw[i] = (pw[i - 1] << 1) % mod; for (ll i = 1;i <= 2 * n;i += 1) id[i] = i; for (ll i = 1;i <= q;i += 1){ o = read(); if (o == 1) x = read(),y = read(),merge(x,y),merge(x + n,y + n); if (o == 2) x = read(),y = read(),merge(x,y + n),merge(x + n,y); if (o == 3) clear(); if (fl) puts("0"); else printf("%lld\n",pw[sz >> 1]); } } return 0; }