Submission #371049

#	Time	Username	Problem	Language	Result	Execution time	Memory
371049		peijar	Gondola (IOI14_gondola)	C++17	10 / 100	19 ms	1060 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;

using ll = long long;

int valid(int n, int inputSeq[])
{
	int posMin(-1);
	for (int i(0); i < n; ++i)
		if (inputSeq[i] <= n and (posMin == -1 or inputSeq[i] < inputSeq[posMin]))
			posMin = i;
	if (posMin == -1)
		return 1;
	for (int i(1); i < n; ++i)
	{
		int cur = inputSeq[(posMin + i)%n];
		if (cur > n) continue;
		if (cur != inputSeq[posMin] + i)
			return 0;
	}
	sort(inputSeq, inputSeq+n);
	for (int i(1); i < n; ++i)
		if (inputSeq[i] == inputSeq[i-1])
			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: 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