Submission #1250490

#TimeUsernameProblemLanguageResultExecution timeMemory
1250490fadyscubeTriple Peaks (IOI25_triples)C++20
8 / 100
2095 ms1860 KiB
#include "triples.h"
#include <set>

using namespace std;

long long count_triples(std::vector<int> H) {
  long long ans = 0;
  for (int i = 0; i < H.size()-2; i++) {
    for (int j = i+1; j < H.size()-1; j++) {
      for (int k = j+1; k < H.size(); 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) {
  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...