# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134455 | reda | 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 endl '\n'
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MOD 1000000007
int occ[101];
bool valid(int n, vector<int>a)
{
for(int i=0;i<n;i++)
{
occ[a[i]]++;
}
for(int i=0;i<n;i++)
{
if(occ[a[i]]>1)return 0;
}
for(int i=1;i<n;i++)
{
if(a[i]>n && a[i]>a[i-1]+1)
return 0;
}
return 1;
}
int replacement( int n, vector<int>gondolaSeq, vector<int>replacementSeq);
int countReplacement(int n, vector<int>inputSeq);