Submission #64382848

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <inttypes.h>
/* {1,2,3} -> ... -> {3,2,1} */
int next_permutation(int arr[],int n) {
  int target;
  int i;
  int temp;
  for (i = n - 2; i >= 0; i--) {
    if (arr[i] < arr[i + 1]) break;
  }
  if (i < 0) return 0;
  target = i;
  for (i = 0; target + i + 1 < n - i - 1; i++) {
    temp = arr[target + 1 + i];
    arr[target + 1 + i] = arr[n - 1 - i];
    arr[n - i - 1] = temp;
  }
  for (i = target + 1; i < n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <inttypes.h>

/* {1,2,3} -> ... -> {3,2,1} */
int next_permutation(int arr[],int n) {
	int target;
	int i;
	int temp;
	for (i = n - 2; i >= 0; i--) {
		if (arr[i] < arr[i + 1]) break;
	}
	if (i < 0) return 0;
	target = i;

	for (i = 0; target + i + 1 < n - i - 1; i++) {
		temp = arr[target + 1 + i];
		arr[target + 1 + i] = arr[n - 1 - i];
		arr[n - i - 1] = temp;
	}

	for (i = target + 1; i < n; i++) {
		if (arr[i] > arr[target]) break;
	}
	temp = arr[i];
	arr[i] = arr[target];
	arr[target] = temp;
	return 1;
}

#define NONE (UINT64_C(1) << 63)

uint64_t w[16][16];

int main(void) {
	int N, M;
	int i, j;
	int order[16];
	uint64_t ans = NONE;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 1; i <= N; i++) {
		for (j = 1; j <= N; j++) {
			w[i][j] = NONE;
		}
		order[i - 1] = i;
	}
	for (i = 0; i < M; i++) {
		int u, v;
		uint64_t w_;
		if (scanf("%d%d%" SCNu64, &u, &v, &w_) != 3) return 1;
		w[u][v] = w[v][u] = w_;
	}
	do {
		uint64_t candidate = 0;
		for (i = 1; i < N; i++) {
			uint64_t label = w[order[i - 1]][order[i]];
			if (label & NONE) {
				candidate = NONE;
				break;
			}
			candidate ^= label;
			if (order[i] == N) break;
		}
		if (candidate < ans) ans = candidate;
	} while (next_permutation(order + 1, N - 1));
	printf("%" PRIu64 "\n", ans);
	return 0;
}

Submission Info

Judge Result