Submission #1081942

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081942		wood	Comparing Plants (IOI20_plants)	C++17	0 / 100	0 ms	348 KiB

plants

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

vi ranking;

void init(int k, std::vector<int> r) {
	int n = r.size();
	ranking.resize(n);
	for(int i = 0; i<n; i++){
		int window = 0;
		for(int l = 0;l<k; l++){
			window+=(r[l]==0);
		}
		int j;
		for(j = k; j<n+k; j++){
			int pos = j%n;
			if(r[pos]==0&&window==0) goto found;
			window-=r[j-k]==0;
			window+=(r[pos]==0);
		}
		
found:
			for(int l = 1; l<k; l++) r[(j-l+n)%n]--;
			r[j%n]=INT_MAX;
			ranking[j%n] = i;
	}
}

int compare_plants(int x, int y) {
	if(ranking[x]<ranking[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