Submission #926809

#	Time	Username	Problem	Language	Result	Execution time	Memory
926809		NintsiChkhaidze	Gondola (IOI14_gondola)	C++17	10 / 100	7 ms	1624 KiB

gondola

#include "gondola.h"

int b[200005];

int valid(int n, int a[]){
	int k = -1;
	for (int i=0;i<n;i++){
		if (b[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k==-1) return 1;
		
	int m = 0;
	for (int j = k; j < n; j++)
		if (a[j] <= n) b[++m] = a[j];
	
	for (int j = 0; j < k; j++)
		if (a[j] <= n) b[++m] = a[j];
		
	for (int i = 2; i <= m; i++){
		if (b[i] <= b[i - 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: 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