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>
#define F first
#define S second
#define ll long long
#define nd '\n'
using namespace std;
vector <int> plants;
ll n=0;
void init (int k, vector <int> r){
plants = r;
n = r.size();
}
int compare_plants(int x, int y){
bool menor=1, mayor=1;
for (ll i=x; i<y; i++){
if (plants[i] != 1) mayor=0;
else menor=0;
}
if (mayor) return -1;
else if (menor) return 1;
mayor=1;
menor=1;
for (ll i=y; (i%n)!=x; i++){
if (i == n) i=0;
if (plants[i] != 1) mayor=0;
else menor=0;
}
if (mayor) return 1;
else if (menor) return -1;
else 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... |