Submission #127722

#	Time	Username	Problem	Language	Result	Execution time	Memory
127722		Boxworld	Gondola (IOI14_gondola)	C++14	25 / 100	63 ms	5452 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
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<int,vector<int>,greater<int> > 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];
	}
	for (int i=n+1;i<=Max;i++)replacementSeq[i-n-1]=i-1;
	for (int i=fir+1;i<n+fir;i++)
	if (a[i]>n){
		replacementSeq[a[i]-n-1]=(firN+i-fir)%n;
		if (replacementSeq[a[i]-n-1]==0)replacementSeq[a[i]-n-1]=n;
	}
//	while(!Q.empty()){
//		int x=Q.top();
//	}
	return Max-n;
}

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

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

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:24: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: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10