제출 #55572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55572		leejseo	곤돌라 (IOI14_gondola)	C++98	20 / 100	25 ms	1608 KiB

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
using namespace std;

int valid(int n, int inputSeq[])
{
	int min_val = 1000000, min_index = -1;
	vector<int> L;
	for (int i=0; i<n; i++){
		L.push_back(inputSeq[i]);
		if (min_val > inputSeq[i]){
			min_index = i;
			min_val = inputSeq[i];
		}
	}
	sort(L.begin(), L.end());
	for (int i=1; i<n; i++) {
		if (L[i] == L[i-1]) return 0;
	}
	int mi = -1;
	for (int i=0; i<n; i++){
		if (L[i] > n && mi == -1) mi = i;
		if (mi > -1 && L[i] != n+i-mi+1) return 0;
	}
  	L.clear();
	int bi = min_index;
	for (int j=1; j<n; j++){
		int i = (j + min_index) % n;
		if (inputSeq[i] > n) continue;
		if (inputSeq[i] < inputSeq[bi]) return 0;
		bi = 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: 10 / 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