oj.uz

Submission #782320

# Submission time Handle Problem Language Result Execution time Memory
782320 2023-07-13T19:29:47 Z sofija6 Gondola (IOI14_gondola) C++14
20 / 100
 31 ms 5188 KB 
#include <bits/stdc++.h>
#include "gondola.h"
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[])
{
  return -2;
}

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

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 1 ms 312 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 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 2392 KB Output is correct
7 Correct 7 ms 1088 KB Output is correct
8 Correct 20 ms 4292 KB Output is correct
9 Correct 7 ms 1592 KB Output is correct
10 Correct 24 ms 4912 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 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 11 ms 2388 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 20 ms 4272 KB Output is correct
9 Correct 6 ms 1580 KB Output is correct
10 Correct 25 ms 4976 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 14 ms 2260 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 31 ms 5188 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 0 ms 212 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 0 ms 212 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 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 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 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 -