제출 #127849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127849		Boxworld	곤돌라 (IOI14_gondola)	C++14	60 / 100	63 ms	5368 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef pair<int,int> P;
const int maxN=100010;
int valid(int n, int inputSeq[]){
	map<int,int> M;
	int a[maxN*2],fir=-1,firN=n+1;
	for (int i=0;i<n;i++){
		a[n+i]=a[i]=inputSeq[i];
		if (M.count(a[i]))return 0;else M[a[i]]=1;
		if (1<=a[i]&&a[i]<=n)
		if (firN>a[i]){firN=a[i];fir=i;}
	}
	if (fir==-1)return 1;
	for (int i=fir+1;i<n+fir;i++)
	if (1<=a[i]&&a[i]<=n){
		if(a[i]-firN!=i-fir)return 0;
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	priority_queue<P,vector<P>,greater<P> >Q;
	int a[maxN*2],ans[maxN*3],fir=-1,firN=n+1,Max=n;
	for (int i=0;i<n;i++){
		a[n+i]=a[i]=gondolaSeq[i];
		if (1<=a[i]&&a[i]<=n)
			if (firN>a[i]){firN=a[i];fir=i;}
		if (a[i]>Max)Max=a[i];
	}
	if (fir==-1)Q.push(make_pair(a[n-1],1));
	for (int i=fir+1;i<n+fir;i++)
	if (a[i]>n){
		int y=(firN+i-fir)%n;
		if (y==0)y=n;
		Q.push(make_pair(a[i],y));
	}
	int N=0,last=n;
	while(!Q.empty()){
		P X=Q.top();Q.pop();
		int x=X.first,y=X.second;
//		printf("%d %d\n",x,y);
		replacementSeq[N++]=y;
		for (int i=last+1;i<x;i++)
		replacementSeq[N++]=i;
		last=x;
	}
	return Max-n;
}

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

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

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:25:16: warning: unused variable 'ans' [-Wunused-variable]
  int a[maxN*2],ans[maxN*3],fir=-1,firN=n+1,Max=n;
                ^~~

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