# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1250931 | guymmk | Triple Peaks (IOI25_triples) | C++20 | 0 ms | 0 KiB |
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include "triples.h"
using namespace std;
vector<int> v;
int n;
set<vector<int>>s;
void is_triple(vector<int>g){
sort(g.begin(),g.end());
if(g[0]==g[1]||g[0]==g[2]||g[1]==g[2]||g[0]<0||g[2]>=n)return;
vector<int>a,b;
a={g[1]-g[0],g[2]-g[0],g[2]-g[1]};
b={v[g[0]],v[g[1]],v[g[2]]};
sort(a.begin(),a.end());
sort(b.begin(),b.end());
if(a==b)s.insert(g);
}
long long count_triples(vector<int> hsh) {
v=hsh;
s.clear();
int ans=0;
n=v.size();
for(int i=0;i<n;i++){
int l=i-v[i],r=i+v[i];
is_triple({i,l,r});
is_triple({i,r,r+v[i]});
is_triple({i,l,l-v[j]});
}return s.size();
}
vector<int> construct_range(int M, int K) {
return {1, 1, 1};
}