oj.uz

Submission #603986

# Submission time Handle Problem Language Result Execution time Memory
603986 2022-07-24T14:32:35 Z daisy2 Gondola (IOI14_gondola) C++14
20 / 100
 9 ms 1132 KB 
#include "gondola.h"
#include <iostream>
using namespace std;
bool b[200005];
int valid(int n, int inputSeq[])
{
    bool is=1;
    int prin=-1;

    for(int i=0;i<n;i++)
    {
        if(b[inputSeq[i]])
        {
            is=0;break;
        }
        b[inputSeq[i]]=1;


        if(inputSeq[i]<=n)
        {
            if(prin!=-1 && ((inputSeq[i]+n-inputSeq[prin])%n!=(i-prin)%n))
            {
                is=0;break;
            }
            prin=i;
        }
    }
  return is;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 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 1 ms 212 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 1 ms 212 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 9 ms 1132 KB Output is correct
8 Correct 7 ms 1000 KB Output is correct
9 Correct 3 ms 452 KB Output is correct
10 Correct 8 ms 1092 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 5 ms 700 KB Output is correct
7 Correct 8 ms 1128 KB Output is correct
8 Correct 8 ms 1008 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 9 ms 1128 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 8 ms 1132 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 1 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 1 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -