oj.uz

답안 #138686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138686 2019-07-30T08:33:10 Z zoooma13 곤돌라 (IOI14_gondola) C++14
20 / 100
 51 ms 4624 KB 
#include "bits/stdc++.h"
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
    int mi_idx = min_element(inputSeq ,inputSeq+n)-inputSeq;
    set <int> ss;
    for(int i=0; i<n; i++)
        ss.insert(inputSeq[i]);
    if(ss.size() != n)
        return 0;
    if(inputSeq[mi_idx] >= n)
        return 1;
    int nxt = inputSeq[mi_idx];
    for(int i=mi_idx; nxt<=n; i++){
        if(inputSeq[i%n] != nxt && inputSeq[i%n] <= n)
            return 0;
        nxt++;
    }
    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:10:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(ss.size() != n)
        ~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 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 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 376 KB Output is correct
6 Correct 16 ms 2268 KB Output is correct
7 Correct 37 ms 3676 KB Output is correct
8 Correct 28 ms 3960 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 35 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 17 ms 2268 KB Output is correct
7 Correct 37 ms 3704 KB Output is correct
8 Correct 28 ms 3876 KB Output is correct
9 Correct 10 ms 1656 KB Output is correct
10 Correct 36 ms 4472 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 404 KB Output is correct
13 Correct 21 ms 2168 KB Output is correct
14 Correct 2 ms 252 KB Output is correct
15 Correct 51 ms 4624 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 2 ms 256 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 256 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 376 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 1 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -