# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68815 | Vahan | Gondola (IOI14_gondola) | C++17 | 44 ms | 8168 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<vector>
#include<algorithm>
#include<iostream>
using namespace std;
long long x[200000],xx[200000],a[200000];
long long mod=1000000009;
vector<long long> g;
int valid(int n, int inputSeq[])
{
vector<long long> v;
for(long long i=0;i<n;i++)
xx[i]=inputSeq[i];
sort(xx,xx+n);
long long t=0;
for(long long i=1;i<n;i++)
if(xx[i]==xx[i-1])
{
t=1;
break;
}
if(t==1)
return 0;
for(long long i=0;i<n;i++)
{
if(inputSeq[i]<=n)
{
v.push_back(inputSeq[i]);
x[inputSeq[i]]=i;
}
}
t=0;
for(long long i=1;i<v.size();i++)
{
if(v[i-1]>v[i])
t++;
}
if(t>=2)
return 0;
if(t==1 && v.back()>v[0])
return 0;
t=0;
for(long long i=1;i<v.size();i++)
{
if(v[i-1]<v[i])
{
if(v[i]-v[i-1]!=x[v[i]]-x[v[i-1]])
{
t=1;
break;
}
}
else if(v[i-1]>v[i])
{
if((n-(v[i-1]-v[i]))!=x[v[i]]-x[v[i-1]])
{
t=1;
break;
}
}
}
if(t==1)
return 0;
return 1;
}
long long binpow(long long a,long long b)
{
if(b==0)
return 1;
if(b%2==0)
{
long long c=binpow(a,b/2);
return (c*c)%mod;
}
else
{
long long c=binpow(a,b/2);
return (a*((c*c)%mod))%mod;
}
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
vector<pair<int,int> >v;
for(int i=0;i<n;i++)
{
if(gondolaSeq[i]<=n)
{
a[i]=gondolaSeq[i];
for(int j=i+1;j<n;j++)
{
a[j]=a[j-1]+1;
a[j]%=n;
if(a[j]==0)
a[j]=n;
}
for(int j=i-1;j>=0;j--)
{
a[j]=a[j+1]-1;
a[j]%=n;
if(a[j]==0)
a[j]=n;
}
break;
}
}
if(a[0]==0)
for(int i=0;i<n;i++)
a[i]=i+1;
for(int i=0;i<n;i++)
if(gondolaSeq[i]>n)
v.push_back({gondolaSeq[i],i});
sort(v.begin(),v.end());
int t=0;
for(int i=0;i<v.size();i++)
{
int u;
replacementSeq[t++]=a[v[i].second];
if(i==0)
u=n+1;
else
u=v[i-1].first+1;
for(int j=u;j<v[i].first;j++)
replacementSeq[t++]=j;
}
return t;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
if(valid(n,inputSeq)==0)
return 0;
for(long long i=0;i<n;i++)
{
if(inputSeq[i]>n)
g.push_back(inputSeq[i]);
}
sort(g.begin(),g.end());
long long k=g.size();
long long pat=1;
for(long long i=0;i<g.size();i++)
{
long long u;
if(i==0)
u=g[i]-n-1;
else
u=g[i]-g[i-1]-1;
pat*=binpow(k,u);
pat%=mod;
k--;
}
if(g.size()==n)
pat*=n;
pat%=mod;
return pat;
}
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... |