# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843643 | heavylightdecomp | Choreography (IOI23_choreography) | C++17 | 0 ms | 0 KiB |
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;
const int maxn = 1e5+5;
#define int long long
int x[maxn], y[maxn], s, t, N;
void init(int n, vector<int> p) {
N = n;
for(int i = 0; i < N; i++) {
x[i] = p[i]; // x to y
y[p[i]] = i; // y to x
}
}
int fix(int c) {
c += maxn * N;
return c % N;
}
void move_right(int K) {
s += K;
}
void move_left(int K) {
s -= K;
}
void swap_places() {
}
void move_around() {
swap(x,y);
swap(s,t);
}
int get_position(int D) {
/*
Careful!
x[i] represents p[i+s mod N]
x[i-s mod N] represents p[i], the intended value
same for y
*/
return fix(y[fix(D-t)] + s);
}