結果

問題 No.2277 Honest or Dishonest ?
ユーザー abc23abc23
提出日時 2023-04-22 13:33:44
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 296 ms / 2,000 ms
コード長 8,205 bytes
コンパイル時間 7,049 ms
コンパイル使用メモリ 339,136 KB
実行使用メモリ 26,060 KB
最終ジャッジ日時 2024-04-25 19:14:46
合計ジャッジ時間 16,628 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,812 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 223 ms
17,788 KB
testcase_04 AC 243 ms
22,876 KB
testcase_05 AC 83 ms
17,868 KB
testcase_06 AC 172 ms
13,748 KB
testcase_07 AC 136 ms
13,536 KB
testcase_08 AC 75 ms
19,396 KB
testcase_09 AC 136 ms
18,312 KB
testcase_10 AC 98 ms
9,812 KB
testcase_11 AC 44 ms
7,040 KB
testcase_12 AC 81 ms
7,124 KB
testcase_13 AC 195 ms
15,604 KB
testcase_14 AC 87 ms
7,704 KB
testcase_15 AC 66 ms
15,440 KB
testcase_16 AC 136 ms
13,140 KB
testcase_17 AC 60 ms
8,064 KB
testcase_18 AC 204 ms
22,692 KB
testcase_19 AC 222 ms
22,256 KB
testcase_20 AC 165 ms
17,212 KB
testcase_21 AC 137 ms
10,856 KB
testcase_22 AC 138 ms
15,392 KB
testcase_23 AC 187 ms
12,540 KB
testcase_24 AC 126 ms
15,196 KB
testcase_25 AC 163 ms
21,208 KB
testcase_26 AC 57 ms
17,948 KB
testcase_27 AC 91 ms
8,604 KB
testcase_28 AC 74 ms
14,644 KB
testcase_29 AC 120 ms
18,436 KB
testcase_30 AC 84 ms
9,600 KB
testcase_31 AC 156 ms
14,756 KB
testcase_32 AC 102 ms
17,248 KB
testcase_33 AC 218 ms
21,180 KB
testcase_34 AC 241 ms
18,844 KB
testcase_35 AC 34 ms
11,948 KB
testcase_36 AC 136 ms
13,180 KB
testcase_37 AC 210 ms
14,524 KB
testcase_38 AC 40 ms
6,940 KB
testcase_39 AC 59 ms
7,040 KB
testcase_40 AC 31 ms
9,984 KB
testcase_41 AC 258 ms
19,608 KB
testcase_42 AC 169 ms
15,472 KB
testcase_43 AC 292 ms
26,060 KB
testcase_44 AC 290 ms
25,804 KB
testcase_45 AC 283 ms
25,800 KB
testcase_46 AC 296 ms
25,932 KB
testcase_47 AC 289 ms
25,768 KB
testcase_48 AC 294 ms
25,936 KB
testcase_49 AC 293 ms
25,832 KB
testcase_50 AC 291 ms
25,804 KB
testcase_51 AC 292 ms
25,928 KB
testcase_52 AC 293 ms
25,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
	scc_graph sc(n);
	V<V<P>> graph(n),rgraph(n);
	rep(i,q){
		int a,b,c;cin>>a>>b>>c;
		a--;b--;
		graph[a].emplace_back(b,c);
		rgraph[b].emplace_back(a,c);
		sc.add_edge(a,b);
	}

	auto v=sc.scc();
	map<int,bool> mp;
	mint ans=1;
	rep(i,sz(v)){
		if(mp.count(v[i][0])){
			continue;
		}
		mp[v[i][0]]=0;
		ans*=2;
		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]==0 && g==0)continue;
					if(mp[now]==1 && mp[next]==1 && g==0)continue;
					if(mp[now]==0 && mp[next]==1 && g==1)continue;
					if(mp[now]==1 && mp[next]==0 && g==1)continue;
					else ans=0;
				}
				else{
					if(mp[now]==0)mp[next]=g;
					else mp[next]=1-g;
					dq.emplace_back(next);
				}
			}
			for(auto [next,g]:rgraph[now]){
				if(mp.count(next)){
					if(mp[next]==0 && mp[now]==0 && g==0)continue;
					if(mp[next]==1 && mp[now]==1 && g==0)continue;
					if(mp[next]==0 && mp[now]==1 && g==1)continue;
					if(mp[next]==1 && mp[now]==0 && g==1)continue;
					else ans=0;
				}
				else{
					if(mp[now]==0)mp[next]=g;
					else mp[next]=1-g;
					dq.emplace_back(next);
				}
			}
		}
	}
	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
0