| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 138752 | Mahmoud_Adel | Gondola (IOI14_gondola) | C++14 | 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 "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+5, mod = 1e9+9;
int mark[N], mep[N];
ll power(ll a, ll b)
{
if(!b) return 1;
ll temp = power(a, b/2);
temp = (temp*temp)%mod;
if(b%2) temp *= a, temp %= mod;
return temp;
}
int valid(int n, int inputSeq[])
{
for(int i=0; i<n; i++)
{
if(mark[inputSeq[i]]) return 0;
else mark[inputSeq[i]] = 1;
}
int j = -1;
for(int i=0; i<n; i++) if(inputSeq[i] > 0 && inputSeq[i] <= n) j = i;
if(j == -1) return 1;
for(int i=0; i<n; i++)
{
int id = (i+j)%n, jd = (i+j+1)%n;
if(inputSeq[jd] > n) inputSeq[jd] = inputSeq[id]%n + 1;
if(inputSeq[jd] != inputSeq[id]%n + 1) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int inputSeq[], int replacementSeq[])
{
memset(mep, 0, sizeof mep);
int j = -1, c = n;
for(int i=0; i<n; i++) if(inputSeq[i] <= n) j = i;
if(j == -1)
{
for(int i=0; i<n; i++) replacementSeq[inputSeq[i]-n-1] = i+1;
return n;
}
for(int i=0; i<n; i++)
{
int id = (i+j) % n, jd = (i+j+1) % n;
if(inputSeq[jd] > n) c = max(c, inputSeq[jd]),
mep[inputSeq[jd]] = inputSeq[id]%n + 1;
}
int last = -1;
for(int i=n+1; i<c; i++)
{
if(mep[i]) replacementSeq[i-n-1] = mep[i];
else replacementSeq[i-n-1] = mep[i-c-1], last = i;
}
if(last != -1) replacementSeq[c-n-1] = i;
else replacementSeq[c-n-1] = mep[c-n-1];
return c-n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
int tmp[n];
for(int i=0; i<n; i++) tmp[i] = inputSeq[i];
if(!valid(n, inputSeq)) return 0;
for(int i=0; i<n; i++) inputSeq[i] = tmp[i];
memset(mep, 0, sizeof mep);
ll j = -1, c = n;
for(int i=0; i<n; i++) if(inputSeq[i] <= n) j = i;
else vec.push_back(inputSeq[i]);
ll ans = 1;
sort(vec.begin(), vec.end());
for(int i=0; i<vec.size()-1; i++)
{
ll tmp = power((ll)vec.size()-i, vec[i+1]-vec[i-1]);
ans = (ans%mod * tmp%mod)%mod;
}
return (ans*(j==-1? n:1))%mod;
}