# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1016552 | 2024-07-08T08:06:17 Z | Ariadna | Choreography (IOI23_choreography) | C++17 | 0 ms | 0 KB |
#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(); void move_around(); 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; }