oj.uz

답안 #232070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232070 2020-05-16T00:21:48 Z anonymous 곤돌라 (IOI14_gondola) C++14
10 / 100
 18 ms 2044 KB 
#include "gondola.h"
#include <vector>
#include <iostream>
#define MAXN 100005
#define MAXV 250005
using namespace std;

int valid(int n, int inputSeq[])
{
  vector <int> Vals;
  bool b = true, has[MAXV]={};
  for (int i=0; i<n; i++) {
      if (inputSeq[i] <= n) {
            Vals.push_back(inputSeq[i]);
      }
      if (has[inputSeq[i]]) {return(0);}
      has[inputSeq[i]]=true;

  }
  for (int i=0; i<Vals.size(); i++) {
    if (Vals[i] > Vals[(i+1)%Vals.size()] && !b) {return(0);}
    b &= Vals[i] < Vals[(i+1)%Vals.size()] ;
  }
  return(1);
}

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

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

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<Vals.size(); i++) {
                 ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 18 ms 1408 KB Output is correct
8 Correct 16 ms 1916 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 18 ms 2044 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 18 ms 1408 KB Output is correct
8 Correct 16 ms 1916 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct
10 Correct 17 ms 2044 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Incorrect 5 ms 640 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 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 5 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 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -