提出 #63560850

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

void solve() {
	int n, m;
	cin >> n >> m;
	vector<vector<pair<int, int>>> adjl(n+1);
	for (int i=0; i<m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		adjl[u].emplace_back(v, w);
		adjl[v].emplace_back(u, w);
	}

	vector<int> ans(n+1, 0);
	for (int b=0; b<30; b++) {
		vector<int> col(n+1, -1);
		for (int i=1; i<=n; i++) {
			if (col[i] != -1) continue;

			vector<int> us;
			auto dfs = [&](auto &self, int u, int x) -> void {
				if (col[u] != -1) {
					if (col[u] != x) {
						cout << "-1\n";
						exit(0);
					}
					return;
				}
				col[u] = x;
				us.push_back(u);
				for (auto &[v, w] : adjl[u]) self(self, v, x ^ ((w >> b) & 1));
			};
			dfs(dfs, i, 0);

			vector<int> cnt(2, 0);
			for (int i : us) cnt[col[i]]++;
			int mnc = (cnt[0] < cnt[1] ? 0 : 1);
			for (int i : us) {
				if (col[i] == mnc) ans[i] |= (1 << b);
			}
		}

	}

	for (int i=1; i<=n; i++) cout << ans[i] << ' ';
	cout << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int tcs = 1;
	// cin >> tcs;
	while (tcs--) {
		solve();
	}
	return 0;
}

提出情報

ジャッジ結果