# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017737 | serkanrashid | Gondola (IOI14_gondola) | C++14 | 19 ms | 5788 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;
const int maxn = 1e5+5;
int n,a[maxn];
bool check_valid()
{
unordered_set<int>used;
int st = -1;
for(int i = 0; i < n; i++)
{
if(used.find(a[i])!=used.end()) return false;
used.insert(a[i]);
if(1<=a[i] && a[i] <= n) st = i;
}
if(st==-1) return true;
int last = a[st];
int i = (st+1)%n;
while(i!=st)
{
last++;
if(last>n) last = 1;
if(1<=a[i] && a[i]<=n)
{
if(last!=a[i]) return false;
}
i = (i+1)%n;
}
return true;
}
int valid(int N, int inputSeq[])
{
n = N;
for(int i = 0; i < n; i++) a[i] = inputSeq[i];
return check_valid();
}
int need[maxn];
void make_need()
{
int st = -1;
for(int i = 0; i < n; i++) if(1 <= a[i] && a[i] <= n) st = i;
if(st==-1)
{
for(int i = 0; i < n; i++) need[i] = i+1;
return;
}
int last = a[st];
int i = (st+1)%n;
while(i!=st)
{
last++;
if(last>n) last = 1;
need[i] = last;
i = (i+1)%n;
}
}
vector<int> do_replace()
{
int l = 0;
for(int i = 0; i < n; i++) if(a[i]>l) l = a[i];
l = l - n;
vector<pair<int,int> >pos;
for(int i = 0; i < n; i++) if(a[i]>n) pos.push_back({a[i],need[i]});
sort(pos.begin(),pos.end());
vector<int>res;
int last = n;
for(pair<int,int> nb : pos)
{
res.push_back(nb.second);
for(int j = last+1; j < nb.first; j++) res.push_back(j);
last = nb.first;
}
return res;
}
int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
n = N;
for(int i = 0; i < n; i++) a[i] = gondolaSeq[i];
make_need();
vector<int>pom = do_replace();
for(int i = 0; i < pom.size(); i++) replacementSeq[i] = pom[i];
return pom.size();
}
int countReplacement(int N, int inputSeq[])
{
n = N;
for(int i = 0; i < n; i++) a[i] = inputSeq[i];
if(!check_valid()) return 0;
///OSHTE
int maxch = 0;
for(int i = 0; i < n; i++) maxch = max(maxch,a[i]);
if(n+3!=maxch) return 1;
int ch1,ch2,br = 0;
ch1 = ch2 = 0;
for(int i = 0; i < n; i++)
{
if(a[i] > n)
{
br++;
ch1 = ch2;
ch2 = a[i];
}
}
if(ch1>ch2) swap(ch1,ch2);
if(br==2&&ch1==n+2&&ch2==n+3) return 2;
return 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |