Submission #792086

#	Time	Username	Problem	Language	Result	Execution time	Memory
792086		mousebeaver	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	340 KiB

plants

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

vector<int> height(0);

void init(int k, vector<int> r) 
{
	int n = r.size();
	height.assign(n, -2); //-2 = No info, -1 = already candidate
	vector<int> candidates(0);
	int val = k;
	int counter = n;

	do
	{
		for(int i = 0; i < n; i++)
		{
			if(height[i] == -2 && r[i] == val)
			{
				candidates.push_back(i);
				height[i] = -1;
			}
		}	
		if(candidates.empty())
		{
			val--;
		}
	}while(candidates.empty());
	sort(candidates.begin(), candidates.end());

	int index = 0;
	while((candidates[index]+k-1)%n >= candidates[(index+1)%candidates.size()])
	{
		index++;
	}
	height[candidates[index]] = counter;
	counter--;
	candidates.erase(candidates.begin()+index);

	return;
}

int compare_plants(int x, int y) 
{
	if(height[x] > height[y])
	{
		return 1;
	}
	return -1;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25