oj.uz

답안 #107700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107700 2019-04-25T13:40:14 Z FiloSanza 곤돌라 (IOI14_gondola) C++14
20 / 100
 50 ms 4984 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int N, int inputSeq[])
{
    vector<int> v, s;
    v.reserve(N);
    for(int i=0; i<N; i++) 
        if(inputSeq[i] <= N)
            v.push_back(inputSeq[i]);
        else
            s.push_back(inputSeq[i]);

    sort(s.begin(), s.end());
    for(int i=1; i<s.size(); i++) if(s[i-1] == s[i]) return 0;
    if(!s.empty() && s.back() > N + s.size()) return 0;

    int mini = min_element(v.begin(), v.end()) - v.begin();

    map<int, int> cont;
    for(auto i : v) cont[i]++;

    for(auto i : cont) if(i.second > 1) return 0;

    for(int i=mini+1; i!=mini; i=(i+1)%v.size()){
        if(i == 0 && v.back() >= v.front()) return 0;
        if(v[i] <= v[i-1]) return 0;
    }

    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:17:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<s.size(); i++) if(s[i-1] == s[i]) return 0;
                  ~^~~~~~~~~
gondola.cpp:18:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(!s.empty() && s.back() > N + s.size()) return 0;
                      ~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 304 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 356 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 17 ms 2432 KB Output is correct
7 Correct 50 ms 4088 KB Output is correct
8 Correct 44 ms 4216 KB Output is correct
9 Correct 11 ms 1572 KB Output is correct
10 Correct 38 ms 4856 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 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 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 17 ms 2432 KB Output is correct
7 Correct 36 ms 4088 KB Output is correct
8 Correct 28 ms 4216 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 43 ms 4984 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 11 ms 1108 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 19 ms 1664 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #10
0 / 10.0

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