oj.uz

Submission #782325

# Submission time Handle Problem Language Result Execution time Memory
782325 2023-07-13T19:49:50 Z sofija6 Gondola (IOI14_gondola) C++14
55 / 100
 33 ms 4564 KB 
#include <bits/stdc++.h>
#include "gondola.h"
#define MAXN 250010
using namespace std;
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)
        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 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[])
{
  return -3;
}

Subtask #1
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 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

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 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 10 ms 2132 KB Output is correct
7 Correct 6 ms 584 KB Output is correct
8 Correct 20 ms 3932 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 24 ms 4436 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 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 10 ms 2132 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 21 ms 3924 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 25 ms 4480 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 2012 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 33 ms 4564 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2188 KB Output is correct
2 Correct 1 ms 2224 KB Output is correct
3 Correct 1 ms 2224 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 2228 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 2 ms 2224 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 2 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 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 1 ms 2260 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 7 ms 2992 KB Output is correct
12 Correct 8 ms 3028 KB Output is correct
13 Correct 9 ms 3256 KB Output is correct
14 Correct 8 ms 2932 KB Output is correct
15 Correct 20 ms 4096 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -