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 <iostream>
#include <vector>
#include "plants.h"
using namespace std;
int n, h, i;
vector<int> v, s;
void init(int k, vector<int> r)
{
v = r;
n = r.size();
h = k;
s.resize(n + 1);
s[0] = 0;
for (i = 0; i < n; i++)
s[i + 1] = s[i] + r[i];
}
int compare_plants(int x, int y)
{
if (s[y] - s[x] == y - x)
return -1;
if (s[y] - s[x] == x - y)
return 1;
if (s[x] + s[n] - s[y] == x + n - y)
return 1;
if (s[x] + s[n] - s[y] == y - x - n)
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... |