제출 #291530

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

gondola

#include<bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define ll long long
#define fi first
#define se second

int valid(int n, int inputSeq[]){
  int mi=1e9,pos=0;
  vector<int> k;
  for(int i=0;i<n;i++)k.push_back(inputSeq[i]);
  sort(k.begin(),k.end());
  for(int i=1;i<n;i++){
    if(k[i]==k[i-1])return 0;
  }

  for(int i=0;i<n;i++)k[i]=inputSeq[i];
  for(int i=0;i<n;i++){
    if(k[i]<mi){
      mi=k[i];
      pos=i;
    }
  }
  if(mi>n)return 1;
  int prec=-1;
  for(int i=pos;i<pos+n;i++){
    int x=i%n;
    if(k[x]>n)continue;
    if(k[x]<prec)return 0;
    prec=k[x];
  }
  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