#include "triples.h"
using namespace std;
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; i++)
long long count_triples(std::vector<int> arr) {
int n = arr.size();
auto valid = [&](int i, int j, int k) {
int a[3] = {abs(i-j), abs(i-k), abs(j-k)};
int b[3] = {arr[i], arr[j], arr[k]};
sort(a, a+3);
sort(b, b+3);
return (a[0] == b[0] && a[1] == b[1] && a[2] == b[2]);
};
set<tuple<int,int,int>> ans_s;
rep(i,0,n) {
for (auto j : {i - arr[i], i + arr[i]}) {
if (j < 0 || j > n-1) continue;
for (auto k : {j - arr[j], j + arr[j], i - arr[j], i + arr[j]}) {
if (k < 0 || k > n-1) continue;
int x[] = {i, j, k};
sort(x, x+3);
if (valid(i, j, k)) ans_s.insert({x[0],x[1],x[2]});
}
}
}
// case 3:
// a < b < c, arr[a] = c-b, arr[b] = c-a, arr[c] = b-a
// iterate over b
// arr[a] - a = c-b-a = arr[b] - b
// arr[c] + c = b-a+c = arr[b] + b
vector<int> valid_before(n, 0);
map<int,vector<int>> cand_before, cand_after;
vector<int> before_cnt(n, 0), after_cnt(n, 0);
rep(b,0,n) {
before_cnt[b] = cand_before[arr[b]-b].size();
cand_before[arr[b]-b].push_back(b);
}
for (int b = n-1; b >= 0; b--) {
after_cnt[b] = cand_after[arr[b]+b].size();
cand_after[arr[b]+b].push_back(b);
}
rep(b,0,n) {
if (before_cnt[b] < after_cnt[b]) {
rep(i,0,before_cnt[b]) {
int a = cand_before[arr[b]-b][i];
int c = a + arr[b];
if (valid(a, b, c) && a < b && b < c) ans_s.insert({a, b, c});
}
}
else {
rep(i,0,after_cnt[b]) {
int c = cand_after[arr[b]+b][i];
if (c == b) break;
int a = c - arr[b];
if (valid(a, b, c) && a < b && b < c) ans_s.insert({a, b, c});
}
}
}
int ans = ans_s.size();
return ans;
}
std::vector<int> construct_range(int M, int K) {
vector<int> res(M);
rep(i,0,M) res[i] = 1 + (rand() % (M-1));
rep(iter,0,100) {
int i = rand() % M;
for (int j = 0; j < res[i]; j++) {
if (i + j < M) {
if (rand() % 5) res[i+j] = res[i] - j;
}
if (i - j >= 0) {
if (rand() % 5) res[i-j] = res[i] - j;
}
}
}
return res;
}
