Järjestys

#include <iostream>
#include <stdint.h>
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
#include <stdlib.h>
#include <math.h>

void flip(uint32_t *arr, uint32_t n) {
	uint32_t i;
	uint32_t temp;
	for (i = 0; i < ceil(n / 2.0); i++) {
		temp = arr[i];
		arr[i] = arr[n - 1 - i];
		arr[n - 1 - i] = temp;
	}
}

void print_arr(uint32_t *arr, uint32_t n) {
	uint32_t i;
	for (i = 0; i < n; i++) {
		std::cout << arr[i];
	}
	std::cout << std::endl;
}

int main(int argc, char *argv[]) {
	uint32_t n;
	uint32_t *arr;
	uint32_t move_n;
	uint32_t *move_arr;

	std::cin >> n;
	arr = (uint32_t *) calloc(n, sizeof(uint32_t));

	move_n = 0;
	move_arr = (uint32_t *) calloc(5 * n, sizeof(uint32_t));

	uint32_t i;
	for (i = 0; i < n; i++) {
		std::cin >> arr[i];
	}

	for (i = 0; i < 5 * n; i++) {
		uint32_t max = 0;
		uint32_t max_i;
		uint32_t j;
		for (j = 0; j < n; j++) {
			if (arr[j] != j + 1 && arr[j] > max) {
				max = arr[j];
				max_i = j;
			}
		}
		if (max == 0)
			break;

		move_arr[move_n++] = max_i + 1;
		flip(arr, max_i + 1);

		move_arr[move_n++] = arr[0];
		flip(arr, arr[0]);
	}

	std::cout << move_n;
	print_arr(move_arr, move_n);

	free(arr);
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED