제출 #430351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430351		frodakcin	곤돌라 (IOI14_gondola)	C++17	55 / 100	66 ms	5252 KiB

gondola

#include "gondola.h"
#include <cstdio>
#include <cassert>
#include <map>
#include <algorithm>

int valid(int n, int inputSeq[])
{
	std::map<int, int> map;
	for(int i=0;i<n;++i)
	{
		int x=inputSeq[i]-1;
		if(map.find(x) != map.end()) return 0;
		map.insert({x, i});
	}
	for(int i=0;i<n;++i)
		if(map.find(i)!=map.end() && map.find((i+1)%n)!=map.end())
		{
			int u=map[i], v=map[(i+1)%n];
			if(v != (u+1)%n)
				return 0;
		}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	for(int i=0;i<n;++i)
		if(gondolaSeq[i] <= n && gondolaSeq[i] != i+1)
		{
			std::rotate(gondolaSeq, gondolaSeq+(i-gondolaSeq[i]+1+n)%n, gondolaSeq+n);
		}
	std::map<int, int> map;
	for(int i=0;i<n;++i)
	{
		int x=gondolaSeq[i];
		assert(map.find(x) == map.end());
		map.insert({x, i});
	}
	int l=0, v=n;
	for(auto x:map)
		for(int t=x.second+1;v<x.first;)
			replacementSeq[l++]=t, t=++v;
	return l;
}

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

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