| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1303903 | mlecio | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int N;
int valid(int n,int inputSeq[]){
N=n;
int ind=-1;
int mini=1e9;
for(int i=0;i<N;i++){
if(mini>inputSeq[i]){
ind=i;
mini=inputSeq[i];
}
}
if(mini>=n)
return 1;
for(int i=0;i<N;i++){
if(i<ind){
if(inputSeq[i]>n)
continue;
else if(inputSeq[i]==i+1+mini)
continue;
else
return 0;
}
if(i>=ind){
if(inputSeq[i]>n)
continue;
else if(inputSeq[i]==i-ind+mini)
continue;
else
return 0;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
int countReplacement(int n, int inputSeq[]);
