Submission #923224

#	Time	Username	Problem	Language	Result	Execution time	Memory
923224		AdamGS	Choreography (IOI23_choreography)	C++17	59 / 100	69 ms	9036 KiB

choreography

#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, b, inv;
vector<int>A, B;
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) {
  if(!inv) a=(a+k)%n;
  else b=(b+k)%n;
}
void move_left(int k) {
  move_right((n-k)%n);
}
void swap_places() {
  if(!inv) {
    if(A.size() && A.back()==a%2) A.pop_back();
    else A.pb(a%2);
  } else {
    if(B.size() && B.back()==b%2) B.pop_back();
    else B.pb(b%2);
  }
}
void move_around() {
  inv^=1;
}
int get_position(int d) {
  if(!inv) {
    int z=d, p=B.size()%n;
    if(B.size() && z%2==B[0]) z=(z+p)%n; else z=(z-p+n)%n;
    z=(z-b+n)%n;
    int x=Q[z];
    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;
  }
  int z=d, p=A.size()%n;
  if(A.size() && z%2==A[0]) z=(z+p)%n; else z=(z-p+n)%n;
  z=(z-a+n)%n;
  int x=P[z];
  p=B.size()%n;
  if(B.size() && x%2==B[0]) x=(x+p)%n; else x=(x-p+n)%n;
  return (x+b)%n;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 10 / 10
• Subtask 4: 14 / 14
• Subtask 5: 28 / 28
• Subtask 6: 0 / 29