結果

問題 No.2277 Honest or Dishonest ?
ユーザー jabeejabee
提出日時 2023-04-21 22:49:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,257 bytes
コンパイル時間 5,085 ms
コンパイル使用メモリ 290,692 KB
実行使用メモリ 38,892 KB
最終ジャッジ日時 2024-11-08 06:40:15
合計ジャッジ時間 12,474 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
18,944 KB
testcase_01 AC 32 ms
18,944 KB
testcase_02 AC 32 ms
18,944 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 83 ms
32,392 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 81 ms
34,068 KB
testcase_09 AC 97 ms
31,908 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 76 ms
23,972 KB
testcase_13 WA -
testcase_14 AC 90 ms
24,708 KB
testcase_15 AC 74 ms
30,136 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 128 ms
35,884 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 133 ms
29,980 KB
testcase_24 WA -
testcase_25 AC 109 ms
34,752 KB
testcase_26 AC 77 ms
33,052 KB
testcase_27 AC 77 ms
24,796 KB
testcase_28 AC 72 ms
29,452 KB
testcase_29 AC 88 ms
32,472 KB
testcase_30 AC 72 ms
24,924 KB
testcase_31 AC 109 ms
29,548 KB
testcase_32 AC 85 ms
31,616 KB
testcase_33 WA -
testcase_34 AC 141 ms
33,588 KB
testcase_35 AC 55 ms
27,256 KB
testcase_36 WA -
testcase_37 AC 139 ms
31,324 KB
testcase_38 AC 53 ms
21,504 KB
testcase_39 AC 61 ms
23,040 KB
testcase_40 AC 51 ms
25,320 KB
testcase_41 AC 151 ms
34,192 KB
testcase_42 AC 110 ms
30,132 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 AC 154 ms
38,816 KB
testcase_50 WA -
testcase_51 AC 150 ms
38,888 KB
testcase_52 AC 150 ms
38,760 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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,q;
  cin >> n >> q;
  Graph g(n);
  map<P,ll>mp;
  dsu d(n);
  vector<ll>cnt(n,0);
  scc_graph sg(n);
  rep(i,0,q){
    ll a,b,c;
    cin >> a >> b >> c;
    a--; b--;
    g[a].push_back(b);
    mp[{a,b}] = c;
    cnt[b]++;
    sg.add_edge(a, b);
    d.merge(a,b);
  }
  auto scc = sg.scc();
  mint ans = 1;
  vector<ll>dist(n,-1);
  /*
  for(auto v : scc)if(v.size() != 1){
    for(auto e:v)cout << e << " ";
    cout << endl;
  }
  */
  map<ll,ll>seen;
  for(auto v : scc)if(v.size() != 1){    
    ll i = v[0];
    queue<ll>q;
    q.push(i);
    dist[i] = 0;
    bool ok = true;
    while(q.size()){
        ll from = q.front();
        q.pop();
        for(auto to:g[from]){
            ll nxt = dist[from] ^ mp[{from,to}];
            if(dist[to] == -1){
                dist[to] = nxt;
                q.push(to);
            }else{
                if(nxt != dist[to])ok = false;
            }
        }
    }
    if(ok)ans *= 2;
    else ans *= 0;
    seen[d.leader(i)] == 1;
  }
  
  ll check = 0;
  
  rep(i,0,n)if(cnt[i] == 0 && seen[d.leader(i)] == 0){
    seen[d.leader(i)] = 1;
    ans *= 2;
    check++;
  }
 //cout << check << endl;
  cout << ans << endl;
}
0