# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230315 | DanerZein | 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 "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
set<int>s;
int x=inputSeq[0];
s.insert(inputSeq[0]);
for(int i=1;i<n;i++){
s.insert(inputSeq[i]);
if(x==n){
if(inputSeq[i]==1){
x=1;
}
else return 0;
}
else{
if(x==inputSeq[i]-1){
x=inputSeq[i];
}
else return 0;
}
}
if(s.size()!=n) return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int id=-1,idaux=-1;
for(int i=0;i<n;i++){
if(gondolaSeq[i]==1){
id=i;
break;
}
if(gondolaSeq[i]==2){
idaux=i;
break;
}
}
int na=1;
if(id==-1){
idaux=id;
na=2;
}
int l=0,a=0;;
for(int i=0;i<n;i++){
if(gondolaSeq[i]>n){
replacemntSeq[a]=na;
a++;
l++;
}
id++;
na++;
if(id==n) id=0;
if(na>n) na=1;
}
return l;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}