#include "plants.h"
#include <iostream>
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
int inf = 1e9 + 7;
vector<int> pref;
int n;
void init(int k, vector<int> r) {
n = r.size();
pref.assign(n + 1, 0);
for (int i = 0; i < n; i++) {
pref[i + 1] = pref[i] + r[i];
}
}
int compare_plants(int x, int y) {
int val = pref[y] - pref[x];
int val2 = pref[n] - pref[y] + pref[x];
if (val == y - x) {
return -1;
} else if (val == 0) {
return 1;
} else if (val2 == n - y + x) {
return 1;
} else if (val2 == 0) {
return -1;
} else {
return 0;
}
}
/*
signed main() {
int m ;
cin >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
init(2, a);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << compare_plants(l, r) << '\n';
}
}
*/
# | 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... |