Submission #250888

#	Time	Username	Problem	Language	Result	Execution time	Memory
250888		godwind	곤돌라 (IOI14_gondola)	C++14	20 / 100	41 ms	5248 KiB

gondola

#include <iostream>
#include <set>
#include "gondola.h"

using namespace std;

int valid(int n, int a[])
{
	set<int> diff;
	for (int i = 0; i < n; ++i) {
		if (a[i] < 1) return 0;
		diff.insert(a[i]);
	}
	if ((int)diff.size() != n) return 0;
	int pos = -1;
	for (int i = 0; i < n; ++i) {
		if (a[i] <= n) {
			pos = i;
			break;
		}
	}
	if (pos == -1) return 1;
	pos = (pos - a[pos] + 1 + n) % n;
	for (int i = 0; i < n; ++i) {
		int need = i + 1;
		int p = (pos + i) % n;
		if (a[p] <= n && a[p] != need) 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: 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