Submission #285517

#TimeUsernameProblemLanguageResultExecution timeMemory
285517emanIaicepsaGondola (IOI14_gondola)C++14
20 / 100
18 ms768 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
	for(int i=0;i<n;i++) inputSeq[i]--;
	vector<bool> used(250000);
	int pos0 = -1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n) pos0 = (i - inputSeq[i] + n) % n;
		if(used[inputSeq[i]]) return 0;
		used[inputSeq[i]] = 1;
	}
	if(pos0 == -1) return 1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n){
			if((pos0 + inputSeq[i]) % n != i) 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...