Submission #1280191

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280191		Nurislam	Gondola (IOI14_gondola)	C++20	25 / 100	25 ms	4964 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int n, int in[])
{
	vector<int> a;
	for(int i = 0; i < n; i ++ ) if(in[i] < n)a.push_back(in[i]);
	set<int> st;
	
	for(int i = 0; i < n; i ++ ) st.insert(in[i]);
	if(st.size() != n) return 0;
	
	
	int cnt = 0;
	for(int i = 0; i < a.size(); i ++ ) {
		if(a[i] > a[(i+1)%a.size()]) cnt ++ ;
	};
	return (cnt == 1);
}

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

int replacement(int n, int gs[], int rs[])
{
	int mx = n;
	for(int i = 0; i < n; i ++ ) {
		mx = max(mx, gs[i]);
	};
	int sz = mx - n;
	vector<int> us(mx+1);
	for(int i = 0; i < n; i ++ ) {
		us[gs[i]] = 1;
	};
	int id = 0;
	for(int i = 1; i <= mx; i ++ ) {
		if(!us[i])rs[id++] = i;
	};
	return sz;
}

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

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