#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
long long count_triples(std::vector<int> H)
{
ll cant = 0, i, ant=0, sig;
for(i=0; i<sz(H); i++)
{
ant=i-H[i];
if(ant>=0)
{
sig=ant+H[ant];
if(H[sig]==(i-sig))
cant++;
if(i-H[ant]!=sig&&i-H[ant]>=0)
{
sig=i-H[ant];
if(H[sig]==(sig-ant))
cant++;
}
}
}
return cant;
}
std::vector<int> construct_range(int M, int K)
{
vector<int>v(M);
ll i;
for(i=0; i<M/2; i++)
v[i]=i+1;
for(i=M/2; i<M; i++)
v[i]=i;
return v;
}
# | 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... |