Submission #1017826

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017826		simona1230	Gondola (IOI14_gondola)	C++17	75 / 100	52 ms	8152 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const long long mod=1e9+9;

long long mult(long long x,long long p)
{
    if(p==0)return 1;
    if(p==1)return x;
    long long half=mult(x,p/2);
    if(p%2==0)return (half*half)%mod;
    return (((half*half)%mod)*x)%mod;
}
int n;
long long a[100001];
map<long long,long long> mp;
bool check()
{
    mp.clear();
    long long idx=-1;
    for(int i=0; i<n; i++)
    {
        if(mp[a[i]])return 0;
        mp[a[i]]++;
        if(a[i]<=n)
        {
            idx=i;
        }
    }
    if(idx==-1)return 1;

    long long curr=a[idx];
    for(int i=idx; i<n; i++)
    {
        if(a[i]<=n&&a[i]!=curr)return 0;
        curr++;
        if(curr==n+1)curr=1;
    }

    for(int i=0; i<idx; i++)
    {
        if(a[i]<=n&&a[i]!=curr)return 0;
        curr++;
        if(curr==n+1)curr=1;
    }
    return 1;
}

int valid(int N, int inputSeq[])
{
    n=N;
    for(int i=0; i<n; i++)
        a[i]=inputSeq[i];
    //cout<<check()<<endl;
    return check();
}

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


int req[100001];
void needed()
{
    int idx=-1;
    for(int i=0; i<n; i++)
    {
        if(a[i]<=n)
        {
            idx=i;
        }
    }
    if(idx==-1)
    {
        for(int i=0; i<n; i++)
            req[i]=i+1;
        return;
    }

    int curr=a[idx];
    for(int i=idx; i<n; i++)
    {
        req[i]=curr;
        curr++;
        if(curr==n+1)curr=1;
    }

    for(int i=0; i<idx; i++)
    {
        req[i]=curr;
        curr++;
        if(curr==n+1)curr=1;
    }
}

bool cmp(int i,int j)
{
    return a[i]<a[j];
}

int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    n=N;
    for(int i=0; i<n; i++)
        a[i]=gondolaSeq[i];
    needed();
    vector<int> v;
    for(int i=0; i<n; i++)
    {
        if(a[i]!=req[i])v.push_back(i);
    }
    sort(v.begin(),v.end(),cmp);

    /*for(int i=0;i<n;i++)
        cout<<req[i]<<" ";
    cout<<endl;*/
    int all=n+1;
    int cnt=0;
    for(int i=0; i<v.size(); i++)
    {
        int idx=v[i];
        //cout<<req[idx]<<endl;
        while(req[idx]!=a[idx])
        {
            replacementSeq[cnt++]=req[idx];
            req[idx]=all++;
        }
    }
    return cnt;
}

//----------------------
int countReplacement(int N, int inputSeq[])
{
    n=N;
    for(int i=0; i<n; i++)
        a[i]=inputSeq[i];
    if(check()==0)return 0;
    needed();
    vector<long long> v;
    mp.clear();
    long long maxx=n+1;
    for(int i=0; i<n; i++)
    {
        mp[a[i]]=i;
        maxx=min(maxx,a[i]);
        if(a[i]!=req[i])v.push_back(i);
        if(req[i]==n)mp[n]=i;
    }
    sort(v.begin(),v.end(),cmp);
    long long ans=1;
    long long last=n;
    for(int i=0; i<v.size(); i++)
    {
        long long pos=v.size()-i;
        long long cnt=a[v[i]]-last-1;
        //cout<<last<<" "<<a[v[i]]<<" "<<pos<<" "<<cnt<<endl;
        ans=(ans*mult(pos,cnt))%mod;
        last=a[v[i]];
    }

    if(v.size()==n)
    {
        for(int i=1; i<=n; i++)
        {
            ans=(ans*i)%mod;
        }
    }

    return (int)ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:118:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     for(int i=0; i<v.size(); i++)
      |                  ~^~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:152:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for(int i=0; i<v.size(); i++)
      |                  ~^~~~~~~~~
gondola.cpp:161:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  161 |     if(v.size()==n)
      |        ~~~~~~~~^~~

• 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