Submission #1269298

#TimeUsernameProblemLanguageResultExecution timeMemory
1269298sula2Triple Peaks (IOI25_triples)C++20
6 / 100
1167 ms1984 KiB
#include <bits/stdc++.h> using namespace std; long long count_triples(vector<int> H) { int ans = 0, n = H.size(); auto add = [&](int i, int j, int k) { if (0 <= k && k < n && multiset<int>{j-i, k-i, k-j} == multiset<int>{H[i], H[j], H[k]}) { ans++; } }; for (int i = 0; i < n; i++) { for (int j = i+1; j < n && j <= i+10; j++) { for (int k = j+1; k < n && k <= i+10; k++) { add(i, j, k); } } } return ans; } vector<int> construct_range(int, int) { return {}; }
#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...