結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
|
提出日時 | 2021-03-06 01:38:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 1,919 bytes |
コンパイル時間 | 2,048 ms |
コンパイル使用メモリ | 204,628 KB |
最終ジャッジ日時 | 2025-01-19 12:14:11 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
/*** author: yuji9511 ***/#include <bits/stdc++.h>// #include <atcoder/all>// using namespace atcoder;using namespace std;using ll = long long;using lpair = pair<ll, ll>;using vll = vector<ll>;const ll MOD = 1e9+7;const ll INF = 1e18;#define rep(i,m,n) for(ll i=(m);i<(n);i++)#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};void print() {}template <class H,class... T>void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}void scan() {}template <class H,class... T>void scan(H&& h, T&&... t){cin >> h; scan(forward<T>(t)...);}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; }void solve(){ll N,M;scan(N, M);vll a(M), b(M), y(M);vector<vector<lpair> > tree(N);rep(i,0,M){scan(a[i], b[i], y[i]);a[i]--; b[i]--;tree[a[i]].push_back({b[i], y[i]});tree[b[i]].push_back({a[i], y[i]});}vector<bool> check(N, false);vll val(N, -1);bool ok = true;auto dfs = [&](auto dfs, ll cur) -> void {if(check[cur]) return;check[cur] = true;for(auto &e: tree[cur]){if(check[e.first]){if((val[e.first] ^ val[cur]) != e.second) ok = false;}else{val[e.first] = (val[cur] ^ e.second);dfs(dfs, e.first);}}};rep(i,0,N){if(check[i]) continue;val[i] = 0;dfs(dfs, i);}if(ok){rep(i,0,N) print(val[i]);}else{print(-1);}}int main(){cin.tie(0);ios::sync_with_stdio(false);solve();}