#include <bits/stdc++.h>
#include "triples.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(v) v.begin(), v.end()
constexpr ll inf = 1ll << 62ll;
mt19937 mt(time(0));
ll _ = 0;
ll count_triples(vector<int> h) {
ll n = h.size();
ll cnt = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i+1; j < n && j <= i + 10; j++) {
for (ll k = j+1; k < n && k <= i + 10; k++) {
multiset<ll> dists = {abs(i-j), abs(j-k), abs(k-i)};
multiset<ll> heights = {h[i], h[j], h[k]};
if (dists == heights) {
cnt++;
}
}
}
}
return cnt;
}
vector<int> construct_range(int M, int K) {
return {};
}
#ifdef TEST
#include "grader.cpp"
#endif
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |