# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494069 | ahmeteren | Gondola (IOI14_gondola) | C++17 | 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>
#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[])
{
int mn = 1e7, start = 0, it = 0;
vector<int> vec(n);
for(int i = 0; i < n; i++)
{
if(inputSeq[i] < mn)
{
mn = inputSeq[i];
start = i;
}
}
for(int i = start; i < start + n; i++)
{
vec[it] = inputSeq[i % n];
it++;
}
int cur = mn;
for(int i = 0; i < n; i++, cur++)
{
if(vec[i] > n)
continue;
if(vec[i] != cur)
{
return 0;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int mx = 0, it = 0;
map<int, int> used;
for(int i = 0; i < n; i++)
{
mx = max(mx, inputSeq[i]);
used[inputSeq[i]] = true;
}
for(int i = 1; i <= mx; i++)
{
if(!used[i])
{
replacementSeq[it] = i;
it++;
}
}
return it;
}
int countReplacement(int n, int inputSeq[])
{
return -3;
}