Submission #1145329

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145329		PagodePaiva	Comparing Plants (IOI20_plants)	C++20	14 / 100	4089 ms	5124 KiB

plants

#include<bits/stdc++.h>
#include "plants.h"

using namespace std;

const int N = 5010;
int v[N];
int n;
int ans[N];

bool incluso(int x, int l, int r){
	if(l <= r){
		if(l <= x and x <= r) return true;
		return false;
	}
	else{
		if(l <= x and x <= n-1) return true;
		if(0 <= x and x <= r) return true;
		return false;
	}
}

void init(int k, std::vector<int> r) {
	n = r.size();
	for(int tt = 0;tt < n;tt++){
		vector <int> zeros;
		for(int i = 0;i < r.size();i++){
			if(r[i] == 0) zeros.push_back(i);
		}
		int d = zeros.size();
		for(int i = 0;i < zeros.size();i++){
			if(incluso(zeros[((i-1)%d + d)%d], ((zeros[i]-(k-1))%n+n)%n, zeros[i]) and d != 1) continue;
			for(int j = 0;j < r.size();j++){
				if(incluso(j, ((zeros[i]-(k-1))%n+n)%n, zeros[i])){
					r[j]--;
				} 
			}
			r[zeros[i]] = 1e8;
			ans[zeros[i]] = n-tt-1;
			break;
		}
	}
	return;
}

int compare_plants(int x, int y) {
	if(ans[x] > ans[y]) return 1;
	return -1;
	return 0;
}

• 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