Submission #579766

#	Time	Username	Problem	Language	Result	Execution time	Memory
579766		1ne	Gondola (IOI14_gondola)	C++14	0 / 100	1 ms	212 KiB

gondola

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

int valid(int n, int inputSeq[])
{
	int index = -1;
  for (int i = 0;i<n;++i){
	if (inputSeq[i] <=n){
		index = i;
	}
  }
  map<int,int>visited;
  if (index == -1)return 1;
  for (int i = 0;i<n;++i){
	int j = (i + index)%n;
	int temp = inputSeq[index] + i;
	if (temp > n)temp = 1;
	if (visited[temp] || visited[inputSeq[j]])return 0;
	visited[temp] = true;
	visited[inputSeq[j]] = true;
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

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