Submission #63520923

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int MAXE = 4e5 + 10;
struct edge
{
    int to, z, nxt;
};
edge ed[MAXE];
int head[MAXN], tot;
int dval[MAXN];
bool vis[MAXN];
long long ans[MAXN];
int stk[MAXN], comp[MAXN];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        head[i] = -1;
        vis[i] = false;
    }
    tot = 0;
    for (int i = 0; i < m; i++)
    {
        int u, v, z;
        cin >> u >> v >> z;
        ed[tot].to = v;
        ed[tot].z = z;
        ed[tot].nxt = head[u];
        head[u] = tot++;
        ed[tot].to = u;
        ed[tot].z = z;
        ed[tot].nxt = head[v];
        head[v] = tot++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i])
        {
            int top = 0, cmpsize = 0;
            stk[top++] = i;
            vis[i] = true;
            dval[i] = 0;
            while (top)
            {
                int u = stk[--top];
                comp[cmpsize++] = u;
                for (int j = head[u]; j != -1; j = ed[j].nxt)
                {
                    int v = ed[j].to;
                    if (!vis[v])
                    {
                        vis[v] = true;
                        dval[v] = dval[u] ^ ed[j].z;
                        stk[top++] = v;
                    }
                    else if ((dval[u] ^ dval[v]) != ed[j].z)
                    {
                        cout << -1;
                        return 0;
                    }
                }
            }
            int t_val = 0;
            for (int b = 0; b < 31; b++)
            {
                int mask = (1 << b);
                int cnt1 = 0;
                for (int j = 0; j < cmpsize; j++)
                {
                    if (dval[comp[j]] & mask)
                        cnt1++;
                }
                if (cnt1 > cmpsize - cnt1)
                    t_val |= mask;
            }
            for (int j = 0; j < cmpsize; j++)
            {
                int u = comp[j];
                ans[u] = dval[u] ^ t_val;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";
    return 0;
}

Submission Info

Judge Result