#include <bits/stdc++.h>
#include "triples.h"
using namespace std;
#define ll long long
ll n,a[200005];
ll count_triples(vector<int> v){
ll n=v.size();
for(int i=1;i<=n;i++){
a[i]=v[i-1];
}
ll ans=0;
for(int i=1;i<=n;i++){
ll srt=max(i-a[i],(ll)1);
ll ed=min(i+a[i],n);
for(int j=srt;j<=ed;j++){
for(int k=j+1;k<=ed;k++){
ll b[4]={k-j,k-i,j-i};
ll c[4]={a[i],a[j],a[k]};
sort(b,b+3);
sort(c,c+3);
int sol=1;
for(int l=0;l<3;l++){
if(b[l]!=c[l]){
sol=0;
}
}
ans+=sol;
}
}
}
return ans;
}
vector<int> construct_range(int m,int k){
return {1};
}
# | 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... |