Submission #841159

#TimeUsernameProblemLanguageResultExecution timeMemory
841159heavylightdecompChoreography (IOI23_choreography)C++17
0 / 100
71 ms8856 KiB
#include<bits/stdc++.h> using namespace std; const int maxn = 1e5+5; int orz[maxn], delt[maxn], N, ch; void init(int n, vector<int> p) { N = n; for(int i = 0; i < N; i++) { orz[p[i]] = i; } } void move_right(int K) { ch += K; } void move_left(int K) { ch += -K; } void swap_places() { } void move_around() { } int get_position(int D) { int pos = orz[D] + ch; return pos % 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...