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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
vi R;
void init(int k, std::vector<int> r) {
R = r;
}
int compare_plants(int x, int y) {
int a = R[x];
bool q = 0;
for (int i = (x+1)%R.size(); i != y; i = (i+1)%R.size()) {
if (R[i] != a) {q = 1; break;}
}
if (!q) return (a ? -1 : 1);
a = R[y+1];
for (int i = (y+1)%R.size(); i != x; i = (i+1)%R.size()) {
if (R[i] != a) {q = 1; break;}
}
if (!q) return (a ? 1 : -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... |