제출 #1250490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250490		fadyscube	Triple Peaks (IOI25_triples)	C++20	8 / 100	2095 ms	1860 KiB

triples

#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};
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5