Submission #923223

#TimeUsernameProblemLanguageResultExecution timeMemory
923223AdamGSChoreography (IOI23_choreography)C++17
7 / 100
61 ms6380 KiB
#include "choreography.h" #include<bits/stdc++.h> using namespace std; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() const int LIM=1e5+7; int P[LIM], Q[LIM], n, a; vector<int>A; void init(int N, vector<int>_P) { n=N; rep(i, n) P[i]=_P[i]; rep(i, n) Q[P[i]]=i; } void move_right(int k) { a=(a+k)%n; } void move_left(int k) { move_right((n-k)%n); } void swap_places() { if(A.size() && A.back()==a%2) A.pop_back(); else A.pb(a%2); } void move_around() { } int get_position(int d) { int x=Q[d]; int p=A.size()%n; if(A.size() && x%2==A[0]) x=(x+p)%n; else x=(x-p+n)%n; return (x+a)%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...