Submission #1300181

#	Time	Username	Problem	Language	Result	Execution time	Memory
1300181		orgiloogii	Gondola (IOI14_gondola)	C++20	0 / 100	1096 ms	344 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]) {
	int idx = -1;
	map <int, bool> vis;
	for (int i = 0;i < n;i++) {
		if (vis[inputSeq[i]] == true) return 0;
		vis[inputSeq[i]] = true;
		if (inputSeq[i] <= n && idx == -1) {
			idx = i;
		}
	}
	if (idx == -1) return 1;
	int cnt = inputSeq[idx];
	for (int i = idx + 1;i != idx;i++) {
		i %= n;
		cnt %= n;
		cnt++;
		if (inputSeq[i] <= n && inputSeq[i] != cnt) return 0;
	}
	return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[]) {
  return -3;
}
// int main() {
// 	int arr[5] = {1, 2, 3, 4, 4};
// 	cout << valid(5, arr) << endl;
// }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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