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>
using namespace std;
const int N = 500000;
int n, k;
vector<int> r;
int p[N];
void init(int _k, vector<int> _r)
{
n = _r.size();
r = _r;
k = _k;
for (int i = 0; i < n; i++)
{
p[i] = p[i - 1] + r[i];
}
}
int compare_plants(int x, int y)
{
if (x < y)
{
if (p[y - 1] - p[x - 1] == 0)
{
return 1;
}
if (p[y - 1] - p[x - 1] == y - x)
{
return -1;
}
if (p[n - 1] - p[y - 1] + p[x - 1] == 0)
{
return -1;
}
if (p[n - 1] - p[y - 1] + p[x - 1] == n - y + x)
{
return 1;
}
return 0;
}
return -2;
}
# | 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... |