Submission #1250495

#TimeUsernameProblemLanguageResultExecution timeMemory
1250495fadyscubeTriple Peaks (IOI25_triples)C++20
6.55 / 100
1171 ms1972 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 < min(i+11, n-1); j++) { for (int k = j+1; k < min(i+11, 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; for (int i = 0; i < 1666; i++) { v.push_back(1); v.push_back(1); v.push_back(2); } v.push_back(1); v.push_back(1); 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...