Submission #8893

#	Time	Username	Problem	Language	Result	Execution time	Memory
8893		ho94949	Gondola (IOI14_gondola)	C++98	55 / 100	28 ms	2964 KiB

gondola

#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdio>
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
	bool x[250010];
	memset(x,sizeof(x),0);
	int firstoffset=-1;
	for(int i=0;i<n;i++){
		if(inputSeq[i]<=n){
			if(firstoffset==-1)
				firstoffset=(inputSeq[i]-i+n)%n;
			else	
				if(firstoffset!=(inputSeq[i]-i+n)%n)
					return 0;
		}
		if(x[inputSeq[i]]) return 0;
		x[inputSeq[i]]=true;
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<pair<int,int> > X;
	int firstoffset=0;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i]<=n){
			if(firstoffset==0)
				firstoffset=(gondolaSeq[i]-i+n)%n;
		}
	}
	for(int i=0;i<n;i++){
		if(gondolaSeq[i]>n){
			X.push_back(make_pair(gondolaSeq[i],i));
		}
	}
	sort(X.begin(),X.end());
	int ptr=0;
	int top=n+1;
	for(int i=0;i<X.size();i++){
		//printf("%d %d\n",X[i].second,firstoffset);
		replacementSeq[ptr++]=(X[i].second+firstoffset+n-1)%n+1;
		for(int j=top;j<X[i].first;j++)
			replacementSeq[ptr++]=j;
		top=X[i].first+1;
	}
	return ptr;
}

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