#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a.begin(), a.end())
#define sz(a) (int)a.size()
vector<int> r;
vector<int> a;
int n;
void init(int k, std::vector<int> _r) {
r=_r;
n=sz(r);
a.resize(n);
int cnt=1;
while(cnt<=n){
int rem=0;
for (int i = n-k+1; i < n; i++) {
if(r[i]==k-1) rem=k-(n-i);
}
int j=0;
for (int i = 0; i < n; i++)
{
if(r[i]==k-1&&rem<=0){
j=i;
break;
}
rem--;
if(r[i]==k-1) rem=k-1;
}
a[j]=cnt++;
r[j]=0;
for (int i = j-1; i>j-k; i--) r[(i+n)%n]++;
}
return;
}
int compare_plants(int x, int y) {
if(a[x]>a[y]) return 1;
else return -1;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |