제출 #65277

#제출 시각아이디문제언어결과실행 시간메모리
65277gnoorGondola (IOI14_gondola)C++17
10 / 100
21 ms916 KiB
#include "gondola.h"

#include <cmath>
#include <cstdio>

int valid(int n, int inputSeq[])
{
	int key=-1e9;
	int id=-1;
	int cur;
	for (int i=0;i<n;i++) {
		if (inputSeq[i]>n) continue;
		cur=i-inputSeq[i];
		if (id==-1) {
			key=cur;
			id=inputSeq[i];
		}
		if (inputSeq[i]<id) cur-=n;
		if (key!=cur) return 0;
	}
	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...