Submission #702151

#	Time	Username	Problem	Language	Result	Execution time	Memory
702151		mychecksedad	Gondola (IOI14_gondola)	C++17	20 / 100	39 ms	4592 KiB

gondola

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


int valid(int n, int a[]){
	map<int, bool> m;
	for(int i = 0; i < n; ++i){
		if(m[a[i]]){
			return 0;
		}
		m[a[i]] = 1;
	}
	int mn = -1;
	for(int i = 0; i < n; ++i){
		if(a[i] <= n){
			mn = mn == -1 ? i : (a[mn] < a[i] ? mn : i);
		}
	}
	if(mn == -1) return 1;
	int s = a[mn];
	bool ok = 1;
	for(int i = mn; i != mn || ok; (i += 1) %= n, s++){
		if(s == n + 1) s = 1;
		ok = 0;
		if(a[i] <= n && a[i] != s){
			return 0;
		}
	}
	return 1;
}

int replacement(int n, int a[], int r[]){
	int l = 0, mn = -1;
	for(int i = 0; i < n; ++i){
		if(a[i] <= n){
			mn = mn == -1 ? i : (a[mn] < a[i] ? mn : i);
		}
	}
	if(mn == -1) return 1;
	int s = a[mn];
	bool ok = 1;
	set<pair<int, int>> S;
	for(int i = mn; i != mn || ok; (i += 1) %= n, s++){
		if(s == n + 1) s = 1;
		ok = 0;
		if(a[i] > n){
			S.insert({a[i], i});
		}
	}
	for(int i = n + 1; !S.empty(); ++i){
		auto v = *S.begin();
		S.erase(S.begin());
		while(i < v.first){
			r[l] = a[v.second];
			a[v.second] = i;
			l++;
			i++;
		}
	}
	return l;
}

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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