結果
| 問題 | No.2277 Honest or Dishonest ? |
| ユーザー |
 noya2
|
| 提出日時 | 2023-04-21 21:46:01 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 64 ms / 2,000 ms |
| コード長 | 9,472 bytes |
| コンパイル時間 | 4,788 ms |
| コンパイル使用メモリ | 275,788 KB |
| 最終ジャッジ日時 | 2025-02-12 11:23:16 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 50 |
ソースコード
#line 1 "c.cpp"#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,n) for (int i = 0; i < int(n); ++i)#define repp(i,n,m) for (int i = m; i < int(n); ++i)#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)#define all(v) v.begin(),v.end()using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<int, int>;using PL = pair<long long, long long>;using pdd = pair<long double, long double>;using pil = pair<int,ll>;using pli = pair<ll,int>;template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template<typename T1, typename T2>void print(pair<T1,T2> a);template<typename T>void print(vector<T> v);template<typename T>void print(vector<vector<T>> v);void print(){ putchar(' '); }void print(bool a){ printf("%d", a); }void print(int a){ printf("%d", a); }void print(long a){ printf("%ld", a); }void print(long long a){ printf("%lld", 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(long double a){ printf("%.15Lf", a); }void print(const string& a){ for(auto&& i : a) print(i); }void print(unsigned int a){ printf("%u", a); }void print(unsigned long long a) { printf("%llu", a); }template<class T> void print(const T& a){ cout << a; }int out(){ putchar('\n'); return 0; }template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}void yes(){out("Yes");}void no (){out("No");}void yn (bool t){if(t)yes();else no();}void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}void o(){out("!?");}namespace noya2{const int INF = 1001001007;const long long mod1 = 998244353;const long long mod2 = 1000000007;const long long inf = 2e18;const long double pi = 3.14159265358979323;const long double eps = 1e-7;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";} // namespace noya2using namespace noya2;using mint = modint998244353;//using mint = modint1000000007;//using mint = modint;void out(mint a){out(a.val());}void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}void out(vector<vector<mint>> a){for (auto v : a) out(v);}istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}#line 2 "Graph-core.hpp"#line 5 "Graph-core.hpp"namespace noya2 {using namespace std;struct naiveGraph { // undirected unweighted treenaiveGraph (int _n = 0) : n(_n){ init();}void add_edge(int u, int v, bool undirect = true, int id = -1){es0[u].emplace_back(v);es1[u].emplace_back(v,id);if (undirect){es0[v].emplace_back(u);es1[v].emplace_back(u,id);}}void remake(int new_n){es0.clear(); es1.clear(); vis.clear();n = new_n;init();}bool yet(int v){ return vis[v] == 0;}void visit(int v) { vis[v]++;}void reset(int v = -1){if (v == -1) fill(vis.begin(),vis.end(),0);else vis[v] = 0;}const vector<int>& operator[](int idx) const { return es0[idx];}const vector<pair<int,int>>& operator()(int idx) const {return es1[idx];}private:int n;vector<vector<int>> es0;vector<vector<pair<int,int>>> es1;vector<int> vis;void init(){es0.resize(n);es1.resize(n);vis.resize(n,0);}};struct usefulGraph { // directed weighted graphusing ll = long long;static constexpr ll DINF = 2e18;usefulGraph (int _n = 0) : n(_n) { init();}void add_edge(int u, int v, ll cost = 1, bool undirect = true){es[u].emplace_back(v,cost);if (undirect) es[v].emplace_back(u,cost);}void remake(int new_n){es.clear();vis.clear();n = new_n;init();}bool yet(int v){ return vis[v] == 0;}void visit(int v) { vis[v]++;}void reset(int v = -1){if (v == -1) fill(vis.begin(),vis.end(),0);else vis[v] = 0;}vector<ll> dijkstra(int s){ // all edge weight >= 0vector<ll> dist(n,DINF);dist[s] = 0LL;priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pque;pque.push(pair<ll,int>(0,s));while (!pque.empty()){ll d = pque.top().first;int f = pque.top().second;pque.pop();if (dist[f] < d) continue;for (auto e : es[f]){if (dist[e.first] > d + e.second){dist[e.first] = d + e.second;pque.push(pair<ll,int>(dist[e.first],e.first));}}}return dist;}vector<ll> bfs01(int s){ // all edge weight = 0 or 1vector<ll> dist(n,DINF);dist[s] = 0;deque<int> que;que.push_back(s);while (!que.empty()){auto f = que.front(); que.pop_front();for (auto e : es[f]){if (dist[e.first] > dist[f] + e.second){dist[e.first] = dist[f] + e.second;if (e.second == 0) que.push_front(e.first);else que.push_back(e.first);}}}return dist;}vector<ll> bellman_ford(int s, bool &ng_cycle){vector<ll> dist(n,DINF);vector<int> ng;dist[s] = 0;int t = 0;while (t < n){bool finish = true;for (int f = 0; f < n; f++){if (dist[f] == DINF) continue;for (auto e : es[f]){if (dist[e.first] > dist[f] + e.second){dist[e.first] = dist[f] + e.second;finish = false;if (t == n-1) ng.emplace_back(e.first);}}}if (finish) break;t++;}ng_cycle = (t == n);if (ng_cycle){for (auto v : ng) dist[v] = -DINF;t = n;while (t--){for (int f = 0; f < n; f++){if (dist[f] != -DINF) continue;for (auto e : es[f]){dist[e.first] = -DINF;}}}}return dist;}vector<vector<ll>> warshall_floyd(){vector<vector<ll>> res(n,vector<ll>(n,DINF));for (int i = 0; i < n; i++){res[i][i] = 0;for (auto e : es[i]){res[i][e.first] = min(res[i][e.first],e.second);}}for (int k = 0; k < n; k++){for (int i = 0; i < n; i++){for (int j = 0; j < n; j++){res[i][j] = min(res[i][j],res[i][k]+res[k][j]);}}}return res;}const vector<pair<int,ll>>& operator[](int idx) const { return es[idx];}private:int n;vector<vector<pair<int,ll>>> es;vector<int> vis;void init(){es.resize(n);vis.resize(n,0);}};} // namespace noya2#line 78 "c.cpp"void solve(){int n, q; cin >> n >> q;dsu d(n);vector<P> es;while (q--){int u, v, c; cin >> u >> v >> c; u--, v--;if (c == 0) d.merge(u,v);else es.emplace_back(u,v);}naiveGraph g(n);for (auto [u,v] : es){int lu = d.leader(u), lv = d.leader(v);g.add_edge(lu,lv);}mint ans = 1;vector<int> col(n,-1);rep(i,n){if (i != d.leader(i) || col[i] != -1) continue;ans *= 2;queue<int> que;que.push(i);col[i] = 0;while (!que.empty()){int p = que.front(); que.pop();for (int q : g[p]){if (col[q] == -1){col[q] = col[p]^1;que.push(q);}else if (col[q] == col[p]){out(0);return ;}}}}out(ans);}int main(){fast_io();int t = 1; //cin >> t;while(t--) solve();}