# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52976 | zetapi | 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;
#define ll long long
#define pb push_back
#define mp make_pair
#define itr ::iterator
int valid(int n, int inputSeq[])
{
return -1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
int cnt=0;
vector<int> vec;
for(int A=0;A<n;A++)
vec.pb(inputSeq[A]);
sort(vec.begin(),vec.end());
for(int A=0;A<vec.size();A++)
if(vec[A]==vec[A-1])
return 0;
for(int A=0;A<vec.size();A++)
if(vec[A]>n)
cnt++;
if(cnt==1 or cnt==3)
return 1;
for(int A=0;A<n;A++)
{
if(inputSeq[A]<=n)
continue;
for(int B=A+1;B<n;B++)
{
if(inputSeq[B]<=n)
continue;
else if(inputSeq[A]<inputSeq[B] or vec.back()-N<3)
return 1;
else
return 2;
}
}
return 2;
}
/*int main()
{
int n,inputSeq[]={1,2,6,7};
cout<<countReplacement(4,inputSeq);
return 0;
}*/