#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
const int maxn = 2e5+10;
int n;
int head[maxn];
int r[maxn];
void init(int k, vector<int> a)
{
n = a.size();
for (int i = 0; i < n; i++)
r[i] = a[i];
head[0] = head[1] = 0;
int at = r[0];
for (int i = 1; i < n-1; i++)
{
if (r[i] == at) head[i+1] = head[i];
else
{
head[i+1] = i;
at = r[i];
}
}
}
int compare_plants(int x, int y)
{
if (x == 0 && y == n-1)
{
if (r[n-1] == 0) return -1;
return 1;
}
if (x == n-1 && y == 0)
{
if (r[n-1] == 0) return 1;
return -1;
}
if (x < y && head[y] <= x)
{
if (r[x] == 0) return 1;
return -1;
}
else if (x > y && head[x] <= y)
{
if (r[y] == 0) return -1;
return 1;
}
else if (head[x] == 0 && head[n-1] <= y)
{
if (r[y] == 0 && r[n-1] == 0 && r[0] == 0) return -1;
if (r[y] == 1 && r[n-1] == 1 && r[0] == 1) return 1;
}
else if (head[y] == 0 && head[n-1] <= x)
{
if (r[x] == 0 && r[n-1] == 0 && r[0] == 0) return 1;
if (r[x] == 1 && r[n-1] == 1 && r[0] == 1) return -1;
}
return 0;
}
