Submission #168540

#	Time	Username	Problem	Language	Result	Execution time	Memory
168540		johutha	Gondola (IOI14_gondola)	C++14	45 / 100	22 ms	2404 KiB

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
#include <iostream>

#define int int64_t

using namespace std;

signed valid(signed n, signed inputSeq[])
{
	for (int i = 0; i < n; i++) inputSeq[i]--;

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

	for (int i = 0; i < n; i++)
	{
		if (inputSeq[i] < n)
		{
			if ((zval + i + n) % n != inputSeq[i]) return 0;
		}
	}

	return 1;
}

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

signed replacement(signed n, signed gondolaSeq[], signed replacementSeq[])
{
	vector<int> Seq;
	
	for (int i = 0; i < n; i++) Seq.push_back(gondolaSeq[i] - 1);

	int zval = 0;
	for (int i = 0; i < n; i++)
	{
		if (Seq[i] < n)
		{
			zval = Seq[i] - i;
			break;
		}
	}

	rotate(Seq.rbegin(), Seq.rbegin() + ((zval + n) % n), Seq.rend());
	int mmax = *max_element(Seq.begin(), Seq.end());
	int mind = -1;

	for (int i = 0; i <= mmax - n; i++) replacementSeq[i] = -1;

	for (int i = 0; i < n; i++)
	{
		if (Seq[i] == mmax) mind = i;
		if (Seq[i] >= n) replacementSeq[Seq[i] - n] = i + 1;
	}

	mind++;
	for (int i = 0; i <= mmax - n; i++)
	{
		if (replacementSeq[i] == -1)
		{
			replacementSeq[i] = mind;
			mind = n + i + 1;
		}
	}
	replacementSeq[mmax - n] = mind;

	return mmax - n + 1;
}

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

signed countReplacement(signed n, signed inputSeq[])
{
	for (int i = 0; i < n; i++) inputSeq[i]--;

  	return -3;
}

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