제출 #792139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
792139		mousebeaver	Comparing Plants (IOI20_plants)	C++14	0 / 100	4 ms	468 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, -1); //-1 = not already known

	for(int nodes = 0; nodes < n; nodes++)
	{
		vector<int> candidates(0);
		for(int i = 0; i < n; i++)
		{
			if(height[i] == -1 && r[i] == 0)
			{
				candidates.push_back(i);
			}
		}

		assert(!candidates.empty());
		int index = 0;
		while(!(index == (int) candidates.size()-1 || candidates[index]+k-1 >= candidates[index+1]) ||
				!(index == 0 || (candidates[index]+k-1)%n >= candidates[index-1]))
		{
			index++;
		}
		height[candidates[index]] = n-nodes;
		for(int i = 0; i < k; i++)
		{
			int j = candidates[index]-i;
			if(j < 0) j += n;
			r[j]--;
		}
		candidates.clear();
	}

	//vector<int> test = height;
	//int temp = 0;
}

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