Submission #63508240

---

Source Code Expand

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

#define ull unsigned long long
int n, m;
int d[15];
int to[15][15];
ull w[15][15];
bool vis[15];
ull ans = ULLONG_MAX;
void dfs(int u, ull x)
{
    if (u == n)
    {
        ans = min(ans, x);
        return;
    }
    for (int i = 0; i < d[u]; i++)
    {
        int v = to[u][i];
        if (!vis[v])
        {
            vis[v] = true;
            dfs(v, x ^ w[u][i]);
            vis[v] = false;
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        d[i] = 0;
    }
    int u, v;
    ull ww;
    for (int i = 0; i < m; i++)
    {
        cin >> u >> v >> ww;
        to[u][d[u]++] = v;
        w[u][d[u] - 1] = ww;
        to[v][d[v]++] = u;
        w[v][d[v] - 1] = ww;
    }
    memset(vis, false, sizeof(vis));
    vis[1] = true;
    dfs(1, 0);
    cout << ans;
    return 0;
}

Submission Info

Judge Result