#867055 (C++17) No.2293 無向辺 2-SAT

提出ソース

結果

問題	No.2293 無向辺 2-SAT
ユーザー	jabee
提出日時	2023-05-06 22:08:07
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	890 ms / 4,000 ms
コード長	6,646 bytes
コンパイル時間	6,402 ms
コンパイル使用メモリ	286,876 KB
実行使用メモリ	51,200 KB
最終ジャッジ日時	2024-11-24 02:52:20
合計ジャッジ時間	30,085 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	32 ms 19,052 KB
testcase_01	AC	35 ms 19,840 KB
testcase_02	AC	34 ms 19,072 KB
testcase_03	AC	890 ms 51,200 KB
testcase_04	AC	254 ms 20,224 KB
testcase_05	AC	253 ms 19,712 KB
testcase_06	AC	216 ms 19,584 KB
testcase_07	AC	65 ms 19,712 KB
testcase_08	AC	209 ms 19,840 KB
testcase_09	AC	153 ms 19,840 KB
testcase_10	AC	153 ms 19,712 KB
testcase_11	AC	265 ms 20,224 KB
testcase_12	AC	213 ms 19,840 KB
testcase_13	AC	205 ms 19,200 KB
testcase_14	AC	204 ms 19,200 KB
testcase_15	AC	207 ms 19,072 KB
testcase_16	AC	262 ms 20,096 KB
testcase_17	AC	334 ms 22,972 KB
testcase_18	AC	234 ms 20,096 KB
testcase_19	AC	135 ms 19,584 KB
testcase_20	AC	235 ms 19,968 KB
testcase_21	AC	211 ms 19,712 KB
testcase_22	AC	299 ms 20,864 KB
testcase_23	AC	286 ms 20,992 KB
testcase_24	AC	289 ms 20,992 KB
testcase_25	AC	286 ms 20,992 KB
testcase_26	AC	280 ms 20,992 KB
testcase_27	AC	283 ms 20,860 KB
testcase_28	AC	283 ms 20,992 KB
testcase_29	AC	285 ms 20,992 KB
testcase_30	AC	284 ms 20,864 KB
testcase_31	AC	282 ms 20,992 KB
testcase_32	AC	233 ms 19,712 KB
testcase_33	AC	233 ms 19,840 KB
testcase_34	AC	230 ms 19,712 KB
testcase_35	AC	235 ms 19,840 KB
testcase_36	AC	234 ms 19,712 KB
testcase_37	AC	231 ms 19,840 KB
testcase_38	AC	236 ms 19,712 KB
testcase_39	AC	235 ms 19,712 KB
testcase_40	AC	230 ms 19,712 KB
testcase_41	AC	257 ms 19,840 KB
testcase_42	AC	249 ms 19,840 KB
testcase_43	AC	237 ms 19,840 KB
testcase_44	AC	222 ms 19,840 KB
testcase_45	AC	214 ms 19,712 KB
testcase_46	AC	213 ms 19,840 KB
testcase_47	AC	217 ms 19,968 KB
testcase_48	AC	216 ms 19,840 KB
testcase_49	AC	225 ms 19,840 KB
testcase_50	AC	233 ms 19,968 KB
testcase_51	AC	246 ms 20,096 KB
testcase_52	AC	251 ms 20,352 KB
testcase_53	AC	270 ms 20,608 KB
testcase_54	AC	303 ms 21,504 KB
testcase_55	AC	337 ms 23,296 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
void _main() {
    ll n,qq;
    cin >> n >> qq;
    queue<vector<ll>>q;
    set<ll>st;
    map<ll,ll>mp;
    vector<mint>two(n+1);
    two[0] = 1;
    rep(i,1,n+1)two[i] = two[i-1] * 2;
    rep(i,0,qq){
        ll t;
        cin >> t;
        if(t == 1 || t == 2){
            ll u,v;
            cin >> u >> v;
            u--; v--;
            st.insert(u);
            st.insert(v);
            q.push({t,u,v});
        }else{
            ll cnt = 0;
            for(auto e:st){
                mp[e] = cnt;
                cnt++;
            }
            dsu d(cnt * 2);
            ll unused = n - cnt;
            ll siz = cnt;
            bool ok = true;
            while(q.size()){
                ll tt,u,v;
                vector<ll>vec = q.front();
                q.pop();
                tt = vec[0];
                u = mp[vec[1]];
                v = mp[vec[2]];
                if(tt == 1){
                    if(!d.same(u,v))siz--;
                    d.merge(u,v);
                    d.merge(u+cnt,v+cnt);
                    if(d.same(u,u+cnt))ok = false;
                }
                if(tt == 2){
                    if(!d.same(u,v+cnt))siz--;
                    d.merge(u,v+cnt);
                    d.merge(u+cnt,v);
                    if(d.same(u,u+cnt))ok = false;
                }
                if(ok)cout << two[siz + unused]<< "\n";
                else cout << 0 << endl;
            }
            cout << two[n]<< "\n";
            set<ll>nst;
            map<ll,ll>nmp;
            swap(st,nst);
            swap(mp,nmp);
        }
    }
            ll cnt = 0;
            for(auto e:st){
                mp[e] = cnt;
                cnt++;
            }
            dsu d(cnt * 2);
            ll unused = n - cnt;
            ll siz = cnt;
            bool ok = true;
            while(q.size()){
                ll tt,u,v;
                vector<ll>vec = q.front();
                q.pop();
                tt = vec[0];
                u = mp[vec[1]];
                v = mp[vec[2]];
                if(tt == 1){
                    if(!d.same(u,v))siz--;
                    d.merge(u,v);
                    d.merge(u+cnt,v+cnt);
                    if(d.same(u,u+cnt))ok = false;
                }
                if(tt == 2){
                    if(!d.same(u,v+cnt))siz--;
                    d.merge(u,v+cnt);
                    d.merge(u+cnt,v);
                    if(d.same(u,u+cnt))ok = false;
                }
                if(ok)cout << two[siz + unused]<< "\n";
                else cout << 0 << endl;
            }   
}

yukicoder

結果

テストケース

ソースコード