Submission #1147616

#TimeUsernameProblemLanguageResultExecution timeMemory
1147616ChuanChenGondola (IOI14_gondola)C++20
10 / 100
5 ms584 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
	int unchange = -1;
	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		unchange = i;
		break;
	}

	if(unchange == -1) return 0;
	int dif = inputSeq[unchange] - unchange;
	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		if((inputSeq[i]-i+n)%n != dif) 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...