제출 #607733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607733		jairRS	곤돌라 (IOI14_gondola)	C++17	20 / 100	74 ms	9524 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

int prev(int in, int n)
{
	return (--in + n) % n;
}

int next(int in, int n)
{
	return ++in % n;
}

map<int, int> pos;
map<int, int> freq;

int valid(int n, int inputSeq[])
{
	for (int i = 0; i < n; i++)
	{
		pos[inputSeq[i]] = i;
		freq[inputSeq[i]]++;
	}

	vi sortedInput(inputSeq, inputSeq + n);
	sort(sortedInput.begin(), sortedInput.end());

	bool ans = true;
	int expectedMax = n;

	for (int i = 0; i < n; i++)
	{
		int cur = sortedInput[i];
		int nxt = sortedInput[next(i, n)];
		int gap = nxt - cur;

		if (gap == 1 || i == n - 1)
			ans &= (pos[nxt] == next(pos[cur], n));
		else
			expectedMax += gap;

		ans &= freq[cur] == 1;
	}

	return (ans && (expectedMax == sortedInput.back()));
}

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

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