Submission #254505

#TimeUsernameProblemLanguageResultExecution timeMemory
254505b00n0rp곤돌라 (IOI14_gondola)C++17
20 / 100
16 ms1152 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
	for(int i = 0; i < n; i ++){
		// cout << i << " " << inputSeq[i] << " " << inputSeq[(i+1)%n] << endl;
		if(inputSeq[(i+1)%n]-inputSeq[i] != 1 and inputSeq[(i+1)%n]-inputSeq[i] != 1-n) 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...