-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathf.cpp
56 lines (53 loc) · 1.28 KB
/
f.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
#include <bits/stdc++.h>
#define endl '\n'
#define eat cin
#define moo cout
#define int long long
using namespace std;
int T, N, rp[200], p[200];
bool vis[200];
string s;
int32_t main(){
eat.tie(0) -> sync_with_stdio(0);
eat >> T;
while(T--){
eat >> N >> s;
for(int i = 0; i < N; i++){
eat >> rp[i];
rp[i]--;
}
for(int i = 0; i < N; i++){
p[rp[i]] = i;
}
fill(vis, vis+N, 0);
int ans = 1;
for(int i = 0; i < N; i++){
if(vis[i]) continue;
string og = "";
vector<int> ord;
int v = i;
do{
ord.push_back(v);
v = p[v];
vis[v] = true;
}while(v != i);
for(int j : ord){
og += s[j];
}
int rot = 0;
while(true){
rot++;
bool good = true;
for(int j = 0; j < (int)ord.size(); j++){
if(og[j] != og[(j+rot)%ord.size()]){
good = false;
break;
}
}
if(good) break;
}
ans = lcm(ans, rot);
}
moo << ans << endl;
}
}