Submission #1249998

#TimeUsernameProblemLanguageResultExecution timeMemory
1249998liamislazyTriple Peaks (IOI25_triples)C++20
8 / 100
2095 ms1864 KiB
#include "triples.h" #include <bits/stdc++.h> #define el '\n' typedef long long llo; #define fn(i,a,b) for (int i = a; i <= b; i++) #define rn(i,a,b) for (int i = a; i >= b; i--) using namespace std; long long count_triples(std::vector<int> H) { int n = H.size(); llo T = 0; fn(i,0,n-1) fn(j,i+1,n-1) fn(k,j+1,n-1){ vector<int> h = {H[i], H[j], H[k]}; vector<int> d = {j - i, k - j, k - i}; sort(h.begin(), h.end()); sort(d.begin(), d.end()); if(h == d) T++; } return T; } std::vector<int> construct_range(int M, int K) { 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...