Submission #371042

#	Time	Username	Problem	Language	Result	Execution time	Memory
371042		peijar	Gondola (IOI14_gondola)	C++17	10 / 100	14 ms	2424 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;

using ll = long long;

int valid(int n, int inputSeq[])
{
	vector<int> order;
	for (int i(0); i < n; ++i)
	{
		int cur = inputSeq[i];
		if (cur <= n)
			order.push_back(cur);
	}
	if (SZ(order) == 0) return 1;
	int posInv(0);
	while (posInv + 1 < SZ(order) and order[posInv] < order[posInv+1])
		posInv++;
	if (posInv + 1 == SZ(order))
		return 1;
	vector<int> finalOrder;
	for (int i(posInv+1); i < SZ(order); ++i)
		finalOrder.push_back(order[i]);
	for (int i(0); i <= posInv; ++i)
		finalOrder.push_back(order[i]);
	order = move(finalOrder);
	for (int i(0); i+1 < SZ(order); ++i)
		if (order[i] >= order[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