Submission #1252533

#TimeUsernameProblemLanguageResultExecution timeMemory
1252533ollelapTriple Peaks (IOI25_triples)C++20
8 / 100
2095 ms1860 KiB
#include "triples.h" using namespace std; #include <bits/stdc++.h> #define rep(i,a,b) for(int i = a; i < b; i++) long long count_triples(std::vector<int> arr) { int n = arr.size(); auto valid = [&](int i, int j, int k) { int a[3] = {abs(i-j), abs(i-k), abs(j-k)}; int b[3] = {arr[i], arr[j], arr[k]}; sort(a, a+3); sort(b, b+3); return (a[0] == b[0] && a[1] == b[1] && a[2] == b[2]); }; int ans = 0; rep(i,0,n) rep(j,i+1,n) rep(k,j+1,n) { if( valid(i, j, k)) ans++; } return ans; } 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...