Submission #1252321

#TimeUsernameProblemLanguageResultExecution timeMemory
1252321walrusramen21Triple Peaks (IOI25_triples)C++20
8.17 / 100
2092 ms1864 KiB
#include "triples.h" #include <algorithm> #include <array> #include <iterator> long long count_triples(std::vector<int> H) { int N = H.size(); long long ans = 0; for (int i = 0; i < N; i++) { for (int j = i+1; j < N; j++) { for (int k = j+1; k < N; k++) { std::array<int, 3> a = {j-i, k-i, k-j}; std::array<int, 3> b = {H[i], H[j], H[k]}; std::sort(a.begin(), a.end()); std::sort(b.begin(), b.end()); if (a[0]==b[0] && a[1]==b[1] && a[2]==b[2]) ++ans; } } } return ans; } std::vector<int> construct_range(int M, int K) { return {1, 1, 2}; }
#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...