結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
![]() |
提出日時 | 2021-03-15 23:33:41 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 2,988 bytes |
コンパイル時間 | 2,289 ms |
コンパイル使用メモリ | 189,764 KB |
実行使用メモリ | 14,080 KB |
最終ジャッジ日時 | 2024-11-07 12:22:10 |
合計ジャッジ時間 | 6,456 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#pragma GCC optimize("O3")//#pragma GCC target("avx2")//#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<ld> vld;typedef pair<ll,ll> Pll;typedef pair<int,int> Pin;ll INF = 1e16;int inf = 1e9;#define ALL(x) (x).begin(), (x).end()#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)#define REP(i, n) FOR(i, 0, n)#define REVREP(i, n) REVFOR(i, 0, n)#define fi first#define se second#define pb push_back#define mp make_pair#define eb emplace_back#define bcnt __builtin_popcountll#ifdef LOCAL#include <prettyprint.hpp>#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);#else#define debug(...) 83;#endifvoid d_err() {cerr << endl;}template <typename H, typename... T>void d_err(H h, T... t) {cerr << h << " ";d_err(t...);}template <typename T>void print(T x) {cout << x << "\n";}template <typename T>void print(vector<T>& x) {int N = x.size();REP(i, N) {if (i > 0) cout << " ";cout << x[i];}cout << "\n";}struct UnionFind {vector<int> par;UnionFind(int n): par(n, -1) {}void init(int n) { par.assign(n, -1); }int root(int x) {if (par[x] < 0) return x;return par[x] = root(par[x]);}int issame(int x, int y) {return root(x) == root(y);}bool merge(int x, int y) {x = root(x); y = root(y);if (x == y) return false;// merge by size// force size of x to be bigger than that of yif (par[x] > par[y]) swap(x, y);par[x] += par[y];par[y] = x;return true;}ll size(int x) {return -par[root(x)];}};int main(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);int n, m; cin >> n >> m;vll ans(n, -1);vll a(m), b(m), y(m);// UnionFind uf(n);vector<vector<Pll>> edge(n);REP(i, m) {cin >> a[i] >> b[i];cin >> y[i];a[i]--, b[i]--;// uf.merge(a[i], b[i]);edge[a[i]].eb(b[i], y[i]);edge[b[i]].eb(a[i], y[i]);}vector<bool> used(n, false);REP(i, n) {if (used[i]) continue;ans[i] = 1;queue<int> q;q.push(i);while(not q.empty()) {auto j = q.front(); q.pop();for (auto &e: edge[j]) {if (used[e.fi]) continue;int v = ans[j] ^ e.se;ans[e.fi] = v;q.push(e.fi);used[e.fi] = true;}}}REP(i, m) {if ((ans[a[i]] ^ ans[b[i]]) != y[i]) {print(-1);return 0;}}for(auto &e: ans) {print(e);}}