Submission #127708

#	Time	Username	Problem	Language	Result	Execution time	Memory
127708		zozder	곤돌라 (IOI14_gondola)	C++14	20 / 100	16 ms	1660 KiB

gondola

#include "gondola.h"
#include <iostream>
using namespace std;

int valid(int n, int inputSeq[])
{
	int minn=1000,minl=n;
	int tag[250001];
	for(int i=1;i<=250000;i++)tag[i]=0;
	for(int i=0;i<n;i++)if(inputSeq[i]<minn&&0<inputSeq[i]&&inputSeq[i]<=n)
	{
		minn=inputSeq[i];
		minl=i;
		
  	}
	int t=1,m=n;
	while(m>0)
  	{
  		if(minl>=n)minl=0;
  		
  		if((inputSeq[minl]!=minn&&0<inputSeq[minl]&&inputSeq[minl]<=n)||tag[inputSeq[minl]]==1)t=0;
  		tag[inputSeq[minl]]=1;
//  		cout<<minn<<","<<minl<<","<<inputSeq[minl]<<","<<tag[inputSeq[minl]]<<endl;
  		m--;
		minl++;
  		minn++;
	}
	return t;
}

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