| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 8888 | ho94949 | Gondola (IOI14_gondola) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[]){
bool x[250000];
memset(x,sizeof(x),0);
int firstoffset=-1;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
if(firstoffset==-1)
firstoffset=(inputSeq[i]-i+n)%n;
else
if(firstoffset!=(inputSeq[i]-i+n)%n)
return 0;
}else{
if(x[i]) return 0;
x[i]=true;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return -2;
}
int countReplacement(int n, int inputSeq[]){
return -3;
}