Test/yukicoder/yuki2277.test.cpp

View this file on GitHub
Last update: 2023-12-31 19:45:58+09:00
Problem: https://yukicoder.me/problems/no/2277

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/no/2277"

#include <bits/stdc++.h>

#include "Graph/dsu_01_xor.hpp"

#include "Math/modint.hpp"

using mint = prime_modint<998244353>;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int N, Q;
    std::cin >> N >> Q;
    xor_dsu<int> uf(N);
    bool flg = true;
    while(Q--){
        int u, v, d;
        std::cin >> u >> v >> d;
        flg &= uf.merge(--u, --v, d);
    }
    std::cout << (flg ? mint(2).pow(uf.size()) : 0) << '\n';
}

#line 1 "Test/yukicoder/yuki2277.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/2277"

#include <bits/stdc++.h>

#line 1 "Graph/dsu_01_xor.hpp"
template <class T> struct xor_dsu {
    public:
    xor_dsu() : _n(0) {}
    xor_dsu(int n) : _n(n), num_component(n), parent_or_size(n, -1), diff_weight(n) {}

    bool merge(int a, int b, T w) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        w ^= diff_weight[a] ^ diff_weight[b];
        if(x == y) return w == 0;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        diff_weight[y] = w;
        num_component--;
        return true;
    }
    T diff(int a, int b) {
        if(!same(a, b)) return -1;
        return diff_weight[a] ^ diff_weight[b];
    }
    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }
    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        int r = leader(parent_or_size[a]);
        diff_weight[a] ^= diff_weight[parent_or_size[a]];
        return parent_or_size[a] = r;
    }
    int size() {
        return num_component;
    }
    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }
    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
    private:
        int _n, num_component;
        std::vector<int> parent_or_size;
        std::vector<T> diff_weight;
};
#line 1 "Math/modint.hpp"
template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
#line 6 "Test/yukicoder/yuki2277.test.cpp"
using mint = prime_modint<998244353>;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int N, Q;
    std::cin >> N >> Q;
    xor_dsu<int> uf(N);
    bool flg = true;
    while(Q--){
        int u, v, d;
        std::cin >> u >> v >> d;
        flg &= uf.merge(--u, --v, d);
    }
    std::cout << (flg ? mint(2).pow(uf.size()) : 0) << '\n';
}