Submission #392158

#	Time	Username	Problem	Language	Result	Execution time	Memory
392158		rainboy	Gondola (IOI14_gondola)	C++98	55 / 100	24 ms	3152 KiB

gondola

#include "gondola.h"
#include <stdio.h>
#include <string.h>

#define A	250000

int max(int a, int b) { return a > b ? a : b; }

int valid(int n, int aa[]) {
	static char used[A + 1];
	int i, j;

	for (i = 0; i < n; i++) {
		if (used[aa[i]])
			return 0;
		used[aa[i]] = 1;
	}
	for (i = 0; i < n; i++)
		if (aa[i] <= n) {
			for (j = 0; j < n; j++)
				if (aa[(i + j) % n] <= n && aa[(i + j) % n] != (aa[i] - 1 + j) % n + 1)
					return 0;
			return 1;
		}
  return 1;
}

int replacement(int n, int aa[], int bb[]) {
	static int ii[A + 1];
	int i, a, a_, b, offset;

	memset(ii, -1, (A + 1) * sizeof *ii);
	offset = 0;
	for (i = 0, a_ = -1; i < n; i++) {
		ii[aa[i]] = i, a_ = max(a_, aa[i]);
		if (aa[i] <= n)
			offset = (aa[i] - 1 - i + n) % n;
	}
	for (a = n + 1, b = (ii[a_] + offset) % n + 1; a <= a_; a++)
		if (a < a_ && ii[a] != -1)
			bb[a - n - 1] = (ii[a] + offset) % n + 1;
		else
			bb[a - n - 1] = b, b = a;
  return a_ - n;
}

int countReplacement(int n, int aa[]) {
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10