제출 #843638

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843638		heavylightdecomp	Choreography (IOI23_choreography)	C++17	7 / 100	1060 ms	6360 KiB

choreography

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
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) {
    while(c >= N) { c -= N; }
    while(c < 0) { c += N; }
    return c;
    //This code is theoretically slow, but it seems to be optimized by compiler ^^
}
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);

}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 10
• Subtask 4: 0 / 14
• Subtask 5: 0 / 28
• Subtask 6: 0 / 29