oj.uz

Submission #261230

# Submission time Handle Problem Language Result Execution time Memory
261230 2020-08-11T15:05:15 Z A02 Gondola (IOI14_gondola) C++14
10 / 100
 16 ms 2428 KB 
#include "gondola.h"
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>

using namespace std;

int valid(int n, int inputSeq[])
{

    vector<int> occurences (250001, 0);

    vector<int> reduced_sequence;

    for (int i = 0; i < n; i++){
        if (inputSeq[i] <= n){
            reduced_sequence.push_back(inputSeq[i]);
            //cout << i << ' ' << reduced_sequence[i] << endl;
            occurences[inputSeq[i]]++;
        }
    }

    for (int i = 0; i < occurences.size(); i++){
        if (occurences[i] > 1){
            return 0;
        }
    }

    int lowest = distance(reduced_sequence.begin(), min_element(reduced_sequence.begin(), reduced_sequence.end()));

    //cout << lowest << endl;

    int k = reduced_sequence.size();

    for (int i = 0; i < k - 1; i++){
        if (reduced_sequence[(i + lowest) % k] >= reduced_sequence[(i + lowest + 1) % k]){
            //cout << i + lowest << endl;
            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:24:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < occurences.size(); i++){
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 7 ms 1792 KB Output is correct
7 Correct 15 ms 2300 KB Output is correct
8 Correct 13 ms 2172 KB Output is correct
9 Correct 5 ms 1664 KB Output is correct
10 Correct 16 ms 2428 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 7 ms 1792 KB Output is correct
7 Correct 15 ms 2300 KB Output is correct
8 Correct 13 ms 2172 KB Output is correct
9 Correct 5 ms 1664 KB Output is correct
10 Correct 15 ms 2300 KB Output is correct
11 Incorrect 1 ms 1280 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -