제출 #1282637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1282637		kawhiet	Triple Peaks (IOI25_triples)	C++20	18 / 100	2096 ms	14244 KiB

triples

#include <bits/stdc++.h>
#include "triples.h"
using namespace std;

long long count_triples(vector<int> h) {
  int n = h.size();
  set<array<int, 3>> s;
  auto f = [&](int i, int j, int k) {
    array<int, 3> c = {i, j, k};
    sort(c.begin(), c.end());
    if (s.count(c)) {
      return false;
    }
    vector<int> a = {abs(i - j), abs(i - k), abs(j - k)};
    vector<int> b = {h[i], h[j], h[k]};
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    if (a == b) {
      s.insert(c);
      return true;
    }
    return false;
  };
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (i - h[i] >= 0) {
      int j = i - h[i];
      for (int k = j + 1; k < i; k++) {
        res += f(i, j, k);
      }
    }
    if (i + h[i] < n) {
      int j = i + h[i];
      for (int k = i + 1; k < j; k++) {
        res += f(i, j, k);
      }
    }
    for (int j = 0; j + h[i] < n; j++) {
      int k = j + h[i];
      if (j != i && k != i) {
        res += f(i, j, k);
      }
    }
  }
  return res;
}

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: 10 / 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