Submission #301773

#	Time	Username	Problem	Language	Result	Execution time	Memory
301773		faustaadp	Comparing Plants (IOI20_plants)	C++17	0 / 100	79 ms	3320 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll NN = 3e5 + 5;
ll a[NN], n;
void init(int k, std::vector<int> r) {
	n = r.size();
	for(ll i = 0; i < n; i++)
	{
		ll idx = 0;
		vector<ll> tmp;
		for(ll j = 0; j < n; j++)
			if(r[j] == 0)
				tmp.pb(j);
		ll sz = tmp.size();
		if(sz == 1)
			idx = tmp[0];
		else
		{
			for(ll j = 0; j < sz; j++) 
				if((tmp[j] + k) % n > tmp[(j - 1 + sz) % sz])
					idx = tmp[j];
		}
		a[idx] = n - i; 
		for(ll j = idx; j > (idx - k); j--)
			r[(j + n) % n]--;
		// cout << idx << " " << a[idx] << "\n"; 
		// for(ll j = 0; j < n; j++)
			// cout << r[j] << " ";
		// cout << "\n";
	}
	// for(ll i = 0; i < n; i++)
		// cout << a[i] - 1 << " ";
	// cout << "\n";
	return;
}

int compare_plants(int x, int y) {
	if(a[x] > a[y])return 1;
	else 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