提出 #41560507

---

ソースコード 拡げる

#include <stdio.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;
}
 
int N, M;
char S[16][16];
 
int order[16];
 
int main(void) {
	int i;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%15s", S[i]) != 1) return 1;
		order[i] = i;
	}
	do {
		int ok = 1;
		int j;
		for (j = 1; j < N; j++) {
			int diff_count = 0;
			int k;
			for (k = 0; k < M; k++) {
				diff_count += S[order[j - 1]][k] != S[order[j]][k];
			}
			if (diff_count != 1) {
				ok = 0;
				break;
			}
		}
		if (ok) {
			puts("Yes");
			return 0;
		}
	} while (next_permutation(order, N));
	puts("No");
	return 0;
}

#include <stdio.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;
}

int N, M;
char S[16][16];

int order[16];

int main(void) {
	int i;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%15s", S[i]) != 1) return 1;
		order[i] = i;
	}
	do {
		int ok = 1;
		int j;
		for (j = 1; j < N; j++) {
			int diff_count = 0;
			int k;
			for (k = 0; k < M; k++) {
				diff_count += S[order[j - 1]][k] != S[order[j]][k];
			}
			if (diff_count != 1) {
				ok = 0;
				break;
			}
		}
		if (ok) {
			puts("Yes");
			return 0;
		}
	} while (next_permutation(order, N));
	puts("No");
	return 0;
}

提出情報

ジャッジ結果