Submission #1016724

#TimeUsernameProblemLanguageResultExecution timeMemory
1016724AriadnaChoreography (IOI23_choreography)C++17
0 / 100
44 ms10576 KiB
#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> dancer, 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() {
    swap(dancer, pos);
}

void init(int N, vector<int> P) {
    n = N;
    pos = vector<int>(N);
    for (int i = 0; i < N; ++i) {
        dancer[i] = P[i];
        pos[P[i]] = i;
    }
}

int get_position(int D) {
    return (((pos[D]+total)%n)+n)%n;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...