Submission #494072

#	Time	Username	Problem	Language	Result	Execution time	Memory
494072		ahmeteren	Gondola (IOI14_gondola)	C++17	10 / 100	9 ms	972 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int n, int inputSeq[])
{
	int mn = 1e7, start = 0, it = 0;
	vector<int> vec(n);

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

	for(int i = start; i < start + n; i++)
	{
		vec[it] = inputSeq[i % n];
		it++;
	}

	int cur = mn;

	for(int i = 0; i < n; i++, cur++)
	{
		if(vec[i] > n)
			continue;
		if(vec[i] != cur)
		{
			return 0;
		}
	}

	return 1;
}


int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int mx = 0, it = 0;
	map<int, int> used;
	for(int i = 0; i < n; i++)
	{
		mx = max(mx, gondolaSeq[i]);
		used[gondolaSeq[i]] = true;
	}

	for(int i = n; i <= mx; i++)
	{
		if(!used[i])
		{
			replacementSeq[it] = i;
			it++;
		}
	}

	return it;
}

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

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