-
Notifications
You must be signed in to change notification settings - Fork 0
/
1156.cpp
164 lines (133 loc) · 3.2 KB
/
1156.cpp
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<sstream>
#include<utility>
#include<deque>
#include<list>
#include<set>
#include<cmath>
#include<cctype>
#include<algorithm>
#include<ctime>
using namespace std;
#define rep(i, s, n) for(int i = s; i < n; i++)
//1<<16 = 2^16
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
const int maxn = 1200;
int n;
int vis[maxn][maxn];
ii p[maxn][maxn];
ii after[maxn][maxn];
string per[] = {"id", "rot", "sym","bhsym", "bvsym", "div", "mix", "id-", "rot-", "sym-","bhsym-", "bvsym-", "div-", "mix-"};
vii cycles[maxn*maxn];
void permutation(int i){
switch(i){
case 0: rep(i,0,n) rep(j,0,n)after[i][j] = p[i][j]; break;
case 1:
rep(i,0,n) rep(j,0,n){
after[-j+n-1][i] = p[i][j];
}
break;
case 2:
rep(i,0,n) rep(j,0,n) after[i][j] = p[i][n-1-j];
break;
case 3:
rep(i,0,n) rep(j,0,n) if(i>=n/2)after[i][j] = p[i][n-1-j]; else after[i][j] = p[i][j];
break;
case 4:
rep(i,0,n) rep(j,0,n) if(i>=n/2) after[i][j] = p[3*n/2-1-i][j]; else after[i][j] = p[i][j];
break;
case 5:
rep(i,0,n) rep(j,0,n) if(i>=n/2)after[i][j] = p[2*i-n+1][j]; else after[i][j] = p[2*i][j];
break;
case 6:
rep(i,0,n) rep(j,0,n){
if(i%2){
if(j%2) after[i][j] = p[i][n/2+j/2];
else after[i][j] = p[i-1][n/2+j/2];
}else{
if(j%2) after[i][j] = p[i+1][j/2];
else after[i][j] = p[i][j/2];
}
}
break;
case 7: permutation(i-7); return;
case 8:
rep(i,0,n) rep(j,0,n){
after[i][j] = p[-j+n-1][i];
}
break;
case 9: permutation(i-7); return;
case 10: permutation(i-7); return;
case 11: permutation(i-7); return;
case 12:
rep(i,0,n) rep(j,0,n) if(i>=n/2)after[2*i-n+1][j] = p[i][j]; else after[2*i][j] = p[i][j];
break;
case 13:
rep(i,0,n) rep(j,0,n){
if(i%2){
if(j%2) after[i][n/2+j/2] = p[i][j];
else after[i-1][n/2+j/2] = p[i][j];
}else{
if(j%2) after[i+1][j/2] = p[i][j];
else after[i][j/2] = p[i][j];
}
}
break;
}
memcpy(p, after,sizeof after);
}
int gcd(int a, int b){
return b==0? a:gcd(b, a%b);
}
int main(){
//freopen("data.out", "w", stdout);
int t, nc = 0;
cin>>t>>n;
while(t--){
vector<string> orders;
int n2;
for(;;){
string s;
if(!(cin>>s)) break;
if(isdigit(s[0])) {sscanf(s.c_str(),"%d", &n2); break;}
orders.push_back(s);
}
rep(i,0,n) rep(j,0,n) p[i][j] = ii (i,j);
for(int i = orders.size()-1; i >=0; i--){
int j = find(per, per+14, orders[i])-per;
permutation(j);
}
rep(i,0,nc)cycles[i].clear();
memset(vis,0,sizeof vis);
nc = 0;//number of cycles
rep(i,0,n) rep(j,0,n){
if(vis[i][j]) continue;
int m = i, n = j;
while(!vis[m][n]){
vis[m][n] = 1;
cycles[nc].push_back(ii (m,n));
ii tmp = p[m][n];
m = tmp.first;
n = tmp.second;
}
nc++;
}
int ans = 1;
rep(i,0,nc){
int si = cycles[i].size();
ans = ans/gcd(ans, si)*si;
}
cout<<ans<<endl;
if(t) cout<<endl;
n = n2;
}
}