結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
|
提出日時 | 2021-03-05 22:22:44 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,668 ms / 2,000 ms |
コード長 | 3,026 bytes |
コンパイル時間 | 7,214 ms |
コンパイル使用メモリ | 269,088 KB |
最終ジャッジ日時 | 2025-01-19 11:24:18 |
ジャッジサーバーID (参考情報) |
judge4 / 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 RREP(i, n) for(int i=(n);i>=0;--i)#define FOR(i, a, n) for (int i=(a); i<(n); ++i)#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)#define SZ(x) ((int)(x).size())#define ALL(x) (x).begin(),(x).end()#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {REP(i, SZ(v)) {if (i) os << " ";os << v[i];}return os;}template <class T>void debug(const vector<T> &v) {cout << "[";REP(i, SZ(v)) {if(i) cout << ", ";cout << v[i];}cout << "]" << endl;}template<class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {return os << p.first << " " << p.second;}template <class T, class U>void debug(const pair<T, U> &p) {cout << "(" << p.first << " " << p.second << ")" << endl;}template<class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template<class T>bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}using ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<int, int>;using vi = vector<int>;using vll = vector<ll>;using vvi = vector<vi>;using vvll = vector<vll>;const ll MOD = 1e9 + 7;const ll MOD998 = 998244353;const int INF = INT_MAX;const ll LINF = LLONG_MAX;const int inf = INT_MIN;const ll linf = LLONG_MIN;const ld eps = 1e-9;void dfs(int now, int prev, int nowcol, int k, vector<int> &col, vvi &g, bool &ok, map<P, int> &mp) {col[now] = nowcol;for(auto &nxt: g[now]) {if(nxt == prev) continue;int diff = mp[{now, nxt}]>>k&1;int nxtcol = nowcol ^ diff;if(col[nxt] == -1) {dfs(nxt, now, nxtcol, k, col, g, ok, mp);if(!ok) return;} else if(col[nxt] != nxtcol) {ok = false;return;}}}int main() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);int n, m; cin >> n >> m;vvi g(n);map<P, int> mp;bool ok = true;REP(i, m) {int a, b; cin >> a >> b;a--; b--;int y; cin >> y;if(!ok) continue;if(mp.find({a, b}) != mp.end() && mp[{a, b}] != y) {ok = false;continue;}mp[{a, b}] = y;mp[{b, a}] = y;g[a].push_back(b);g[b].push_back(a);}if(!ok) {cout << -1 << endl;return 0;}vi x(n);REP(i, 30) {vi col(n, -1);REP(j, n) {if(!ok) break;if(col[j] != -1) continue;dfs(j, -1, 0, i, col, g, ok, mp);}if(!ok) break;REP(j, n) {x[j] += col[j]<<i;}}if(ok) {REP(i, n) {cout << x[i] << endl;}} else {cout << -1 << endl;}return 0;}