제출 #276370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
276370		amiratou	곤돌라 (IOI14_gondola)	C++14	25 / 100	31 ms	6136 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int val[100005],here[250005],pos[250005];

int valid(int n, int inputSeq[])
{
	int idx=-1;
	for (int i = 0; i < n; ++i){
		if(here[inputSeq[i]])return 0;
		here[inputSeq[i]]=1;
		if(inputSeq[i]<=n)idx=i;
	}
	if(idx==-1)return 1;
	int h=inputSeq[idx];
	for (int i = 0; i < n; ++i)
		val[(idx+i)%n]=((h-1+i)%n)+1;
	for (int i = 0; i < n; ++i)
		if(inputSeq[i]<=n && inputSeq[i]!=val[i])return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int flag=-1;
	for (int i = 0; i < n; ++i)
		if(gondolaSeq[i]<=n)flag=i;
	priority_queue<int,vector<int>,greater<int> > pq;
	if(flag!=-1){
		int g=gondolaSeq[flag];
		for (int i = 0; i < n; ++i){
			int r=((g-1+i)%n)+1;
			if(gondolaSeq[(flag+i)%n]!=r)pq.push(r),pos[r]=(flag+i)%n;
		}
	}
	else{
		for (int i = 0; i < n; ++i)
			pos[i+1]=i,pq.push(i+1);
	}
	int h=n+1,idx=0;
	while(!pq.empty()){
		int f=pq.top();
		pq.pop();
		replacementSeq[idx++]=f;
		pos[h]=pos[f];
		if(gondolaSeq[pos[h]]!=h)pq.push(h);
		h++;
	}
	return idx;
}

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

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: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10