Submission #65269

#TimeUsernameProblemLanguageResultExecution timeMemory
65269gnoorGondola (IOI14_gondola)C++17
0 / 100
3 ms1096 KiB
#include "gondola.h"

#include <cmath>

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