Submission #1302922

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302922		Faggi	Gondola (IOI14_gondola)	C++20	75 / 100	37 ms	6100 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

const int MAXN = 2e5 + 10;

map<ll,bool> ap;

int valid(int n, int inputSeq[])
{
    ll in = -1, i, x, sig;
    for (i = 0; i < n; i++)
    {
        if(ap[inputSeq[i]])
            return 0;
        ap[inputSeq[i]]=1;
        if (inputSeq[i] <= n)
        {
            in = i;
            x = inputSeq[i];
        }
    }
    if (in == -1)
        return 1;
    i = (in + 1) % n;
    sig = (x + 1) % (n + 1);
    if (sig == 0)
        sig = 1;
    while (i != in)
    {
        if (inputSeq[i] <= n && sig != inputSeq[i])
            return 0;
        i = (i + 1) % n;
        sig = (sig + 1) % (n + 1);
        if (sig == 0)
            sig = 1;
    }
    return 1;
}
//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    ll in = -1, i, j = 0, act = n + 1, x;
    vector<pair<ll, ll>> v;
    vector<ll> val(n);
    for (i = 0; i < n; i++)
    {
        if (gondolaSeq[i] <= n)
        {
            in = i;
            x = gondolaSeq[i];
            break;
        }
    }
    if (in == -1)
    {
        for (i = 0; i < n; i++)
            val[i] = i + 1;
    }
    else
    {
        val[in] = x;
        i = in;
        i = (i + 1) % n;
        x = (x + 1) % (n + 1);
        if (x == 0)
            x++;
        while (i != in)
        {
            val[i]=x;
            i = (i + 1) % n;
            x = (x + 1) % (n + 1);
            if (x == 0)
                x++;
        }
    }
    for (i = 0; i < n; i++)
    {
        if (gondolaSeq[i] > n)
        {
            v.pb({gondolaSeq[i], val[i]});
        }
    }
    sort(all(v));
    reverse(all(v));
    while (sz(v) > 1)
    {
        if (v.back().fr > act)
        {
            replacementSeq[j] = v[0].se;
            j++;
            v[0].se = act;
            act++;
        }
        else
        {
            replacementSeq[j] = v.back().se;
            act++;
            j++;
            v.pop_back();
        }
    }
    if (sz(v))
    {
        while (act <= v[0].fr)
        {
            replacementSeq[j] = v[0].se;
            v[0].se = act;
            act++;
            j++;
        }
    }
    return j;
}

//----------------------

const ll MOD=1e9+9;
const ll LOG=20;
ll binpow(ll a, ll b)
{
    ll ans=1,act=a, i;
    for(i=0; i<LOG; i++)
    {
        if((1<<i)&b)
            ans=(1ll*ans*act)%MOD;
        act=(1ll*act*act)%MOD;
    }
    return ans;
}

int countReplacement(int n, int inputSeq[])
{
    if(!valid(n,inputSeq))
        return 0;
    vector<ll>v;
    ll i, x, y, ans=1, ant=n, fact=1;
    for(i=0; i<n; i++)
        if(inputSeq[i]>n)
            v.pb(inputSeq[i]);
    sort(all(v));
    if(sz(v)<=1)
        return 1;
    for(i=0; i<sz(v); i++)
    {
        x=v[i]-ant-1;
        ant=v[i];
        y=sz(v)-i;
        ans=(1ll*ans*binpow(y,x))%MOD;
    }
    for(i=2; i<=n; i++)
        fact=(1ll*fact*i)%MOD;
    if(sz(v)==n)
        ans=(1ll*ans*fact)%MOD;
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10