제출 #1258148

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258148		avighna	3개의 봉우리 (IOI25_triples)	C++20	13.20 / 100	17 ms	1864 KiB

triples

#include <bits/stdc++.h>

bool check(int a, int b, int c, int x, int y, int z) {
  std::array<int, 3> p = {a, b, c};
  std::array<int, 3> q = {x, y, z};
  std::sort(p.begin(), p.end());
  std::sort(q.begin(), q.end());
  return p == q;
}

long long count_triples(std::vector<int> H) {
  const int n = H.size();
  long long ans = 0;
  // case 1
  for (int k = 0; k < n; ++k) {
    int i = k - H[k];
    if (i < 0 or i >= n) {
      continue;
    }
    int j = H[i] + i;
    if (j < 0 or j >= n or !(i < j and j < k)) {
      continue;
    }
    ans += check(j - i, k - j, k - i, H[i], H[j], H[k]);
  }
  // case 2
  for (int k = 0; k < n; ++k) {
    int i = k - H[k];
    if (i < 0 or i >= n) {
      continue;
    }
    int j = k - H[i];
    if (j < 0 or j >= n or !(i < j and j < k)) {
      continue;
    }
    if (i != j - H[j]) {
      continue;
    }
    if (H[j] == k - j or H[i] == j - i) {
      continue;
    }
    ans += check(j - i, k - j, k - i, H[i], H[j], H[k]);
  }
  return ans;
}

std::vector<int> construct_range(int M, int K) {
  return {8, 6, 7, 18, 3, 2, 9, 6, 11, 14, 3, 4, 1, 2, 1, 3, 4, 6, 5, 18};
}

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