| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 209568 | Lukoloz | Gondola (IOI14_gondola) | C++14 | 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 <bits/stdc++.h>
#include "gondola.h"
#define ff first
#define ss second
#define pb push_back
#define MAXN 100005
using namespace std;
int valid(int n, int inputSeq[]){
bool fl[250005];
int tdif,dif=-1;
for (int i=0; i<250005; i++) fl[i]=0;
for (int i=0; i<n; i++){
if (fl[inputSeq[i]]) return 0;
fl[inputSeq[i]]=1;
if (inputSeq[i]<=n){
tdif=inputSeq[i]-1-i;
if (tdif<0) tdif+=n;
if (dif!=-1 && tdif!=dif) return 0;
dif=tdif;
}
}
return 1;
}
// int replacement(int n, int gondolaSeq[], int replacementSeq[]);
// int countReplacement(int n, int inputSeq[]);
// int main(){
// int n;
// cin>>n;
// int arr[n];
// for (int i=0; i<n; i++) cin>>arr[i];
// cout<<valid(n,arr)<<endl;
// }