oj.uz

Submission #866622

# Submission time Handle Problem Language Result Execution time Memory
866622 2023-10-26T14:17:35 Z Onur_Ilgaz Gondola (IOI14_gondola) C++17
10 / 100
 7 ms 1116 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define inf INT_MAX

int valid(int n, int arr[])
{
  int ind = 0, mn = inf;
  for(int i = 0; i < n; i++) {
    if(arr[i] < mn) ind = i, mn = arr[i];
  }
  for(int i = (ind + 1) % n; i % n != ind; i = (i + 1) % n) {
    if(arr[i] <= n) {
      if(arr[i] < mn) {
        return 0;
      }
      mn = arr[i];
    }
  }
  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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 6 ms 1076 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 2 ms 452 KB Output is correct
10 Correct 7 ms 1112 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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