oj.uz

Submission #782337

# Submission time Handle Problem Language Result Execution time Memory
782337 2023-07-13T20:16:32 Z sofija6 Gondola (IOI14_gondola) C++14
60 / 100
 30 ms 4688 KB 
#include <bits/stdc++.h>
#include "gondola.h"
#define MAXN 250010
#define MOD 1000000009
using namespace std;
int x;
int valid(int n, int inputSeq[])
{
    int pos=-1,cnt=n,cur;
    set<int> s;
    for (int i=0;i<n;i++)
    {
        if (s.count(inputSeq[i]))
            return 0;
        s.insert(inputSeq[i]);
        if (inputSeq[i]<=n)
            pos=i;
    }
    if (pos==-1)
    {
        x=1;
        return 1;
    }
    cur=inputSeq[pos];
    while (cnt--)
    {
        if (inputSeq[pos]<=n && inputSeq[pos]!=cur)
            return 0;
        cur++;
        pos++;
        if (pos>=n)
            pos=0;
        if (cur>n)
            cur=1;
    }
    return 1;
}
int Calc(long long n,long long k)
{
    long long a[70];
    a[0]=n;
    for (int i=1;i<61;i++)
        a[i]=(a[i-1]*a[i-1])%MOD;
    long long ans=1,cur=59;
    while (k)
    {
        if ((1ll<<cur)<=k)
        {
            k-=(1ll<<cur);
            ans=(ans*a[cur])%MOD;
        }
        cur--;
    }
    return (int)ans;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int maxx=n,fixed[MAXN]={0},pos=0,realval[MAXN],s=-1;
    for (int i=1;i<=n;i++)
        realval[i]=i;
    for (int i=0;i<n;i++)
    {
        if (gondolaSeq[i]>n)
            fixed[gondolaSeq[i]]=i+1;
        else
            s=i+1;
        if (gondolaSeq[i]>maxx)
        {
            maxx=max(maxx,gondolaSeq[i]);
            pos=i+1;
        }
    }
    if (s!=-1)
    {
        int cur=gondolaSeq[s-1],cnt=n;
        while (cnt--)
        {
            realval[s]=cur;
            s++;
            cur++;
            if (s>n)
                s=1;
            if (cur>n)
                cur=1;
        }
    }
    int lastt=realval[pos];
    for (int i=n+1;i<=maxx;i++)
    {
        if (fixed[i])
            replacementSeq[i-n-1]=fixed[i]==pos?lastt : realval[fixed[i]];
        else
        {
            replacementSeq[i-n-1]=lastt;
            lastt=i;
        }
    }
    return maxx-n;
}

int countReplacement(int n, int inputSeq[])
{
    set<int> s;
    for (int i=0;i<n;i++)
    {
        if (inputSeq[i]>n)
            s.insert(inputSeq[i]);
    }
    if (!valid(n,inputSeq))
        return 0;
    long long ans=1;
    int prev=n+1,num=s.size();
    for (auto i : s)
    {
        if (i-prev>0)
            ans=(ans*Calc(num,i-prev))%MOD;
        prev=i;
        num--;
    }
    if (x)
    {
        for (int i=1;i<=n;i++)
            ans=(ans*i)%MOD;
    }
    return (int)ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2316 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 21 ms 4044 KB Output is correct
9 Correct 6 ms 1472 KB Output is correct
10 Correct 24 ms 4608 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 10 ms 2280 KB Output is correct
7 Correct 6 ms 772 KB Output is correct
8 Correct 19 ms 4012 KB Output is correct
9 Correct 6 ms 1492 KB Output is correct
10 Correct 24 ms 4568 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 2132 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 30 ms 4688 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 6 ms 2516 KB Output is correct
12 Correct 7 ms 2536 KB Output is correct
13 Correct 9 ms 3028 KB Output is correct
14 Correct 6 ms 2552 KB Output is correct
15 Correct 14 ms 4056 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -