結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー |
👑 ![]() |
提出日時 | 2021-03-05 22:00:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 624 ms / 2,000 ms |
コード長 | 2,674 bytes |
コンパイル時間 | 3,025 ms |
コンパイル使用メモリ | 203,340 KB |
最終ジャッジ日時 | 2025-01-19 11:05:06 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#define _USE_MATH_DEFINES#include <bits/stdc++.h>using namespace std;#define FOR(i,m,n) for(int i=(m);i<(n);++i)#define REP(i,n) FOR(i,0,n)#define ALL(v) (v).begin(),(v).end()using ll = long long;constexpr int INF = 0x3f3f3f3f;constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;constexpr double EPS = 1e-8;constexpr int MOD = 1000000007;// constexpr int MOD = 998244353;constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }struct IOSetup {IOSetup() {std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);std::cout << fixed << setprecision(20);}} iosetup;struct UnionFind {UnionFind(int n) : data(n, -1) {}int root(int ver) { return data[ver] < 0 ? ver : data[ver] = root(data[ver]); }bool unite(int u, int v) {u = root(u);v = root(v);if (u == v) return false;if (data[u] > data[v]) std::swap(u, v);data[u] += data[v];data[v] = u;return true;}bool same(int u, int v) { return root(u) == root(v); }int size(int ver) { return -data[root(ver)]; }private:std::vector<int> data;};bool is_bipartite(const std::vector<std::vector<int>> &graph, std::vector<int> &color) {int n = graph.size();color.assign(n, -1);std::function<bool(int, int)> dfs = [&graph, &color, &dfs](int ver, int now) -> bool {color[ver] = now;for (int e : graph[ver]) {if (color[e] == now || (color[e] == -1 && !dfs(e, now ^ 1))) return false;}return true;};for (int i = 0; i < n; ++i) {if (color[i] == -1 && !dfs(i, 0)) return false;}return true;}int main() {int n, m; cin >> n >> m;vector<int> a(m), b(m), y(m); REP(i, m) cin >> a[i] >> b[i] >> y[i], --a[i], --b[i];vector<int> ans(n, 0);REP(bit, 30) {UnionFind uf(n);REP(i, m) {if (!(y[i] >> bit & 1)) uf.unite(a[i], b[i]);}vector<int> mp(n, -1);int z = 0;REP(i, n) {if (uf.root(i) == i) mp[i] = z++;}REP(i, n) mp[i] = mp[uf.root(i)];vector<vector<int>> graph(z);REP(i, m) {if (y[i] >> bit & 1) {graph[mp[a[i]]].emplace_back(mp[b[i]]);graph[mp[b[i]]].emplace_back(mp[a[i]]);}}vector<int> color;if (!is_bipartite(graph, color)) {cout << "-1\n";return 0;}REP(i, n) ans[i] |= color[mp[i]] << bit;}REP(i, n) cout << ans[i] << '\n';return 0;}