Submission #1253417

#TimeUsernameProblemLanguageResultExecution timeMemory
1253417abcdxyz123Triple Peaks (IOI25_triples)C++17
8 / 100
2094 ms2632 KiB
#include "triples.h"
#include<bits/stdc++.h>
using namespace std;

#define maxn 200005
#define ll long long
#define all(x) x.begin(),x.end()
int n;
int h[maxn];
bool isValid(int i,int j,int k)
{
    if(1<=i&&i<j&&j<k&&k<=n)
    {
        vector<int>A={h[i],h[j],h[k]};
        vector<int>B={j-i,k-j,k-i};
        sort(all(A));
        sort(all(B));
        if(A==B)return 1;
    }
    return 0;
}
ll count_triples(vector<int> H)
{
    n=H.size();
    for(int i=0;i<n;i++)h[i+1]=H[i];

    int res=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            for(int k=j+1;k<=n;k++)
            {
                res+=isValid(i,j,k);
            }
        }
    }
    return res;
}

vector<int> construct_range(int M, int K)
{
    return {1, 1, 1};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...