#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int mod(int a, int n) {
if ((a %= n) < 0) a += n;
return a;
}
int n, k;
int dist(int i, int j) {
return mod(j - i - 1, n) + 1;
}
vector<int> rts, lfs, vals;
vector<ll> rtdists, lfdists;
void init(int k_, vector<int> r) {
k = k_;
n = r.size();
vals = vector<int>(n, -1);
vector<int> likod(n), harap(n);
unordered_set<int> oks;
vector<int> cands;
for (int i = 0; i < n; i++) if (r[i] == 0) cands.push_back(i);
for (int x2 = 0, x1 = cands.size() - 1; x2 < cands.size(); x1 = x2++) {
int j1 = cands[x1], j2 = cands[x2];
harap[j1] = j2;
likod[j2] = j1;
if (dist(j1, j2) >= k) oks.insert(j2);
}
for (int v = n; v--;) {
int j = *oks.begin();
int j1 = likod[j], j2 = harap[j];
oks.erase(j);
vals[j] = v;
r[j] += n + 1;
vector<int> bagos;
for (int l = j - k + 1; l < j; l++) {
int ln = mod(l, n);
if (!--r[ln]) bagos.push_back(ln);
}
if (v > 0) {
if (j == j1 && j == j2) {
j1 = bagos.back();
j2 = bagos.front();
}
bagos.insert(bagos.begin(), j1);
bagos.push_back(j2);
for (int x1 = 0, x2 = 1; x2 < bagos.size(); x1++, x2++) {
int j1 = bagos[x1], j2 = bagos[x2];
harap[j1] = j2;
likod[j2] = j1;
if (dist(j1, j2) >= k) {
oks.insert(j2);
} else if (oks.count(j2)) {
oks.erase(j2);
}
}
}
}
rts = vector<int>(n, -1);
lfs = vector<int>(n, -1);
vector<int> wals(n, -2), inds(n);
iota(inds.begin(), inds.end(), 0);
sort(inds.begin(), inds.end(), [&](int i, int j) { return vals[i] < vals[j]; });
for (int x : inds) {
rts[x] = lfs[x] = x;
for (int i = 0; i < x + k; i++) {
if (wals[rts[x]] < wals[mod(i, n)]) rts[x] = mod(i, n);
}
for (int i = x - k + 1; i <= x; i++) {
if (wals[lfs[x]] < wals[mod(i, n)]) lfs[x] = mod(i, n);
}
wals[x] = vals[x];
}
lfdists.resize(n);
rtdists.resize(n);
for (int i = 0; i < n; i++) {
lfdists[i] = dist(lfs[i], i);
rtdists[i] = dist(i, rts[i]);
}
}
pair<int,ll> walk_up(const vector<int>& par, const vector<ll>& dists, int i, ll d) {
while (d >= dists[i]) {
d -= dists[i];
i = par[i];
}
return {i, d};
}
bool is_fixed_right(int x, int y) {
auto [X, rem] = walk_up(rts, rtdists, x, dist(x, y));
return rem < k && vals[X] >= vals[y];
}
bool is_fixed_left(int x, int y) {
auto [X, rem] = walk_up(lfs, lfdists, x, dist(y, x));
return rem < k && vals[X] >= vals[y];
}
int compare_plants(int x, int y) {
int mul = 1;
if (vals[x] < vals[y]) {
swap(x, y);
mul = -1;
}
return (is_fixed_right(x, y) or is_fixed_left(x, y)) * mul;
}
