Submission #586192

#	Time	Username	Problem	Language	Result	Execution time	Memory
586192		Tekor	Gondola (IOI14_gondola)	C++17	20 / 100	11 ms	1152 KiB

gondola

#include "gondola.h"

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