USACO Transformations

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
/*
ID: wcr19961
PROG: transform
LANG: C++11
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
typedef long long LL;
const int maxn = 12;
char a[maxn][maxn], b[maxn][maxn], c[maxn][maxn], d[maxn][maxn];
void rotate(int n, char a[][maxn], char b[][maxn]) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
b[i][j] = a[n - 1 - j][i];
}
}
}
bool check(int n, char a[][maxn], char b[][maxn]) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] != b[i][j]) {
return false;
}
}
}
return true;
}
int main() {
freopen("transform.in","r",stdin);
freopen("transform.out","w",stdout);
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%s", a[i]);
}
for (int i = 0; i < n; ++i) {
scanf("%s", b[i]);
}
rotate(n, a, c);
if (check(n, b, c)) {
puts("1");
return 0;
}
rotate(n, c, d);
if (check(n, b, d)) {
puts("2");
return 0;
}
rotate(n, d, c);
if (check(n, b, c)) {
puts("3");
return 0;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
c[i][j] = a[i][n - 1 - j];
}
}
if (check(n, b, c)) {
puts("4");
return 0;
}
rotate(n, c, d);
if (check(n, b, d)) {
puts("5");
return 0;
}
rotate(n, d, c);
if (check(n, b, c)) {
puts("5");
return 0;
}
rotate(n, c, d);
if (check(n, b, d)) {
puts("5");
return 0;
}
puts(check(n, a, b) ? "6" : "7");
return 0;
}

支付宝扫码领红包