Submission #1083676

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083676		fv3	Comparing Plants (IOI20_plants)	C++17	14 / 100	4030 ms	9552 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;

int K, N;

vector<int> R;

bool check(int s)
{
	int cnt = 0;
	for (int i = s - 1; i >= 0 && cnt < K - 1; i--, cnt++)
		if (!R[i]) return false;
	for (int i = N - 1; cnt < K - 1; i--, cnt++)
		if (!R[i]) return false;

	cnt = 0;
	for (int i = s - 1; i >= 0 && cnt < K - 1; i--, cnt++)
		R[i]--;
	for (int i = N - 1; cnt < K - 1; i--, cnt++)
		R[i]--;

	return true;
}

vector<int> H;
void init(int k, vector<int> r) 
{
	R = r; K = k;
	N = (int)r.size();

	// Find ordering in O(N²)
	H = vector<int>(N);
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			if (R[j]) continue;
			if (check(j))
			{
				H[j] = N - i;
				R[j] = INF;
				break;
			}
		}
	}
}

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

#ifdef TEST
#include "grader.cpp"
#endif

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