제출 #259835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259835		srj	Gondola (IOI14_gondola)	C++14	10 / 100	40 ms	5368 KiB

gondola

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

int valid(int n, int inputSeq[])
{
	map<int,int> pos;
  for(int i =0;i<n;i++){
  		if(inputSeq[i]<=n)
  			pos[inputSeq[i]] = i;
  }
  int sortSeq[n];
  memcpy(sortSeq,inputSeq,sizeof(sortSeq));
  sort(sortSeq,sortSeq+n);
  if(sortSeq[0]>n)
  	return 1;
  int smallval = sortSeq[0];
  int cur = pos[sortSeq[0]];
  for(int i =0;i<n;i++){
  	if(inputSeq[(cur+i)%n]!=smallval+i && inputSeq[cur+i]<=n){
  		// cout << smallval << endl;
  		// cout << i << 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