oj.uz

Submission #1017819

# Submission time Handle Problem Language Result Execution time Memory
1017819 2024-07-09T10:26:24 Z simona1230 Gondola (IOI14_gondola) C++17
75 / 100
 53 ms 6700 KB 
#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(maxx>n)
    {
        for(int i=1; i<n; i++)
        {
            ans=(ans*i)%mod;
        }
    }


    return (int)ans;
}

Compilation message

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++)
      |                  ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 3096 KB Output is correct
7 Correct 6 ms 1372 KB Output is correct
8 Correct 21 ms 5744 KB Output is correct
9 Correct 6 ms 2140 KB Output is correct
10 Correct 26 ms 6424 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 3056 KB Output is correct
7 Correct 6 ms 1372 KB Output is correct
8 Correct 22 ms 5688 KB Output is correct
9 Correct 6 ms 2140 KB Output is correct
10 Correct 27 ms 6440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 13 ms 2828 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 30 ms 6700 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 1628 KB Output is correct
12 Correct 6 ms 1624 KB Output is correct
13 Correct 11 ms 1764 KB Output is correct
14 Correct 5 ms 1624 KB Output is correct
15 Correct 13 ms 2580 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 53 ms 6696 KB Output is correct
10 Correct 38 ms 5716 KB Output is correct
11 Correct 14 ms 2396 KB Output is correct
12 Correct 18 ms 2652 KB Output is correct
13 Incorrect 4 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 51 ms 6656 KB Output is correct
10 Correct 38 ms 5540 KB Output is correct
11 Correct 17 ms 2396 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Incorrect 4 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -