oj.uz

답안 #230325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
230325 2020-05-09T14:27:14 Z jhtan 곤돌라 (IOI14_gondola) C++14
25 / 100
 23 ms 640 KB 
#include "gondola.h"

int valid(int n, int inputSeq[])
{
  // subtask 1 and 2 and 3, 20 points
  int r = 1;
  for(int i=1; i<n; i++) {
    if(inputSeq[i] == 1 && inputSeq[i-1] != n) {
      r = 0;
      break;
    }
    if(inputSeq[i] != 1 && inputSeq[i-1] + 1 != inputSeq[i]) {
      r = 0;
      break;
    }
  }

  if(inputSeq[0] != 1 && inputSeq[n-1] + 1 != inputSeq[0]) r = 0;

  return r;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  // subtask 4, 5 points
  int l = 0;
  for(int i=0; i<n; i++)
    if(gondolaSeq[i] > n) {
      l = 1;
      if(i == 0) {
        if(gondolaSeq[1] == 1) replacementSeq[0] = n;
        else replacementSeq[0] = gondolaSeq[1] - 1;
      } else {
        if(gondolaSeq[i-1] == n) replacementSeq[0] = 1;
        else replacementSeq[0] = gondolaSeq[i-1] + 1;
      }
      break;
    }

  return l;
}

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

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 17 ms 640 KB Output is correct
8 Correct 14 ms 640 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 15 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 11 ms 512 KB Output is correct
7 Correct 17 ms 640 KB Output is correct
8 Correct 18 ms 616 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 16 ms 640 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 23 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 464 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 360 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 5 ms 320 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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