oj.uz

Submission #638238

# Submission time Handle Problem Language Result Execution time Memory
638238 2022-09-05T05:25:01 Z Seb Gondola (IOI14_gondola) C++17
20 / 100
 17 ms 1816 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int valid(int n, int inputSeq[]) {
    ll i,mn=0,aux[n];
    bool resp=true;
    for (i=0;i<n;i++) {
        aux[i] = inputSeq[i];
        if (aux[mn]>aux[i]) mn = i;
    }
    sort(aux,aux+n);
    for (i=0;i<n-1;i++) if (aux[i]==aux[i+1]) return 0;
    for (i=mn;i<n;i++) if (inputSeq[i]<=n) {
        if (inputSeq[i]!=i-mn+1) resp = false;
    }
    for (i=0;i<mn;i++) if (inputSeq[i]<=n) {
        if (inputSeq[i]!=(n-mn)+i+1) resp = false;
    }
    if (resp==true) return 1;
    else return 0;
}

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

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 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 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 0 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 6 ms 960 KB Output is correct
7 Correct 16 ms 1816 KB Output is correct
8 Correct 16 ms 1444 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 13 ms 1764 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 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 17 ms 1732 KB Output is correct
8 Correct 13 ms 1468 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 14 ms 1748 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 14 ms 1772 KB Output is correct

Subtask #4
0 / 5.0

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