Submission #1051348

#TimeUsernameProblemLanguageResultExecution timeMemory
1051348Gromp15Comparing Plants (IOI20_plants)C++17
0 / 100
31 ms4956 KiB
#include <bits/stdc++.h>
#include "plants.h"
#define sz(x) (int)x.size()
using namespace std;

int n;
vector<int> ord;

void init(int k, std::vector<int> r) {
	n = sz(r);
	ord.resize(n, -1);
	for (int i = 0; i < n; i++) {
		int mn = -1;
		for (int j = 0; j < n; j++) if (!~ord[j]) {
			if (!~mn || r[j] < r[mn]) mn = j;
		}
		ord[mn] = n - i;
		for (int j = 1; j <= k-1; j++) {
			int idx = mn - j;
			if (idx < 0) idx += n;
			r[idx]--;
		}
	}
}

int compare_plants(int x, int y) {
	return ord[x] > ord[y] ? 1 : -1;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...