Submission #397995

#	Time	Username	Problem	Language	Result	Execution time	Memory
397995		prvocislo	Gondola (IOI14_gondola)	C++17	35 / 100	26 ms	2136 KiB

gondola

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include "gondola.h"
typedef long long ll;
using namespace std;

int valid(int n, int v[]) { return 0; }
int replacement(int n, int v[], int r[])
{
	const int maxl = 2.5e5 + 79;
	vector<int> o(n, -1), f(maxl, -1);
	for (int i = 0; i < n; i++) v[i]--;
	for (int i = 0; i < n; i++)
	{
		if (v[i] >= n) continue;
		o[i] = v[i];
		for (int j = 0; j < n; j++) o[j] = (v[i] - i + j + n) % n;
		break;
	}
	if (o[0] == -1) for (int i = 0; i < n; i++) o[i] = i;
	int l = *max_element(v, v + n), one = max_element(v, v + n) - v, cur = o[one];
	for (int i = 0; i < n; i++) if (v[i] >= n) f[v[i]] = o[i];
	for (int i = n; i <= l; i++)
	{
		if (f[i] != -1) r[i - n] = f[i] + 1;
		else
		{
			r[i - n] = cur + 1;
			f[v[one]] = i; cur = i;
		}
	}
	return l - n + 1;
}
int countReplacement(int n, int inputSeq[]) { return 0; }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10