# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521130 | krit3379 | 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>
using namespace std;
#define N 100005
vector<int> v;
map<int,int> mp;
int valid(int n,int arr[N]){
int i,mi=2e9,st=2e9,nxt,sz;
for(i=0;i<n;i++){
if(arr[i]<=n){
v.push_back(i);
if(mi>arr[i])mi=arr[i],st=i;
}
else{
if(!mp.count(arr[i]))mp[arr[i]];
else return 0;
}
}
if(st==2e9)return 1;
sz=v.size();
for(i=st;i!=(st-1+sz)%sz;i=nxt){
nxt=(i+1)%sz;
if((v[nxt]-v[i]+n)%n!=abs(arr[v[nxt]]-arr[v[n]]))return 0;
}
return 1;
}