Submission #371255

#	Time	Username	Problem	Language	Result	Execution time	Memory
371255		peijar	Gondola (IOI14_gondola)	C++17	20 / 100	47 ms	5228 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[])
{
	set<int> seen;
	for (int i(0); i < n; ++i)
	{
		if (seen.count(inputSeq[i]))
			return 0;
		seen.insert(inputSeq[i]);
	}
	for (int i(0); i < n; ++i)
		if (inputSeq[i] <= n)
		{
			for (int j(1); j < n; ++j)
				if (inputSeq[(i+j)%n] <= n and inputSeq[(i+j)%n]%n != (inputSeq[i] + j)%n)
					return 0;
			return 1;
		}
  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: 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