oj.uz

답안 #918311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918311 2024-01-29T15:26:16 Z contest_alt 곤돌라 (IOI14_gondola) C++17
10 / 100
 8 ms 1116 KB 
#include "gondola.h"

#include <algorithm>

int valid( int n, int inputSeq[] ) {
  int shift_min = n, shift_max = -1;
  
  for( int i = 0 ; i < n ; i++ ){
    if( inputSeq[i] > n )
      continue;

    int shift = (inputSeq[i] - 1 + n - i) % n;

    shift_min = std::min( shift_min, shift );
    shift_max = std::max( shift_max, shift );
  }
  
  return shift_min == shift_max;
}

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

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

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

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 432 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 3 ms 700 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 5 ms 604 KB Output is correct
7 Correct 8 ms 1116 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 7 ms 1116 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -