Submission #1300463

#TimeUsernameProblemLanguageResultExecution timeMemory
1300463m.zeeshanrashidGondola (IOI14_gondola)C++20
10 / 100
6 ms1348 KiB
#include "gondola.h"
#include "bits/stdc++.h"
using namespace std;

int valid(int n, int seq[])
{
	vector<int>a(n,0);
	for(int i=0;i<n;i++){
		a[i]=i;
		if(seq[i]<=n){
			a[i]=seq[i]%n;
			for(int j=i-1;j>=0;j--) a[j]=(a[j+1]-1+n)%n;
			for(int j=i+1;j<n;j++){
				if(seq[j]<=n) a[j]=seq[j]%n;
				else a[j]=(a[j-1]+1)%n;
			}
			break;
		}
	}
	bool f=1;
	for(int i=1;i<n;i++){
		if(a[i]!=(a[i-1]+1)%n) f=0;
	}
	return f;
}

//----------------------

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...