#861233 (C++17) No.2277 Honest or Dishonest ?

• 問題: No.2277 Honest or Dishonest ?
• ユーザー: Forested
• 提出日時: 2023-04-21 21:36:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 4,309 bytes
• コンパイル時間: 1,282 ms
• コンパイル使用メモリ: 131,040 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-04-25 18:50:26
• 合計ジャッジ時間: 3,870 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	27 ms; 6,940 KB
testcase_04	AC	27 ms; 6,944 KB
testcase_05	AC	9 ms; 6,944 KB
testcase_06	AC	24 ms; 6,944 KB
testcase_07	AC	20 ms; 6,940 KB
testcase_08	AC	7 ms; 6,944 KB
testcase_09	AC	17 ms; 6,944 KB
testcase_10	AC	14 ms; 6,944 KB
testcase_11	AC	7 ms; 6,944 KB
testcase_12	AC	14 ms; 6,940 KB
testcase_13	AC	27 ms; 6,940 KB
testcase_14	AC	18 ms; 6,940 KB
testcase_15	AC	9 ms; 6,940 KB
testcase_16	AC	20 ms; 6,944 KB
testcase_17	AC	10 ms; 6,940 KB
testcase_18	AC	26 ms; 6,944 KB
testcase_19	AC	27 ms; 6,944 KB
testcase_20	AC	21 ms; 6,940 KB
testcase_21	AC	21 ms; 6,940 KB
testcase_22	AC	19 ms; 6,944 KB
testcase_23	AC	28 ms; 6,940 KB
testcase_24	AC	17 ms; 6,944 KB
testcase_25	AC	20 ms; 6,944 KB
testcase_26	AC	5 ms; 6,944 KB
testcase_27	AC	14 ms; 6,944 KB
testcase_28	AC	9 ms; 6,940 KB
testcase_29	AC	14 ms; 6,944 KB
testcase_30	AC	13 ms; 6,944 KB
testcase_31	AC	21 ms; 6,940 KB
testcase_32	AC	13 ms; 6,940 KB
testcase_33	AC	26 ms; 6,944 KB
testcase_34	AC	28 ms; 6,944 KB
testcase_35	AC	4 ms; 6,944 KB
testcase_36	AC	17 ms; 6,944 KB
testcase_37	AC	26 ms; 6,940 KB
testcase_38	AC	7 ms; 6,940 KB
testcase_39	AC	10 ms; 6,940 KB
testcase_40	AC	3 ms; 6,940 KB
testcase_41	AC	29 ms; 6,944 KB
testcase_42	AC	20 ms; 6,940 KB
testcase_43	AC	30 ms; 6,944 KB
testcase_44	AC	33 ms; 6,940 KB
testcase_45	AC	34 ms; 6,944 KB
testcase_46	AC	34 ms; 6,944 KB
testcase_47	AC	33 ms; 6,944 KB
testcase_48	AC	34 ms; 6,940 KB
testcase_49	AC	29 ms; 6,940 KB
testcase_50	AC	29 ms; 6,944 KB
testcase_51	AC	31 ms; 6,944 KB
testcase_52	AC	30 ms; 6,940 KB

ソースコード

#ifndef LOCAL
#define FAST_IO
#endif

#define INT128

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

template <typename T>
Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) {
    if (a.empty()) {
        return Vec<tuple<i32, i32, T>>();
    }
    Vec<tuple<i32, i32, T>> ret;
    i32 prv = 0;
    REP(i, 1, a.size()) {
        if (a[i - 1] != a[i]) {
            ret.emplace_back(prv, i, a[i - 1]);
            prv = i;
        }
    }
    ret.emplace_back(prv, (i32)a.size(), a.back());
    return ret;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

// ============

#include <cassert>
#include <utility>
#include <vector>

class UnionFind {
    std::vector<int> par;

    int _root(int v) {
        if (par[v] < 0) {
            return v;
        } else {
            return par[v] = _root(par[v]);
        }
    }

public:
    UnionFind(int n) : par(n, -1) {}

    int root(int v) {
        assert(v >= 0 && v < (int) par.size());
        return _root(v);
    }

    int size(int v) {
        assert(v >= 0 && v < (int) par.size());
        return -par[_root(v)];
    }

    bool unite(int u, int v) {
        assert(u >= 0 && u < (int) par.size() && v >= 0 && v < (int) par.size());
        u = _root(u);
        v = _root(v);
        if (u == v) {
            return false;
        }
        if (par[u] < par[v]) {
            std::swap(u, v);
        }
        par[v] += par[u];
        par[u] = v;
        return true;
    }

    bool same(int u, int v) {
        assert(u >= 0 && u < (int) par.size() && v >= 0 && v < (int) par.size());
        return _root(u) == _root(v);
    }
};

// ============

int main() {
    i32 n, q;
    cin >> n >> q;
    Vec<i32> a(q), b(q), c(q);
    REP(i, q) {
        cin >> a[i] >> b[i] >> c[i];
        --a[i];
        --b[i];
    }
    UnionFind uf(2 * n);
    REP(i, q) {
        if (c[i] == 0) {
            uf.unite(a[i], b[i]);
            uf.unite(a[i] + n, b[i] + n);
        } else {
            uf.unite(a[i], b[i] + n);
            uf.unite(a[i] + n, b[i]);
        }
    }
    REP(i, n) {
        if (uf.same(i, i + n)) {
            cout << 0 << '\n';
            exit(0);
        }
    }
    i32 comp = n;
    uf = UnionFind(n);
    REP(i, q) {
        comp -= uf.unite(a[i], b[i]);
    }
    i32 ans = 1;
    constexpr i32 MOD = 998244353;
    REP(i, comp) {
        ans += ans;
        if (ans >= MOD) {
            ans -= MOD;
        }
    }
    cout << ans << '\n';
}