Submission #165198

#	Time	Username	Problem	Language	Result	Execution time	Memory
165198		cfalas	Gondola (IOI14_gondola)	C++14	55 / 100	52 ms	8252 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int a[]){
	int cnt=0;
	for(int i=1;i<n;i++){
		if(a[i]!=a[i-1]+1) cnt++;

	}
	return (cnt<=1);
}

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

int replacement(int n, int a[], int ans[]){
	int apos=-1, av;
	int maxf=0;
	int minf = 0;
	unordered_map<int, int> m;
	for(int i=0;i<n;i++){
		if(a[i]<=n) apos = i, av=a[i];
		else m[a[i]] = i+1;
		maxf = max(maxf, a[i]);
		if(a[minf]>a[i]) minf = i;
	}
	if(apos==-1){
		apos = minf;
		av = 1;
	}
	queue<int> q;
	int l=0;
	for(int i=n+1;i<=maxf;i++){
		if(m[i]){
			int c = l - 1;
			ans[l] = (n + av - (apos - m[i] + 1) - 1) % n + l - c;
			l++;
			//cout<<apos<<" "<<m[i]<<" "<<av<<endl;

			while(!q.empty()){
				ans[l] = q.front();
				q.pop();
				l++;
			}
		}
		else q.push(i);
	}
	return l;
}

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

int countReplacement(int n, int a[]){
	if(!valid(n, a)){
		return 0;
	}
	sort(a, a+n);
	int ans=1;
	for(int i=0;i<n;i++){
		ans += max((a[i+1]-a[i]-3), 0);
	}
	return ans;
}

• 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