Submission #839545

#	Time	Username	Problem	Language	Result	Execution time	Memory
839545		model_code	Choreography (IOI23_choreography)	C++17	24 / 100	71 ms	6264 KiB

choreography

// correct/solution-subtask4.cpp

#include "choreography.h"
#include <vector>

int x = 0, j = 0, n;
bool s = false;
std::vector<int> p, inv;

void init(int N, std::vector<int> P){
	n = N;
	p = P;
	inv.resize(N);
	for(int i = 0; i < N; i++){
		inv[P[i]] = i;
	}
}

void move_right(int K) {}

void move_left(int K) {}

void swap_places() {
    x ^= 1;
}

void move_around(){
	s = !s;
    std::swap(x, j);
}

int get_position(int D){
    return s ? p[D^j]^x : inv[D^j]^x;
}

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