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 <vector>
using namespace std;
int n;
vector<int> pref;
void init(int k, vector<int> r){
n = r.size();
pref.resize(n + 1);
for(int i = 1; i <= n; i ++)
pref[i] = pref[i - 1] + r[i - 1];
return;
}
int compare_plants(int x, int y){
if(pref[y] == pref[x]) return 1;
if(pref[y] - pref[x] == y - x) return -1;
if(pref[n] - (pref[y] - pref[x]) == n - (y - x)) return 1;
if(pref[n] == (pref[y] - pref[x])) 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... |