// correct/sol_na_st2.cpp
#include "choreography.h"
#include <vector>
#include <iostream>
#include <cassert>
#include <algorithm>
std::vector<int> p;
void init(int N, std::vector<int> P) {
p=P;
}
void move_right(int K) {
move_left((int)p.size()-K);
}
void move_left(int K) {
rotate(p.begin(), p.begin()+K, p.end());
}
void swap_places() {
for(int i=0;i<(int)p.size()/2;++i) {
std::swap(p[2*i], p[2*i+1]);
}
}
void move_around() {
std::vector<int> pos(p.size());
for(int i=0;i<(int)p.size();++i) {
pos[p[i]]=i;
}
p=pos;
}
int get_position(int D){
return find(p.begin(), p.end(), D)-p.begin();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1077 ms |
3796 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
3 ms |
596 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
5 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1056 ms |
3884 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1056 ms |
3884 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1077 ms |
3796 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1077 ms |
3796 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |