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 "plants.h"
#include <bits/stdc++.h>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
const int N = 200100;
const int oo = 2e9;
vector<int> vc, perm;
int per[N];
void init(int k, vector<int> r) {
int n = sz(r);
assert(2 * k > n);
k = 4; n = 5;
perm.clear();
perm.resize(n);
for (int i = 0; i < n; i++)
perm[i] = i;
r.resize(n);
do {
for (int i = 0; i < n; i++){
r[i] = 0;
for (int it = 1, j = i; it < k; it++){
j = (j + 1) % n;
r[i] += bool(perm[j] > perm[i]);
}
}
for (int it = n - 1; it >= 0; it--){
vc.clear();
for (int i = 0; i < n; i++)
if (r[i] == 0)
vc.PB(i);
if (sz(vc) == 0){
for (int i = 0; i < n; i++)
cerr << perm[i] << " ";
return;
}
int cand = -1, cnt = 0;
for (int it = 0; it < sz(vc); it++){
int cur = vc[it];
int pre = vc[(it + sz(vc) - 1) % sz(vc)];
if (pre < cur){
if (cur - pre + n < k){
cand = cur;
cnt++;
}
} else {
if (cur - pre < k){
cand = cur;
cnt++;
}
}
}
per[cand] = it;
r[cand] = oo;
for (int i = 1, loc = cand; i < k; i++){
loc = (loc + n - 1) % n;
r[loc]--;
}
}
} while (next_permutation(all(perm)));
return;
}
int compare_plants(int x, int y) {
return (per[x] > per[y] ? 1 : -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... |