Submission #1225327

#	Time	Username	Problem	Language	Result	Execution time	Memory
1225327		Nonoze	Comparing Plants (IOI20_plants)	C++20	14 / 100	4091 ms	5184 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
#define fi first
#define se secod
#define sz(x) (int)x.size()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pb push_back

using namespace std;


int n, k;
vector<int> order;

void init(int K, vector<int> r) {
	k=K, n=sz(r);
	order.resize(n);
	vector<int> a;
	for (int t=0; t<n; t++) {
		int nb=0;
		for (int i=0; i<2*n; i++) {
			if (r[i%n]) nb++;
			else {
				if (nb<n/2) nb=0;
				else {
					a.pb(i%n);
					r[i%n]=3*n;
					for (int j=1; j<k; j++) {
						r[(i+n-j)%n]--;
					}
					break;
				}
			}
		}
		order[a.back()]=t;
	}
	return;
}


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

• 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