Submission #588910

#	Time	Username	Problem	Language	Result	Execution time	Memory
588910		fuad27	Gondola (IOI14_gondola)	C++17	25 / 100	11 ms	644 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define prev(i)	((i-1+n)%n)
int valid(int n, int a[])
{
	int cnt = a[0]-1;
	for(int i = 1;i<n-cnt;i++) {
		
		if(a[i] != a[i-1]+1) {
			return 0;
		}
	}
	for(int i = n-cnt+1;i<n;i++) {
		if(a[i]!=a[i-1]+1)return 0;	
	}
	if(cnt==0)return 1;
	if(a[0] != a[n-1]+1)return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int cnt=0;
	for(int i = 0;i<n;i++) {
		if(gondolaSeq[i]>n)cnt++;	 
	}
	if(cnt == 0)return 0;
	else if(cnt == n) {
		for(int i = 0;i<n;i++) {
			replacementSeq[i] = gondolaSeq[i]-n+1;
		}
		return n;
	}
	else {
		vector<pair<int,int>> res;
		for(int i = 0;i<n;i++) {
			if(gondolaSeq[i] > n) {
				int tmp = gondolaSeq[i];
				gondolaSeq[i] = (gondolaSeq[prev(i)]%n)+1;
				res.push_back(make_pair(tmp, gondolaSeq[i]));
			}
		}
		sort(res.begin(), res.end());
		for(int i = 0;i<(int)res.size();i++) {
			replacementSeq[i]=res[i].second;
		}
		return (int)res.size();
	}
	return -2;
}

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

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