oj.uz

답안 #194138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
194138 2020-01-15T20:06:16 Z oscarsierra12 곤돌라 (IOI14_gondola) C++14
20 / 100
 56 ms 5616 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std ;
int valid(int n, int inputSeq[])
{
  int x = min_element ( inputSeq, inputSeq+n ) - inputSeq ;
  vector <int> nwSeq ;
  set <int> rep ;
  for ( int i = x ; i < n ; ++i ) nwSeq.push_back ( inputSeq[i] ), rep.insert ( inputSeq[i] ) ;
  for ( int i = 0 ; i < x ; ++i ) nwSeq.push_back ( inputSeq[i] ), rep.insert ( inputSeq[i] ) ;
  int expected = inputSeq[x] ;
  int posible = ( rep.size()==n ) ;
  for ( int i = 0 ; i < n ; ++i ) {
    if ( nwSeq[i] <= n ) {
        if ( nwSeq[i] != expected ) posible = 0 ;
        expected = nwSeq[i]+1 ;
    }
    else expected++ ;
  }
  return posible;
}

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

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:12:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   int posible = ( rep.size()==n ) ;
                   ~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 16 ms 2420 KB Output is correct
7 Correct 41 ms 4080 KB Output is correct
8 Correct 33 ms 4212 KB Output is correct
9 Correct 10 ms 1656 KB Output is correct
10 Correct 39 ms 4848 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2420 KB Output is correct
7 Correct 40 ms 3952 KB Output is correct
8 Correct 33 ms 4212 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 39 ms 4948 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 31 ms 2552 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 56 ms 5616 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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