Submission #819774

#	Time	Username	Problem	Language	Result	Execution time	Memory
819774		Abrar_Al_Samit	식물 비교 (IOI20_plants)	C++17	0 / 100	48 ms	4960 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;

const int nax = 5002;
int val[nax], n, k;
int sm[nax];

bool cmp(int x, int y) {
	if(x + k - 1 < n) {
		return y > x && y <= x + k - 1;
	} else {
		if(y < x) return (x + k - 1) % n >= y;
		else return y > x;
	}
}
void init(int K, vector<int> r) {
	k = K;
	n = r.size();
	int tg = 1;
	queue<int>q;
	for(int i=0; i<n; ++i) {
		sm[i] = k - r[i] - 1;
		if(sm[i]==0) {
			q.push(i);
		}
	}
	while(!q.empty()) {
		vector<int>cur;
		while(!q.empty()) {
			cur.push_back(q.front());
			q.pop();
		}
		sort(cur.begin(), cur.end(), [&] (int x, int y) {
			if(x + k - 1 < n) {
				return y > x && y <= x + k - 1;
			} else {
				if(y < x) return (x + k - 1) % n >= y;
				else return y > x;
			}
		});

		for(int x : cur) {
			val[x] = ++tg;

			for(int z=x, cnt=0; cnt<=k; ++cnt, z=(z-1+n)%n) {
				if(--sm[z]==0) q.push(z);
			}
		}
	}	
}

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