Submission #763862

#TimeUsernameProblemLanguageResultExecution timeMemory
763862SanguineChameleonGondola (IOI14_gondola)C++17
20 / 100
24 ms4864 KiB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
	set<int> s;
	for (int i = 0; i < n; i++) {
		s.insert(inputSeq[i]);
	}
	if ((int)s.size() != n) {
		return 0;
	}
	int off = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			off = (i + n - inputSeq[i] + 1) % n;
			break;
		}
	}
	if (off != -1) {
		for (int i = 0; i < n; i++) {
			if (inputSeq[(i + off) % n] <= n && inputSeq[(i + off) % n] != 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...