Submission #1250553

#TimeUsernameProblemLanguageResultExecution timeMemory
1250553nikdTriple Peaks (IOI25_triples)C++20
11 / 100
13 ms1968 KiB
#include "triples.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long count_triples(std::vector<int> H) { int n = H.size(); ll sol = 0; for(int i = 2; i<n; i++){ if(i-H[i] >= 0){ int ha = H[i-H[i]]; int a = i-H[i]; if(ha == H[i]) continue; if(H[a+ha] == H[i]-ha) sol++; if(2*ha != H[i] && H[i-ha] == H[i]-ha) sol++; } } return sol; } std::vector<int> construct_range(int M, int K) { return {1, 1, 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...