# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547232 | Hanksburger | Gondola (IOI14_gondola) | C++17 | 27 ms | 4516 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 long long mod=1000000009;
long long sorted[100005], pos[250005];
vector<long long> vec;
long long power(long long a, long long b)
{
if (!b)
return 1;
long long res=power(a, b/2);
if (b&1)
return res*res%mod*a%mod;
else
return res*res%mod;
}
int valid(int n, int a[])
{
for (int i=0; i<n; i++)
sorted[i]=a[i];
sort(sorted, sorted+n);
for (int i=1; i<n; i++)
if (sorted[i-1]==sorted[i])
return 0;
for (int i=0; i<n; i++)
{
if (a[i]<=n)
{
for (int j=i+1; j<i+n; j++)
if (a[j%n]<=n && a[j%n]!=(a[i]+j-i-1)%n+1)
return 0;
return 1;
}
}
return 1;
}
int replacement(int n, int a[], int b[])
{
int num=1, maxi=n;
for (int i=0; i<n; i++)
{
if (a[i]<=n)
{
num=(n+a[i]-i-1)%n+1;
break;
}
}
for (int i=0; i<n; i++)
{
maxi=max(maxi, a[i]);
pos[a[i]]=i+1;
}
for (int i=n+1; i<=maxi; i++)
{
int index=i;
while (!pos[i])
i++;
vec.push_back((num+pos[i]-2)%n+1);
for (int j=index; j<i; j++)
vec.push_back(j);
}
for (int i=0; i<vec.size(); i++)
b[i]=vec[i];
return vec.size();
}
int countReplacement(int n, int a[])
{
if (!valid(n, a))
return 0;
long long num=0, ans=1;
for (long long i=0; i<n; i++)
{
if (a[i]<=n)
{
num=(n+a[i]-i-1)%n+1;
break;
}
}
if (!num)
{
ans=n;
num=1;
}
vec.push_back(n);
for (long long i=0; i<n; i++)
if (a[i]>n)
vec.push_back(a[i]);
sort(vec.begin(), vec.end());
for (long long i=1; i<vec.size(); i++)
ans=(ans*power(vec.size()-i, vec[i]-vec[i-1]-1))%mod;
return ans;
}
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... |