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"
using namespace std;
vector<int> R;
void init(int k, std::vector<int> r) {
	R = r;
	return;
}
int compare_plants(int x, int y) {
	int a=x;
	int n = R.size();
	if(R[a] == 1){
		a += 1;
		while((a%n) != y && R[(a%n)] == 0)a++;
		if((a%n) == y) return 1;
	}
	a = y;
	if(R[a] == 1){
		a += 1;
		while((a%n) != x && R[(a%n)] == 0)a++;
		if((a%n) == 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... |