Submission #127699

#	Time	Username	Problem	Language	Result	Execution time	Memory
127699		tinjyu	곤돌라 (IOI14_gondola)	C++14	10 / 100	14 ms	2200 KiB

gondola

#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;
}

• 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