Submission #166741

#	Time	Username	Problem	Language	Result	Execution time	Memory
166741		alanhpereira	곤돌라 (IOI14_gondola)	C++11	10 / 100	13 ms	1144 KiB

gondola

#include "gondola.h"

int valid(int n, int inputSeq[]) {
	int basePos = -1, base = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			if (basePos == -1) {
				basePos = i;
				base = inputSeq[i];
			}
			else {
				if (inputSeq[i] != (i - basePos + base - 1) % n + 1)
					return 0;
			}
		}
	}
	return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	return -2;
}

//----------------------

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

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