Submission #588896

#	Time	Username	Problem	Language	Result	Execution time	Memory
588896		fuad27	곤돌라 (IOI14_gondola)	C++17	20 / 100	12 ms	596 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int a[])
{
	int cnt = a[0]-1;
	for(int i = 1;i<n-cnt;i++) {
		if(a[i] != a[i-1]+1) {
			return 0;
		}
	}
	for(int i = n-cnt+1;i<n;i++) {
		if(a[i]!=a[i-1]+1)return 0;	
	}
	if(cnt==0)return 1;
	if(a[0] != a[n-1]+1)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: 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