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 <bits/stdc++.h>
using namespace std;
int n;
vector<int> pos;
int total = 0;
void move_right(int K) {
total += K;
}
void move_left(int K) {
total -= K;
}
void swap_places() {
return;
}
void move_around() {
return;
}
void init(int N, vector<int> P) {
n = N;
pos = vector<int>(N);
for (int i = 0; i < N; ++i) {
pos[P[i]] = i;
}
}
int get_position(int D) {
return (((pos[D]+total)%n)+n)%n;
}
# | 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... |