#include "plants.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(int)(n);i++)
using namespace std;
typedef pair<int,int>P;
int n;
vector<P>xs;
void init(int k, std::vector<int> r){
n=r.size();
//k=2
vector<int>v(2*r.size());
rep(i,2*r.size()){
v[i]=r[i%r.size()];
}
rep(i,v.size()){
if(i==0||v[i-1]!=v[i]){
xs.push_back(P(i,v[i]));
}
}
xs.push_back(P(2*r.size(),0));
return;
}
int compare_plants(int x, int y) {
int id1=lower_bound(xs.begin(),xs.end(),P(x+1,0))-xs.begin()-1;
int id2=lower_bound(xs.begin(),xs.end(),P(y+1,0))-xs.begin()-1;
if(y<=xs[id1+1].first){
if(xs[id1].second==0)return 1;
else return -1;
}
if(x+n<=xs[id2+1].first){
if(xs[id2].second==0)return -1;
else return 1;
}
return 0;
}
