PS:求你们放过测评姬吧orz
一个八面四轴的奇特模仿,问给定的一个状态能否在三步及三步以内复原
大暴力,写得累死了orz
虽然代码写得丑,但是能过呀orz
#include <bits/stdc++.h>
using namespace std;
int a[100];
void change(int *t1, int *t2, int *tmpx, int len) {
for (int i = 0; i < len; i ++)
tmpx[t2[i]] = a[t1[i]];
}
void rotate1R() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {28, 30, 31, 35, 36};
int index2[] = {14, 15, 11, 12, 10};
change(index1, index2, tmp, 5);
int index3[] = {14, 15, 11, 12, 10};
int index4[] = {45, 44, 43, 42, 41};
change(index3, index4, tmp, 5);
int index5[] = {45, 44, 43, 42, 41};
int index6[] = {28, 30, 31, 35, 36};
change(index5, index6, tmp, 5);
int index7[] = {1, 5, 9, 2, 3, 4, 8, 7, 6};
int index8[] = {9, 1, 5, 4, 8, 7, 6, 2, 3};
change(index7, index8, tmp, 9);
int index9[] = {19, 54, 68};
int index10[] = {54, 68, 19};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate1M() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {29, 33, 34, 16, 17, 13, 40, 39, 38};
int index2[] = {16, 17, 13, 40, 39, 38, 29, 33, 34};
change(index1, index2, tmp, 9);
int index3[] = {20, 21, 22, 49, 53, 52, 70, 69, 65};
int index4[] = {49, 53, 52, 70, 69, 65, 20, 21, 22};
change(index3, index4, tmp, 9);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate1L() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {23, 24, 25, 26, 27};
int index2[] = {46, 48, 47, 51, 50};
change(index1, index2, tmp, 5);
int index3[] = {46, 48, 47, 51, 50};
int index4[] = {72, 71, 67, 66, 64};
change(index3, index4, tmp, 5);
int index5[] = {72, 71, 67, 66, 64};
int index6[] = {23, 24, 25, 26, 27};
change(index5, index6, tmp, 5);
int index7[] = {55, 59, 63, 57, 56, 60, 61, 62, 58};
int index8[] = {59, 63, 55, 60, 61, 62, 58, 57, 56};
change(index7, index8, tmp, 9);
int index9[] = {37, 32, 18};
int index10[] = {32, 18, 37};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate2R() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {68, 69, 65, 66, 64};
int index2[] = {9, 8, 7, 6, 5};
change(index1, index2, tmp, 5);
int index3[] = {9, 8, 7, 6, 5};
int index4[] = {46, 48, 49, 53, 54};
change(index3, index4, tmp, 5);
int index5[] = {46, 48, 49, 53, 54};
int index6[] = {68, 69, 65, 66, 64};
change(index5, index6, tmp, 5);
int index7[] = {45, 41, 37, 43, 42, 38, 39, 40, 44};
int index8[] = {41, 37, 45, 38, 39, 40, 44, 43, 42};
change(index7, index8, tmp, 9);
int index9[] = {36, 14, 55};
int index10[] = {14, 55, 36};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate2L() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {28, 30, 29, 33, 32};
int index2[] = {18, 17, 13, 12, 10};
change(index1, index2, tmp, 5);
int index3[] = {18, 17, 13, 12, 10};
int index4[] = {59, 60, 61, 62, 63};
change(index3, index4, tmp, 5);
int index5[] = {59, 60, 61, 62, 63};
int index6[] = {28, 30, 29, 33, 32};
change(index5, index6, tmp, 5);
int index7[] = {27, 19, 23, 26, 22, 21, 20, 24, 25};
int index8[] = {19, 23, 27, 21, 20, 24, 25, 26, 22};
change(index7, index8, tmp, 9);
int index9[] = {1, 50, 72};
int index10[] = {50, 72, 1};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate2M() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {70, 71, 67, 4, 3, 2, 47, 51, 52};
int index2[] = {4, 3, 2, 47, 51, 52, 70, 71, 67};
change(index1, index2, tmp, 9);
int index3[] = {31, 35, 34, 16, 15, 11, 56, 57, 58};
int index4[] = {16, 15, 11, 56, 57, 58, 31, 35, 34};
change(index3, index4, tmp, 9);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate3R() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {19, 21, 22, 26, 27};
int index2[] = {5, 6, 2, 3, 1};
change(index1, index2, tmp, 5);
int index3[] = {5, 6, 2, 3, 1};
int index4[] = {72, 71, 70, 69, 68};
change(index3, index4, tmp, 5);
int index5[] = {72, 71, 70, 69, 68};
int index6[] = {19, 21, 22, 26, 27};
change(index5, index6, tmp, 5);
int index7[] = {28, 36, 32, 30, 31, 35, 34, 33, 29};
int index8[] = {36, 32, 28, 35, 34, 33, 29, 30, 31};
change(index7, index8, tmp, 9);
int index9[] = {59, 10, 45};
int index10[] = {10, 45, 59};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate3L() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {63, 62, 58, 57, 55};
int index2[] = {14, 15, 16, 17, 18};
change(index1, index2, tmp, 5);
int index3[] = {14, 15, 16, 17, 18};
int index4[] = {37, 39, 38, 42, 41};
change(index3, index4, tmp, 5);
int index5[] = {37, 39, 38, 42, 41};
int index6[] = {63, 62, 58, 57, 55};
change(index5, index6, tmp, 5);
int index7[] = {54, 46, 50, 53, 49, 48, 47, 51, 52};
int index8[] = {46, 50, 54, 48, 47, 51, 52, 53, 49};
change(index7, index8, tmp, 9);
int index9[] = {23, 9, 64};
int index10[] = {9, 64, 23};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate3M() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {20, 24, 25, 7, 8, 4, 67, 66, 65};
int index2[] = {7, 8, 4, 67, 66, 65, 20, 24, 25};
change(index1, index2, tmp, 9);
int index3[] = {11, 12, 13, 40, 44, 43, 61, 60, 56};
int index4[] = {40, 44, 43, 61, 60, 56, 11, 12, 13};
change(index3, index4, tmp, 9);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate4R() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {59, 60, 56, 57, 55};
int index2[] = {36, 35, 34, 33, 32};
change(index1, index2, tmp, 5);
int index3[] = {36, 35, 34, 33, 32};
int index4[] = {37, 39, 40, 44, 45};
change(index3, index4, tmp, 5);
int index5[] = {37, 39, 40, 44, 45};
int index6[] = {59, 60, 56, 57, 55};
change(index5, index6, tmp, 5);
int index7[] = {64, 72, 68, 66, 67, 71, 70, 69, 65};
int index8[] = {72, 68, 64, 71, 70, 69, 65, 66, 67};
change(index7, index8, tmp, 9);
int index9[] = {5, 46, 27};
int index10[] = {46, 27, 5};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate4L() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {50, 51, 52, 53, 54};
int index2[] = {19, 21, 20, 24, 23};
change(index1, index2, tmp, 5);
int index3[] = {19, 21, 20, 24, 23};
int index4[] = {9, 8, 4, 3, 1};
change(index3, index4, tmp, 5);
int index5[] = {9, 8, 4, 3, 1};
int index6[] = {50, 51, 52, 53, 54};
change(index5, index6, tmp, 5);
int index7[] = {10, 14, 18, 12, 11, 15, 16, 17, 13};
int index8[] = {14, 18, 10, 15, 16, 17, 13, 12, 11};
change(index7, index8, tmp, 9);
int index9[] = {63, 28, 41};
int index10[] = {28, 41, 63};
change(index9, index10, tmp, 3);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
void rotate4M() {
int *tmp = new int[100];
for (int i = 1; i <= 72; i ++) tmp[i] = 0;
int index1[] = {61, 62, 58, 31, 30, 29, 38, 42, 43};
int index2[] = {31, 30, 29, 38, 42, 43, 61, 62, 58};
change(index1, index2, tmp, 9);
int index3[] = {22, 26, 25, 7, 6, 2, 47, 48, 49};
int index4[] = {7, 6, 2, 47, 48, 49, 22, 26, 25};
change(index3, index4, tmp, 9);
for (int i = 1; i <= 72; i ++) if (tmp[i])
a[i] = tmp[i];
delete []tmp;
}
bool check() {
for (int i = 1; i <= 72; i += 9)
for (int j = 0; j < 9; j ++)
if (a[i] != a[i + j])
return false;
return true;
}
void rotate(int n) {
if (n == 1) rotate1R(); else if (n == 2) rotate1R(), rotate1R(); else if (n == 3) rotate1L();
else if (n == 4) rotate1L(), rotate1L(); else if (n == 5) rotate1M(); else if (n == 6) rotate1M(), rotate1M();
else if (n == 7) rotate2R(); else if (n == 8) rotate2R(), rotate2R(); else if (n == 9) rotate2L();
else if (n == 10) rotate2L(), rotate2L(); else if (n == 11) rotate2M(); else if (n == 12) rotate2M(), rotate2M();
else if (n == 13) rotate3R(); else if (n == 14) rotate3R(), rotate3R(); else if (n == 15) rotate3L();
else if (n == 16) rotate3L(), rotate3L(); else if (n == 17) rotate3M(); else if (n == 18) rotate3M(), rotate3M();
else if (n == 19) rotate4R(); else if (n == 20) rotate4R(), rotate4R(); else if (n == 21) rotate4L();
else if (n == 22) rotate4L(), rotate4L(); else if (n == 23) rotate4M(); else rotate4M(), rotate4M();
}
bool flag;
void dfs(int dep) {
if (check()) {flag = true; return;}
if (dep == 4) {return;}
for (int i = 1; i <= 24; i ++) {
rotate(i);
dfs(dep + 1);
if (flag) return;
rotate(i + ((i & 1) ? 1 : -1));
}
}
int main(int argc, char const *argv[]) {
int T; cin >> T;
while (T --) {
for (int i = 1; i <= 72; i ++)
scanf("%d", a + i);
flag = false;
dfs(1);
if (flag) puts("YES");
else puts("NO");
}
return 0;
}