# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160959 | InfiniteJest | 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 <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
int valid(int n, int inputSeq[]){
int ans=1;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
int val=inputSeq[i];
for(int y=0;y<n;y++){
if(inputSeq[i]<=n&&inputSeq[(i+y)%n]!=val){
ans=0;
break;
}
val++;
if(val==n+1)val=1;
}
break;
}
}
return ans;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
bool flag=0;
vector<pair<int,int> > p;
int ind=-1,val;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
ind=i;
val=inputSeq[i];
}
else flag=1;
}
if(!flag)return 0;
if(ind==-1){
ind=0;
val=1;
}
for(int i=0;i<n;i++){
if(inputSeq[(ind+i)%n]>n){
flag=1;
p.pb(mp(inputSeq[(ind+i)],val));
}
val++;
}
sort(p.begin(),p.end());
int cur=n+1;
int indtot=0;
for(int i=0;i<p.size();i++){
replacementSeq[indtot++]=p[i].se;
for(;cur<p[i].fi;cur++)replacementSeq[indtot++]=cur;
cur+=2;
}
}