제출 #164602

#제출 시각아이디문제언어결과실행 시간메모리
164602cfalas곤돌라 (IOI14_gondola)C++14
0 / 100
2 ms380 KiB
#include "gondola.h"

int valid(int n, int a[]){
	int cnt=0;
	for(int i=0;i<n;i++){
		if(a[i]!=a[i-1]+1) cnt++;

	}
	return (cnt<=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...