結果

問題 No.2277 Honest or Dishonest ?
ユーザー sten_sansten_san
提出日時 2023-04-21 22:35:04
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 115 ms / 2,000 ms
コード長 4,173 bytes
コンパイル時間 2,881 ms
コンパイル使用メモリ 230,204 KB
実行使用メモリ 12,548 KB
最終ジャッジ日時 2024-11-08 06:37:41
合計ジャッジ時間 7,253 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/modint>
#include <atcoder/dsu>
using mint = atcoder::modint998244353;

int main() {
    int n, q; cin >> n >> q;
    auto info = vec<array<int, 3>>(uns, q);
    for (auto &[a, b, c] : info) {
        cin >> a >> b >> c; --a; --b;
    }

    atcoder::dsu dsu(n);
    for (auto [a, b, c] : info) {
        if (c == 0) {
            dsu.merge(a, b);
        }
    }

    for (auto [a, b, c] : info) {
        if (c == 1) {
            if (dsu.same(a, b)) {
                cout << 0 << endl;
                return 0;
            }
        }
    }

    auto led = vec<int>(uns, 0);
    for (int i = 0; i < n; ++i) {
        led.push_back(dsu.leader(i));
    }
    led = uniqued(sorted(move(led)));

    auto comp = [&](int v) {
        return distance(led, lower_bound(begin(led), end(led), v));
    };

    auto g = vec<set<int>>(uns, size(led));
    for (auto [a, b, c] : info) {
        a = comp(dsu.leader(a)); b = comp(dsu.leader(b));

        if (c == 1) {
            g[a].insert(b);
            g[b].insert(a);
        }
    }

    mint ans = 1;

    auto col = vec<int>(-1, size(led));
    for (int i = 0; i < size(led); ++i) {
        if (0 <= col[i]) {
            continue;
        }

        auto f = fix([&](auto f, int v, int c = 0) -> bool {
            if (0 <= col[v]) {
                return (c != col[v]);
            }
            col[v] = c;

            for (auto u : g[v]) {
                if (f(u, !c)) {
                    return true;
                }
            }

            return false;
        })(i);

        if (f) {
            cout << 0 << endl;
            return 0;
        }

        ans *= 2;
    }

    cout << ans.val() << endl;
}
0