#include "choreography.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> pos;
vector<int> perm;
vector<int>pom;
int shift;
int n,i;
void init(int N, std::vector<int> P) {
n=N;
pos.resize(n);
pom.resize(n);
for(int i=0;i<N;i++)pos[P[i]] = i;
perm = P;
return;
}
void move_right(int k) {
for(int i=0;i<n;i++)
pom[(i+k)%n]=perm[i];
perm = pom;
for(int i=0;i<n;i++)
pos[i] = (pos[i]+k)%n;
return;
}
void move_left(int k) {
for(int i=0;i<n;i++)
pom[(i-k+n)%n]=perm[i];
perm = pom;
for(int i=0;i<n;i++)
pos[i] = (pos[i]-k+n)%n;
return;
}
map<vector<int>,bool>mapa;
void swap_places() {
for(i=0;i<n;i++)
if(i%2==0)swap(perm[i], perm[i+1]);
for(i=0;i<n;i++)
pos[i]^=1;
mapa[perm] = 1;
assert(mapa.size()<10);
return;
}
void move_around() {
for(i=0;i<n;i++)
pom[perm[perm[i]]] = perm[i];
perm = pom;
for(i=0;i<n;i++)
pos[perm[i]]=i;
mapa[perm] = 1;
assert(mapa.size()<10);
return;
}
int get_position(int D){
// for(i=0;i<n;i++)
// printf("%d ", perm[i]);
// exit(0);
return pos[D];
// return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1032 ms |
4712 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1050 ms |
5320 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1050 ms |
5320 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1032 ms |
4712 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1032 ms |
4712 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |