제출 #1304205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304205		the_commando_x	곤돌라 (IOI14_gondola)	C++17	25 / 100	29 ms	4740 KiB

gondola

#include "gondola.h"

#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[])
{
	set<int> seen;
	for (int i = 0; i < n; ++i)
		if (seen.count(inputSeq[i]))
			return 0;
		else
			seen.insert(inputSeq[i]);

	int start = -1;
	for (int i = 0; i < n; ++i)
		if (inputSeq[i] <= n)
		{
			start = i;
			break;
		}

	if (start != -1)
	{
		int base = inputSeq[start];
		for (int i = 0; i < n; ++i)
		{
			int expected = (base + i - start) % n;
			if (expected <= 0)
				expected += n;

			if (inputSeq[i] <= n && inputSeq[i] != expected)
				return 0;
		}
	}

	int nextReplacement = n + 1;
	for (int i = 0; i < n; ++i)
		if (inputSeq[i] > n)
			if (inputSeq[i] < nextReplacement)
				return 0;
			else
				nextReplacement = inputSeq[i] + 1;

	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int start = -1;
	for (int i = 0; i < n; i++)
	{
		if (gondolaSeq[i] <= n)
		{
			start = i;
			break;
		}
	}

	int M = 0;
	for (int i = 0; i < n; ++i)
		M = max(M, gondolaSeq[i]);

	int totalBreaks = M - n;

	if (start == -1)
		start == 0;

	int idx = 0, base = gondolaSeq[start];
	map<int, int> brokenAt;

	for (int i = 0; i < n; ++i)
	{
		int expected = (base + i - start) % n;
		if (expected <= 0)
			expected += n;

		if (gondolaSeq[i] > n)
			brokenAt[gondolaSeq[i]] = expected;
	}

	int current = -1, nextReplacement = n + 1;

	for (auto &[rep, broken] : brokenAt)
	{
		if (current == -1)
			current = broken;

		while (nextReplacement < rep)
		{
			replacementSeq[idx++] = current;
			current = nextReplacement++;
		}

		replacementSeq[idx++] = current;
		current = rep;
		nextReplacement = rep + 1;
	}

	while (nextReplacement <= M)
	{
		replacementSeq[idx++] = current;
		current = nextReplacement++;
	}

	return idx;
}

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

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