# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494109 | 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 val = 0, pos = -1;
map<int, int> used;
for(int i = 0; i < n; i++)
{
if(gondolaSeq[i] <= n)
{
val = gondolaSeq[i];
it = i;
break;
}
}
vector<pair<int, int>> vec;
for (int i = 0; i < n; i++)
{
if (gondolaSeq[i] > n)
{
vec.push_back({gondolaSeq[i], i});
}
}
if(pos != -1)
{
for (int i = pos; i < n; i++)
{
gondolaSeq[i] = val++;
if (val > n)
{
val = 1;
}
}
for (int i = 0; i < pos; i++)
{
gondolaSeq[i] = val++;
if (val > n)
{
val = 1;
}
}
}
else
{
for (int i = 0; i < n; i++)
{
gondolaSeq[i] = i + 1;
}
}
sort(vec.begin(), vec.end());
int cur = n + 1, it = 0;
for (int i = 0; i < vec.size(); i++)
{
while (cur <= vec[i].first)
{
replacementSeq[it++] = gondolaSeq[vec[i].second];
gondolaSeq[vec[i].second] = cur++;
}
}
return it;
}
int countReplacement(int n, int inputSeq[])
{
return -3;
}