結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
|
提出日時 | 2021-03-05 22:04:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 126 ms / 2,000 ms |
コード長 | 2,442 bytes |
コンパイル時間 | 2,288 ms |
コンパイル使用メモリ | 197,888 KB |
最終ジャッジ日時 | 2025-01-19 11:07:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;template<typename T>struct Weighted_Union_Find_Tree{vector<int> data;vector<T> ws;const int n;Weighted_Union_Find_Tree(int n) : n(n){data.assign(n, -1), ws.assign(n, 0);}int root(int x){if(data[x] < 0) return x;int par = root(data[x]);ws[x] ^= ws[data[x]];return data[x] = par;}int operator [] (int i) {return root(i);}T weight(int x){root(x);return ws[x];}bool unite(int x, int y, T w){ //weight(y)-weight(x) = ww ^= weight(x), w ^= weight(y);x = root(x), y = root(y);if(x == y) return false;if(data[x] > data[y]) swap(x, y);//, w *= -1;data[x] += data[y], data[y] = x;ws[y] = w;return true;}T diff(int x, int y) {return weight(y)^weight(x);}int size(int x) {return -data[root(x)];}bool same(int x, int y) {return root(x) == root(y);}void clear(){fill(begin(data), end(data), -1), fill(begin(ws), end(ws), 0);}};int main(){int N, M; cin >> N >> M;Weighted_Union_Find_Tree<int> uf(N);bool flag = true;rep(i, M){int u, v, x; cin >> u >> v >> x; u--, v--;if(!uf.same(u, v)){uf.unite(u, v, x);}else{if(uf.diff(u, v) != x) flag = false;}}if(!flag) {cout << "-1\n"; return 0;}rep(i, N){cout << uf.diff(i, uf[i]) << '\n';}}