Submission #470844

#TimeUsernameProblemLanguageResultExecution timeMemory
470844hibye1217Gondola (IOI14_gondola)C++17
20 / 100
11 ms1100 KiB
// Subtask 1

#ifndef NOTSUBMIT
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#endif // NOTSUBMIT

int valid(int n, int inputSeq[]){
	int st = 0;
	for (int i = 0; i < n; i++){ if (inputSeq[i] == 1){ st = i; } }
	for (int i = 0; i < n; i++){
		int p = (i+st) % n;
		if (inputSeq[p] != i+1){ return 0; }
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; }

int countReplacement(int n, int inputSeq[]){ return 0; }
#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...