Submission #1250515

#TimeUsernameProblemLanguageResultExecution timeMemory
1250515fadyscubeTriple Peaks (IOI25_triples)C++20
9.35 / 100
2095 ms1864 KiB
#include "triples.h" #include <set> using namespace std; long long count_triples(std::vector<int> H) { long long ans = 0; int n = H.size(); 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++) { multiset<int> hs = {H[i], H[j], H[k]}; multiset<int> ds = {j-i, k-i, k-j}; if (hs == ds) ans++; } } } return ans; } std::vector<int> construct_range(int M, int K) { vector<int> v = {8, 9, 16, 17, 7, 2, 16, 3, 1, 1, 6, 4, 18, 9, 8, 5, 9, 18, 17, 12}; return v; }
#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...