Submission #297926

#TimeUsernameProblemLanguageResultExecution timeMemory
297926mieszko11bGondola (IOI14_gondola)C++14
20 / 100
57 ms5496 KiB
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[]) {
	vector<int> S(n);
	for(int i = 0 ; i < n ; i++)
		S[i] = inputSeq[i];
		
	set<int> hlp;
	for(int x : S) {
		if(hlp.count(x))
			return 0;
		hlp.insert(x);
	}
	
	for(int i = 0 ; i < n ; i++) {
		if(S[i] <= n) {
			rotate(S.begin(), S.begin() + (i - S[i] + 1 + n) % n, S.end());
			break;
		}
	}
	
	for(int i = 0 ; i < n ; i++)
		if(S[i] <= n && S[i] != i + 1)
			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...