This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
const int nax = 5002;
int val[nax], n, k;
bool done[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();
for(int tg=1; tg<=n; ++tg) {
int mn = -1;
for(int i=0; i<n; ++i) if(!done[i] && r[i]==k-1) {
if(mn==-1) mn = i;
else if(!cmp(mn, i)) mn = i;
}
val[mn] = tg;
done[mn] = true;
for(int i=mn, cnt=0; cnt<k; ++cnt, i=(i-1+n)%n) {
++r[i];
}
}
// for(int i=0; i<n; ++i) {
// cerr<<val[i]<<' ';
// }
// cerr<<'\n';
}
int compare_plants(int x, int y) {
if(val[x]>val[y]) return 1;
return -1;
}
# | 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... |