제출 #166744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166744		alanhpereira	곤돌라 (IOI14_gondola)	C++11	20 / 100	15 ms	1656 KiB

gondola

#include "gondola.h"
#define MAX 250050

int used[MAX];

int valid(int n, int inputSeq[]) {
	for (int i = 0; i < MAX; i++)
		used[i] = 0;
	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;
			}
		}
		else {
			if (used[inputSeq[i]]) return 0;
			used[inputSeq[i]] = 1;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	for (int i = 0; i < MAX; i++)
		used[i] = -1;
	int lastRep = 0;
	int ans = 0;
	for (int i = 1; i < n; i++) {
		used[gondolaSeq[i]] = i;
		if (gondolaSeq[i] > gondolaSeq[lastRep]) lastRep = i;
	}
	for (int i = n + 1; i <= gondolaSeq[lastRep]; i++) {
		if (used[i] == -1) {
			replacementSeq[ans++] = lastRep;
		}
		else
			replacementSeq[used[i]] = lastRep;
	}
	return ans;
}

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 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