結果
| 問題 | No.2277 Honest or Dishonest ? |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2023-04-21 22:18:16 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,890 bytes |
| コンパイル時間 | 5,268 ms |
| コンパイル使用メモリ | 284,056 KB |
| 実行使用メモリ | 37,772 KB |
| 最終ジャッジ日時 | 2024-11-08 06:35:09 |
| 合計ジャッジ時間 | 14,386 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| 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 | WA | - |
| testcase_04 | AC | 201 ms
32,852 KB |
| testcase_05 | AC | 65 ms
22,228 KB |
| testcase_06 | AC | 143 ms
18,432 KB |
| testcase_07 | AC | 120 ms
18,752 KB |
| testcase_08 | AC | 59 ms
23,068 KB |
| testcase_09 | AC | 118 ms
25,056 KB |
| testcase_10 | AC | 75 ms
13,056 KB |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | AC | 56 ms
18,804 KB |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 192 ms
32,076 KB |
| testcase_19 | AC | 196 ms
31,836 KB |
| testcase_20 | AC | 145 ms
24,736 KB |
| testcase_21 | AC | 108 ms
14,080 KB |
| testcase_22 | WA | - |
| testcase_23 | AC | 150 ms
16,896 KB |
| testcase_24 | AC | 100 ms
21,008 KB |
| testcase_25 | AC | 141 ms
28,980 KB |
| testcase_26 | AC | 41 ms
20,368 KB |
| testcase_27 | WA | - |
| testcase_28 | AC | 54 ms
18,456 KB |
| testcase_29 | AC | 85 ms
24,012 KB |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | AC | 85 ms
22,516 KB |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | AC | 24 ms
13,456 KB |
| testcase_36 | AC | 106 ms
18,320 KB |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | AC | 39 ms
8,704 KB |
| testcase_40 | AC | 23 ms
11,364 KB |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | AC | 260 ms
37,628 KB |
| testcase_45 | AC | 257 ms
37,596 KB |
| testcase_46 | AC | 257 ms
37,644 KB |
| testcase_47 | AC | 258 ms
37,640 KB |
| testcase_48 | AC | 246 ms
37,640 KB |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 1000000007;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
template <long long Modulus>
struct ModInt{
long long val;
constexpr ModInt(const long long &_val = 0) noexcept : val(_val) {
normalize();
}
void normalize(){
val = (val % Modulus + Modulus) % Modulus;
}
inline ModInt& operator+=(const ModInt& rhs) noexcept {
if(val += rhs.val, val >= Modulus) val -= Modulus;
return *this;
}
inline ModInt& operator-=(const ModInt& rhs) noexcept {
if(val -= rhs.val, val < 0) val += Modulus;
return *this;
}
inline ModInt& operator*=(const ModInt& rhs) noexcept {
val = val * rhs.val % Modulus;
return *this;
}
inline ModInt& operator/=(const ModInt& rhs) noexcept {
val = val * inv(rhs.val).val % Modulus;
return *this;
}
inline ModInt& operator++() noexcept {
if(++val >= Modulus) val -= Modulus;
return *this;
}
inline ModInt operator++(int) noexcept {
ModInt t = val;
if(++val >= Modulus) val -= Modulus;
return t;
}
inline ModInt& operator--() noexcept {
if(--val < 0) val += Modulus;
return *this;
}
inline ModInt operator--(int) noexcept {
ModInt t = val;
if(--val < 0) val += Modulus;
return t;
}
inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }
inline ModInt inv(void) const { return inv(val); }
ModInt inv(const long long& n) const {
long long a = n, b = Modulus, u = 1, v = 0;
while(b){
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= Modulus;
if(u < 0) u += Modulus;
return u;
}
friend inline ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) += rhs; }
friend inline ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) -= rhs; }
friend inline ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) *= rhs; }
friend inline ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) /= rhs; }
friend inline bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val == rhs.val; }
friend inline bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val != rhs.val; }
friend inline istream& operator>>(istream& is, ModInt& x) noexcept {
is >> x.val;
x.normalize();
return is;
}
friend inline ostream& operator<<(ostream& os, const ModInt& x) noexcept { return os << x.val; }
};
template <typename T>
struct SCC{
int siz;
vector<vector<T>> G_reverse;
vector<bool> check;
vector<int> memo;
vector<T> s;
vector<vector<T>> result;
SCC(const vector<vector<T>> &G) : G_reverse((int) G.size()), check((int) G.size()){
siz = (int) G.size();
for(int i = 0; i < siz; ++i){
for(const auto &x : G[i]){
G_reverse[x].emplace_back(i);
}
}
for(int i = 0; i < siz; ++i){
if(!check[i]){
dfs(G, i);
}
}
reverse(memo.begin(), memo.end());
for(int i = 0; i < siz; ++i) check[i] = false;
for(const auto &x : memo){
if(!check[x]){
s = {};
dfs2(G_reverse, x);
result.emplace_back(s);
}
}
}
void dfs(const vector<vector<T>> &G, int curr){
check[curr] = true;
for(const auto &x : G[curr]){
if(check[x]){
continue;
}
dfs(G, x);
}
memo.emplace_back(curr);
}
void dfs2(const vector<vector<T>> &G, int curr){
s.emplace_back(curr);
check[curr] = true;
for(const auto &x : G[curr]){
if(check[x]){
continue;
}
dfs2(G, x);
}
}
vector<vector<T>> get() const {
return result;
}
};
struct UnionFind{
vector<int> par;
vector<int> siz;
vector<int> edg;
UnionFind(int N) : par(N), siz(N), edg(N){
for(int i = 0; i < N; ++i){
par[i] = i;
siz[i] = 1;
edg[i] = 0;
}
}
int root(int x){
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
edg[rx]++;
return;
}
par[rx] = ry;
siz[ry] += siz[rx];
edg[ry] += edg[rx] + 1;
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
long long size(int x){
return siz[root(x)];
}
long long edge(int x){
return edg[root(x)];
}
};
ll n, q;
using mint = ModInt<998244353>;
void input(){
in(n, q);
}
void solve(){
vector<vll> G(n);
map<ll, map<ll, ll>> mp;
UnionFind uf(n);
rep(i, q){
ll a, b, c; in(a, b, c); a--; b--;
G[a].push_back(b);
mp[a][b] = c;
uf.unite(a, b);
}
SCC<ll> s(G);
vector<vll> res = s.get();
mint ans = 1;
rep(i, n){
if(uf.root(i) == i) ans *= 2;
}
vll check(n);
for(auto v : res){
for(auto x : v){
check[x] = 1;
}
ll w = 0;
for(auto x : v){
for(auto y : G[x]){
if(check[y]){
w += mp[x][y];
}
}
}
if(w % 2){
ans *= 0;
}
for(auto x : v){
check[x] = 0;
}
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}