Submission #1145255

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145255		lucaskojima	Gondola (IOI14_gondola)	C++17	10 / 100	5 ms	1096 KiB

gondola

#include "bits/stdc++.h"
#include "gondola.h"
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;

int valid(int n, int inputSeq[]) {
	vector<int> v(n);
	for (int i = 0; i < n; i++)
		v[i] = inputSeq[i];

	int p = 0;
	while (p < n && v[p] > n) p++;

	if (p == n) return 1;

	map<int, int> mp;
	int val = v[p];

	for (int i = p; i < n; i++) {
		if (v[i] <= n && v[i] != val)
			return 0;
		if (v[i] > n && mp[v[i]] > 0)
			return 0;

		val == n ? val = 1 : val++;
		if (v[i] > n) mp[v[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: 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