Submission #63532121

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstring>
using namespace std;

long long G[10][10];
int main() {
    int n, m;
    cin >> n >> m;

    int a, b; long long c;
    memset(G, -1, sizeof(G));
    while(m--) {
        cin >> a >> b >> c;
        a--; b--;
        G[a][b] = G[b][a] = c;
    }

    //for(int i = 0; i < n; i++) {
    //    for (int j = 0; j < n; j++) {
    //        cout << G[i][j] << " ";
    //    }
    //    cout << endl;
    //}
    long long ans = (1LL << 61) - 1;
    vector<int> order(n);
    iota(begin(order), end(order), 0);
    do {
        long long tmp = 0;
        if(order[0] != 0) continue;
        bool ok = true;
        for(int i = 0; ok && i < n-1; i++) {
            if(G[order[i]][order[i+1]] == -1) {
                ok = false;
            } else {
                tmp ^= G[order[i]][order[i+1]];
            }

            if(order[i+1] == n-1 && ok) {
                ans = min(ans, tmp);
                ok = false;
            }
        }
    } while (next_permutation(begin(order), end(order)));
    cout << ans << endl;
}

Submission Info

Judge Result