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;
int n;
int k;
vector<int> r;
void init(int k_, std::vector<int> r_) {
k = k_;
r = r_;
n = r.size();
return;
}
int compare_plants(int x, int y) {
bool gr, le;
gr = le = false;
vector<int> arr(n);
iota(arr.begin(), arr.end(), 0);
do {
vector<int> r2(n);
for (int i = 0; i < n; i++) {
for (int j = 1; j < k; j++) {
if (arr[i] < arr[(i + j) % n]) {
r2[i]++;
}
}
}
if (r2 == r) {
if (arr[x] < arr[y])
le = 1;
else
gr = 1;
}
} while (next_permutation(arr.begin(), arr.end()));
if (!le)
return 1;
if (!gr)
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... |