Submission #138567

#	Time	Username	Problem	Language	Result	Execution time	Memory
138567		Mahmoud_Adel	Gondola (IOI14_gondola)	C++14	20 / 100	20 ms	5156 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
const int N = 1e6+5;
int mark[N];
int valid(int n, int inputSeq[])
{
	memset(mark, 0, sizeof mark);
	for(int i=0; i<n; i++)
	{
		if(mark[inputSeq[i]]) return 0;
		mark[inputSeq[i]] = 1;
	}
	int j = -1;
	for(int i=0; i<n; i++) if(inputSeq[i] > 0 && inputSeq[i] <= n) j = i;
	if(j == -1) return 1;
	for(int i=0; i<n; i++)
	{
		int id = (i+j)%n, jd = (i+j+1)%n;
		if(inputSeq[jd] > n) inputSeq[jd] = inputSeq[id]%n + 1;
		if(inputSeq[jd] != inputSeq[id]%n + 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: 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