Submission #1250779

#TimeUsernameProblemLanguageResultExecution timeMemory
1250779yeyso2Triple Peaks (IOI25_triples)C++20
8 / 100
2095 ms1968 KiB
#include "triples.h" #include <bits/stdc++.h> using namespace std; long long count_triples(vector<int> H) { int n = H.size(); long long res = 0; for(int i = 0; i < n; i ++){ for(int j = i + 1; j < n; j ++){ for(int k = j + 1; k < n; k ++){ multiset<int> distances; distances.insert(j - i); distances.insert(k - j); distances.insert(k - i); multiset<int> heights; heights.insert(H[i]); heights.insert(H[j]); heights.insert(H[k]); if(distances == heights){ res ++; } } } } return res; } vector<int> construct_range(int M, int K) { return {1, 1, 1}; } /* 1 7 4 1 4 3 2 6 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...