Submission #541822

#	Time	Username	Problem	Language	Result	Execution time	Memory
541822		LucaDantas	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	312 KiB

plants

// subtask 2*k > n, n <= 5000
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 2e5+10;

int ordem[maxn];

void init(int k, std::vector<int> r) {
	int n = (int)(r.size());
	for(int i = 0; i < n; i++) {
		int mx = 0;
		for(int j = 1; j < n; j++)
			if(r[j] < mx || (r[j] == mx && (mx - j + n) < k))
				mx = j;
		ordem[mx] = i;
		r[mx] = 0x3f3f3f3f;
		for(int j = 0; j < k; j++)
			--r[(mx - j + n) % n];
	}
}

int compare_plants(int x, int y) {
	return ordem[x] < ordem[y] ? 1 : -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