結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
![]() |
提出日時 | 2021-03-05 21:43:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 4,447 bytes |
コンパイル時間 | 1,457 ms |
コンパイル使用メモリ | 144,328 KB |
最終ジャッジ日時 | 2025-01-19 10:48:47 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()#define eb emplace_back#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endifvoid ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return move(re);}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}vv<int> readG(const int &n){ return readG(n,n-1);}#define TT cauto TTT=read();rep(_,TTT)const ll MOD=1e9+7; //998244353;struct UF{vector<int> data;UF(const int &size):data(size,-1){}int unite(int x, int y){x=root(x); y=root(y);if(x==y) return 0;if(-data[y]>-data[x]) swap(x,y);data[x]+=data[y]; data[y]=x;return y+1;}bool findSet(const int &x, const int &y){ return root(x)==root(y);}int root(const int &x){ return data[x]<0?x:data[x]=root(data[x]);}int size(const int &x){ return -data[root(x)];}int size(){ return count_if(all(data),[](const int &x){ return x<0;});}; //unverifiedint operator()(const int &x, const int &y){ return unite(x,y);}int operator()(const pii &xy){ return unite(xy.X,xy.Y);}int operator[](const int &x){ return root(x);}bool operator[](const pii &xy){ return findSet(xy.X,xy.Y);}};int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);cauto n=read();cauto m=read();vector<tuple<int,int,int>> es(m);for(auto &[a,b,c]:es) cin>>a>>b>>c, --a, --b;UF uf(n);vv<pii> g(n);vector<tuple<int,int,int>> cys;for(cauto &[a,b,c]:es){if(uf(a,b)){g[a].eb(b,c);g[b].eb(a,c);}else{cys.eb(a,b,c);}}vector<int> vs(n);{cauto dfs=[&](auto &&dfs,int v,int p)->void{for(cauto [w,x]:g[v])if(w!=p){vs[w]=vs[v]^x;dfs(dfs,w,v);}};rep(v,n)if(uf[v]==v) dfs(dfs,v,-1);}for(cauto &[a,b,c]:cys){if(vs[a]^vs[b]^c){cout<<-1 NL;exit(0);}}for(cauto &v:vs) cout<<v NL;return 0;}