oj.uz

Submission #782360

# Submission time Handle Problem Language Result Execution time Memory
782360 2023-07-13T21:02:13 Z sofija6 Gondola (IOI14_gondola) C++14
100 / 100
 73 ms 10472 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[35];
    a[0]=n;
    for (int i=1;i<30;i++)
        a[i]=(a[i-1]*a[i-1])%MOD;
    long long ans=1,cur=29;
    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)
    {
        ans=(ans*Calc(num,i-prev))%MOD;
        prev=i+1;
        num--;
    }
    if (x)
        ans=(ans*n)%MOD;
    return (int)ans;
}

Subtask #1
5.0 / 5.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 12 ms 2220 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 23 ms 3832 KB Output is correct
9 Correct 7 ms 1452 KB Output is correct
10 Correct 26 ms 4440 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 11 ms 2132 KB Output is correct
7 Correct 9 ms 596 KB Output is correct
8 Correct 21 ms 3920 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 26 ms 4496 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 13 ms 2004 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 32 ms 4612 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 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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 2 ms 2260 KB Output is correct
3 Correct 1 ms 2200 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 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 2 ms 2260 KB Output is correct
10 Correct 2 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 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 12 ms 2852 KB Output is correct
12 Correct 9 ms 2796 KB Output is correct
13 Correct 11 ms 3176 KB Output is correct
14 Correct 9 ms 2776 KB Output is correct
15 Correct 16 ms 3960 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #8
15.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #9
15.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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 48 ms 7088 KB Output is correct
10 Correct 36 ms 5708 KB Output is correct
11 Correct 15 ms 2580 KB Output is correct
12 Correct 22 ms 3104 KB Output is correct
13 Correct 4 ms 980 KB Output is correct

Subtask #10
10.0 / 10.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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 50 ms 7116 KB Output is correct
10 Correct 45 ms 5796 KB Output is correct
11 Correct 14 ms 2644 KB Output is correct
12 Correct 18 ms 3100 KB Output is correct
13 Correct 4 ms 956 KB Output is correct
14 Correct 67 ms 9292 KB Output is correct
15 Correct 73 ms 10472 KB Output is correct
16 Correct 13 ms 2132 KB Output is correct
17 Correct 46 ms 7144 KB Output is correct
18 Correct 34 ms 4032 KB Output is correct