Submission #127699

#TimeUsernameProblemLanguageResultExecution timeMemory
127699tinjyuGondola (IOI14_gondola)C++14
10 / 100
14 ms2200 KiB
#include "gondola.h"
#include <iostream>
using namespace std;
int valid(int n, int a[])
{
	int tmp=-1,mi=250000,tag[250005];
	for(int i=0;i<250000;i++)tag[i]=0;
	for(int i=0;i<n;i++)
	{
		if(tag[a[i]]==1)return 0;
		tag[a[i]]++;
	}
	for(int i=0;i<n;i++)
	if(a[i]<=n && a[i]<mi)
	{
		tmp=i;
		mi=a[i];
	}
	if(tmp==-1)return 1;
	int p=n-1,i=tmp;
	while(p--)
	{
		i++;
		i%=n;
		//cout<<tmp<<" "<<a[tmp]<<endl;
		if(a[i]<a[tmp])return 0;
		if(a[i]<=n)tmp=i;
	}
	return 1;
}


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

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

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...