제출 #1275834

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

gondola

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

using namespace std;

int valid(int n, int inputSeqArray[])
{
  vector<int> inputSeq(n);
  for (int i=0; i<n; i++) inputSeq[i] = inputSeqArray[i];
  int mini = 1e9;
  int min_idx;
  for (int i=0; i<n; i++){
    if (inputSeq[i] < mini){
      mini = inputSeq[i];
      min_idx = i;
    }
  }
  int last = 0;
  for (int i=min_idx; i<n; i++){
    if (inputSeq[i] <= n){
      if (inputSeq[i] <= last) return false;
      last = inputSeq[i];
    }
  }
  for (int i=0; i<min_idx; i++){
    if (inputSeq[i] <= n){
      if (inputSeq[i] <= last) return false;
      last = inputSeq[i];
    }
  }

  sort(inputSeq.begin(), inputSeq.end());
  for (int i=1; i<n; i++){
    if (inputSeq[i] == inputSeq[i-1]) return false;
  }
  return true;
}

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

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