#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
int n;
vector<pii> ans;
void init(int k, vector<int> r) {
n = r.size(), ans.resize(n);
int ltok = n-1, rtok = 0;
for (int i = 0; i < n; ++i) {
if (i > rtok) rtok = i;
while (r[rtok % n] == 0) ++rtok;
ans[i].Y = rtok;
}
for (int i = n-1; i >= 0; --i) {
if (i < ltok) ltok = i;
while (r[(ltok-1+n) % n] == 1) --ltok;
ans[i].X = ltok;
}
for (auto &[x, y] : ans) {
if (x < 0) x += n, y += n;
}
/*
cout << "ans test\n";
for (auto [x, y] : ans) {
cout << " -> " << x << " " << y << "\n";
}
*/
return;
}
int compare_plants(int x, int y) {
if (ans[x].X <= y and y <= ans[x].Y) return 1;
if (ans[x].X <= y+n and y+n <= ans[x].Y) return 1;
if (ans[y].X <= x and x <= ans[y].Y) return -1;
if (ans[y].X <= x+n and x+n <= ans[y].Y) return -1;
return 0;
}
