제출 #261229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261229		A02	곤돌라 (IOI14_gondola)	C++14	10 / 100	14 ms	1788 KiB

gondola

#include "gondola.h"
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>

using namespace std;

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

    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;
        }
    }

    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;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10