제출 #285502

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

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
  set<int> uses, xs;
  for(int i = 0; i < n; i++)xs.insert(inputSeq[i]);
  if(*xs.begin() > n)return 1;
  rotate(inputSeq, find(inputSeq, inputSeq+n, *xs.begin()), inputSeq+n);
  assert(*xs.begin() == inputSeq[0]);
  if(*xs.begin() != 1) rotate(inputSeq, inputSeq+(n-*xs.begin()+1), inputSeq+n);
  for(int i = 0; i < n; i++)
    if(inputSeq[i] == i+1) continue;
    else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]);
  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