結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | abc23 |
提出日時 | 2023-04-22 12:26:52 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,681 bytes |
コンパイル時間 | 5,708 ms |
コンパイル使用メモリ | 328,092 KB |
実行使用メモリ | 12,800 KB |
最終ジャッジ日時 | 2024-11-08 06:50:11 |
合計ジャッジ時間 | 10,842 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 102 ms
10,220 KB |
testcase_04 | AC | 83 ms
11,392 KB |
testcase_05 | AC | 46 ms
10,368 KB |
testcase_06 | AC | 89 ms
8,360 KB |
testcase_07 | AC | 54 ms
7,424 KB |
testcase_08 | AC | 47 ms
11,520 KB |
testcase_09 | AC | 58 ms
9,728 KB |
testcase_10 | AC | 53 ms
6,528 KB |
testcase_11 | AC | 24 ms
5,248 KB |
testcase_12 | AC | 43 ms
5,248 KB |
testcase_13 | AC | 103 ms
9,296 KB |
testcase_14 | AC | 51 ms
5,248 KB |
testcase_15 | AC | 45 ms
9,216 KB |
testcase_16 | AC | 75 ms
8,264 KB |
testcase_17 | AC | 29 ms
5,248 KB |
testcase_18 | AC | 81 ms
11,520 KB |
testcase_19 | AC | 78 ms
11,264 KB |
testcase_20 | AC | 61 ms
9,088 KB |
testcase_21 | AC | 69 ms
6,656 KB |
testcase_22 | AC | 54 ms
8,192 KB |
testcase_23 | AC | 92 ms
7,424 KB |
testcase_24 | AC | 48 ms
8,192 KB |
testcase_25 | AC | 67 ms
11,264 KB |
testcase_26 | AC | 38 ms
11,136 KB |
testcase_27 | WA | - |
testcase_28 | AC | 37 ms
8,832 KB |
testcase_29 | AC | 52 ms
10,240 KB |
testcase_30 | WA | - |
testcase_31 | AC | 75 ms
8,904 KB |
testcase_32 | AC | 49 ms
9,856 KB |
testcase_33 | AC | 76 ms
10,752 KB |
testcase_34 | WA | - |
testcase_35 | AC | 24 ms
7,936 KB |
testcase_36 | WA | - |
testcase_37 | AC | 103 ms
8,580 KB |
testcase_38 | AC | 22 ms
5,248 KB |
testcase_39 | AC | 32 ms
5,248 KB |
testcase_40 | AC | 20 ms
6,784 KB |
testcase_41 | AC | 110 ms
11,248 KB |
testcase_42 | AC | 73 ms
9,216 KB |
testcase_43 | WA | - |
testcase_44 | AC | 99 ms
12,544 KB |
testcase_45 | AC | 97 ms
12,672 KB |
testcase_46 | AC | 100 ms
12,800 KB |
testcase_47 | AC | 101 ms
12,672 KB |
testcase_48 | AC | 97 ms
12,672 KB |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
ソースコード
#if !__INCLUDE_LEVEL__ #include __FILE__ template<int MOD> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept { return os << x.val; } static constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; // const int MOD = 1000000007; const int MOD = 998244353; using mint = Fp<MOD>; struct Solver { void solve() { int n,q;cin>>n>>q; dsu d(n); V<V<P>> graph(n); rep(i,q){ int a,b,c;cin>>a>>b>>c; a--;b--; graph[a].emplace_back(b,c); d.merge(a,b); } auto v=d.groups(); mint ans=1; rep(i,sz(v)){ int t=0; rep(j,2){ int fl=1; unordered_map<int,bool> mp; mp[v[i][0]] = i; deque<int> dq; dq.emplace_back(v[i][0]); while(sz(dq)){ auto now=dq.front(); dq.pop_front(); for(auto [next,g]:graph[now]){ if(mp.count(next)){ if(mp[now]==0 && mp[next]==g)continue; if(mp[now]==1 && mp[next]!=g)continue; else fl=0; } else{ if(mp[now]==0)mp[next]=g; else mp[next]=1-g; dq.emplace_back(next); } } } t+=fl; } ans*=t; } cout<<ans<<endl; }}; signed main() { int ts = 1; // scanf("%lld",&ts); rep(ti,ts) { Solver solver; solver.solve(); } return 0; } #else #include <bits/stdc++.h> #include <atcoder/all> using namespace atcoder; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define int ll using ll=long long; using ld = long double; using uint = unsigned; using ull = unsigned long long; using P=pair<int,int>; using TP=tuple<int,int,int>; const int INF = 1001001001; const long long INFL = 3e18; const int MAX = 2e6+5; #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define fore(i,a) for(auto &i:a) #define all(x) x.begin(),x.end() #define allr(x) x.rbegin(),x.rend() #define sz(x) ((int)(x).size()) #define bp(x) (__builtin_popcountll((long long)(x))) #define elif else if #define mpa make_pair #define bit(n) (1LL<<(n)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) template<typename T> using V = vector<T>; template<typename T> using max_heap = priority_queue<T>; template<typename T> using min_heap = priority_queue<T, vector<T>, greater<>>; template<typename T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();} template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;} template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;} template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;} template<typename T>void uni(T& a){sort(all(a));a.erase(unique(all(a)),a.end());} template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);} template<typename T>T vgcd(T m, T n) {return std::gcd(m, n);} template<typename T, typename... Args>T vgcd(T a, Args... args) {return vgcd(a, vgcd(args...));} void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } // void print(int a){ printf("%d", a); } void print(unsigned a){ printf("%u", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(unsigned long long a){ printf("%llu", a); } void print(char a){ printf("%c", a); } void print(char *a){ printf("%s", a); } void print(const char *a){ printf("%s", a); } void print(double a){ printf("%.15f", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } template<typename T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); } template<typename T> void print(const vector<T>&); template<typename T, size_t size> void print(const array<T, size>&); template<typename T, typename L> void print(const pair<T, L>& p); template<typename T, size_t size> void print(const T (&)[size]); template<typename T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T, typename L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); } template<typename T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template<typename T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<typename T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<typename Head, typename... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } ll binary_search(function<bool(ll)> check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; if (check(x)) ok = x; else ng = x; } return ok; } #endif