Submission #841160

#TimeUsernameProblemLanguageResultExecution timeMemory
841160heavylightdecompChoreography (IOI23_choreography)C++17
7 / 100
68 ms8784 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; while(pos >= N) { pos -= N; } while(pos < 0) { pos += N; } return pos; }
#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...