제출 #230294

#제출 시각아이디문제언어결과실행 시간메모리
230294Amy313곤돌라 (IOI14_gondola)C++14
20 / 100
22 ms640 KiB
#include "gondola.h"

int valid(int n, int inputSeq[])
{
  int r = 1;
  for(int i=1; i<n; i++)
  {
  	if(inputSeq[i]==1 and inputSeq[i-1]!=n)
	{
		r =0;
		break;
	}
	if(inputSeq[i]!=1 and inputSeq[i-1]+1!=inputSeq[i])
	{
		r = 0;
		break;
	}
  }
  if(inputSeq[0]!=1 and inputSeq[n-1]+1!=inputSeq[0])
  {
  	r=0;
  }
  return r;
}

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

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...