Submission #995216

#	Time	Username	Problem	Language	Result	Execution time	Memory
995216		alex_2008	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	2396 KiB

plants

#include "plants.h"
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const int N = 2e5 + 10;
int r[N], perm[N];
int val[N];
int n, k;
void init(int K, vector<int> R) {
	k = K;
	n = (int)R.size();
	for (int i = 1; i <= n; i++) {
		r[i] = R[i];
	}
	for (int i = n; i >= 1; i--) {
		for (int j = 1; j <= n; j++) {
			bool ch = true;
			if (r[j] != (k - 1)) continue;
			for (int l = j + k; l <= n; l++) {
				if (r[l] == (k - 1)) {
					ch = false;
				}
			}
			for (int l = 1; l < i; l++) {
				if (l + (k - 1) < i) continue;
				if (r[l] == (k - 1)) {
					ch = false;
				}
			}
			if (ch) {
				r[j] = -1;
				perm[j] = i;
				for (int l = max(1, (j - k + 1)); l < j; l++) {
					r[l]++;
				}
				if ((j - k + 1) < 1) {
					int mnac = (k - 1) - (j - 1);
					for (int l = n; l > n - mnac; l--) {
						r[l]++;
					}
				}
				break;
			}
		}
	}
}
int compare_plants(int x, int y) {
	if (perm[x] > perm[y]) return 1;
	return -1;
}
/*
int main() {

}
*/

• 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