제출 #371262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371262		peijar	곤돌라 (IOI14_gondola)	C++17	55 / 100	47 ms	5484 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[])
{
	set<int> seen;
	for (int i(0); i < n; ++i)
	{
		if (seen.count(inputSeq[i]))
			return 0;
		seen.insert(inputSeq[i]);
	}
	for (int i(0); i < n; ++i)
		if (inputSeq[i] <= n)
		{
			for (int j(1); j < n; ++j)
				if (inputSeq[(i+j)%n] <= n and inputSeq[(i+j)%n]%n != (inputSeq[i] + j)%n)
					return 0;
			return 1;
		}
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	assert(valid(n, gondolaSeq));
	
	int posNormal(0);
	while (posNormal < n and gondolaSeq[posNormal] > n)
		posNormal++;
	if (posNormal != n)
		rotate(gondolaSeq, gondolaSeq + (posNormal - gondolaSeq[posNormal]+1+n)%n, gondolaSeq + n);
	vector<pair<int, int>> toReplace;
	for (int i(0); i < n; ++i)
		if (gondolaSeq[i] > n)
			toReplace.emplace_back(gondolaSeq[i]-n, i+1);
	sort(toReplace.begin(), toReplace.end());
	int curLen(0);
	for (auto [val, id] : toReplace)
		while (curLen < val)
		{
			replacementSeq[curLen++] = id;
			id = curLen+n;
		}
  return curLen;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

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