Submission #413749

#	Time	Username	Problem	Language	Result	Execution time	Memory
413749		Antekb	Gondola (IOI14_gondola)	C++14	25 / 100	19 ms	972 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
	bool b=0;
	int V[n];
	for(int i=0; i<n; i++)V[i]=inputSeq[i];
	sort(V, V+n);
	for(int i=1; i<n; i++)if(V[i]==V[i-1])return 0;
	for(int i=0; i<n; i++){
		if(inputSeq[i]<=n){
			int t=inputSeq[i]-i-1;
			//cout<<inputSeq[i]<<"\n";
			for(int j=0; j<n; j++)V[j]=inputSeq[(j-t+n)%n];
			//for(int j=0; j<n; j++)cout<<V[j]<<" ";
			b=1;
			break;
		}
	}
	if(b==0)return 1;
	for(int i=0; i<n; i++)if(V[i]<=n && V[i]!=i+1)b=0;
	for(int i=0; i<n; ++i)inputSeq[i]=V[i];
	return b;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	if(!valid(n, gondolaSeq))return 0;
	/*vector<int > V(n);
	for(int i=0; i<n; i++)V[i]=inputSeq[i];
	sort(V.begin(), V.end());*/
	int m=0;
	for(int i=0; i<n; i++){
		if(gondolaSeq[i]>gondolaSeq[m])m=i;
	}
	int l=gondolaSeq[m]-n;
	/*bool b=1;
	for(int i=0; i<n; i++)cout<<gondolaSeq[i]<<" ";
	cout<<"\n";*/
	for(int i=0; i<n; i++){
		if(gondolaSeq[i]>n && i!=m)replacementSeq[gondolaSeq[i]-n-1]=gondolaSeq[i];
	}
	gondolaSeq[m]=m+1;
	for(int i=0; i<l; i++){
		if(!replacementSeq[i]){
			replacementSeq[i]=gondolaSeq[m];
			gondolaSeq[m]=i+l+1;
		}
	}
	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: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10