Submission #1360568

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360568		putuputu	Gondola (IOI14_gondola)	C++20	25 / 100	12 ms	5364 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
	unordered_set<int> se;
	int d=-1, s=-1;
  	for(int i=0; i<n; i++){
  		if(se.count(inputSeq[i])==true){
  			return 0;
		}
		se.insert(inputSeq[i]);
  		if(inputSeq[i]<=n and d==-1){
			d=i;
			s=inputSeq[i];
	  	}	
  	}
  	if(d==-1){
  		return 1;
	  }
  	for(int i=0; i<n; i++){
  		if(inputSeq[i]<=n){
  			int ex=(s-1+(i-d))%n;
  			if(ex<0){
  				ex+=n;
			  }
			  ex+=1;
			  if(inputSeq[i]!=ex){
			  	return 0;
			  }
		  }
	  }
  return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	if(valid(n, gondolaSeq)==0){
		return -1;
	}
	vector<int> a(gondolaSeq, gondolaSeq+n);
	sort(a.begin(), a.end());
	int mx=a.back();
	int l=0;
	long long nw=1;
	for(auto x : a){
		while(nw<x){
			replacementSeq[l++]=(int)nw;
			nw++;
		}
		nw=(long long)x+1;
	}
	while(nw<=mx){
		replacementSeq[l++]=(int)nw;
		nw++;
	}
  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