#include "bits/stdc++.h"
#include "plants.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
vector<int> r, pref;
int n, k;
void init(int k_, vector<int> r_) {
n = sz(r_);
k = k_;
r = r_;
pref.resize(n);
pref[0] = r[0];
for (int i = 1; i < n; i++)
pref[i] = pref[i - 1] + r[i];
return;
}
int compare_plants(int i, int j) {
if (i < j) {
int sum = pref[j] - (i == 0 ? 0 : pref[i - 1]);
if (sum == 0)
return 1;
if (sum == j - i + 1)
return -1;
return 0;
} else {
swap(i, j);
int sum = pref[j] - (i == 0 ? 0 : pref[i - 1]);
if (sum == 0)
return -1;
if (sum == j - i + 1)
return 1;
return 0;
}
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... |