Submission #1250276

#TimeUsernameProblemLanguageResultExecution timeMemory
1250276kaloyanTriple Peaks (IOI25_triples)C++20
8 / 100
2096 ms1860 KiB
#include <bits/stdc++.h>

using namespace std;

long long count_triples(std::vector<int> H)
{
    
    int N = H.size();
    long long counter = 0;
    
    for(int i = 0 ; i < N - 2 ; ++i)
    {
        for(int j = i + 1 ; j < N - 1 ; ++j)
        {
            for(int k = j + 1 ; k < N ; ++k)
            {
                vector<int> A = { j - i, k - i, k - j };
                vector<int> B = { H[i], H[j], H[k] };
                
                sort(A.begin(), A.end());
                sort(B.begin(), B.end());
                
                if(A == B) counter++;
            }
        }
    }

    return counter;
}

std::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...