Submission #413777

#	Time	Username	Problem	Language	Result	Execution time	Memory
413777		abdzag	Comparing Plants (IOI20_plants)	C++17	14 / 100	4088 ms	5408 KiB

plants

#include<bits/stdc++.h>
#include<unordered_map>
#include "plants.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define  sz(a) a.size()
typedef long double ld;
using namespace std;
static const long long inf = 1e15;
static const long long infint = 1e9;
typedef long long ll;
typedef unsigned long long ull;
vector<ll> sorted;
void init(int k, std::vector<int> r) {
	ll n = r.size();
	rep(i, 0, n) {
		ll indx = 0;
		rrep(j,n-1,-1){
			if (r[j] == 0) {
				indx = j;
				break;
			}
		}
		ll cur = 0;
		rep(j, 0, n) {
			cur++;
			if (r[(indx + j) % n] == 0) {
				if (cur > k) {
					indx = (j + indx) % n;
					break;
				}
				else cur = 1;
			}
		}
		r[indx] = infint;
		sorted.push_back(indx);
		indx -= (k-1);
		indx += n;
		rep(j, 0, k) {
			r[(indx + j) % n] -= 1;
		}
	}
	reverse(all(sorted));
}

int compare_plants(int x, int y) {
	if (find(all(sorted), x) - find(all(sorted), y) > 0)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