This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "choreography.h"
#include <bits/stdc++.h>
using namespace std;
int pos[100010];
int shift;
int n;
void init(int N, std::vector<int> P) {
n=N;
for(int i=0;i<N;i++)pos[P[i]] = i;
return;
}
void move_right(int K) {
shift+=K;
return;
}
void move_left(int K) {
shift-=K;
return;
}
void swap_places() {
return;
}
void move_around() {
return;
}
int get_position(int D){
return ((pos[D]+shift)%n+n)%n;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |