제출 #1285139

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

triples

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

void manual(vector<int> &a) {
  if (a[0] > a[1]) swap(a[0], a[1]);
  if (a[1] > a[2]) swap(a[1], a[2]);
  if (a[0] > a[1]) swap(a[0], a[1]);
}

long long count_triples(vector<int> h) {
  return 0;
  int n = h.size();
  auto f = [&](int i, int j, int k) {
    vector<int> x = {abs(i - j), abs(i - k), abs(j - k)};
    vector<int> y = {h[i], h[j], h[k]};
    manual(x); manual(y);
    return x == y;
  };
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (i - h[i] >= 0) {
      int j = i - h[i];
      int k = j + h[j];
      int prv = -1;
      if (k < i) {
        if (f(i, j, k)) {
          res++;
          prv = k;
        }
      }
      k = i - h[j];
      if (k != prv && k > j) {
        res += f(i, j, k);
      }
    }
    if (i + h[i] < n) {
      int j = i + h[i];
      int k = j - h[j];
      int prv = -1;
      if (k > i) {
        if (f(i, j, k)) {
          res++;
          prv = k;
        }
      }
      k = i + h[j];
      if (k != prv && k < j) { 
        res += f(i, j, k);
      }
    }
    for (int j = max(0, i - h[i] + 1); j + h[i] <= min(n - 1, i + h[i] - 1); j++) {
      int k = j + h[i];
      if (j != i && k != i && h[j] + h[k] == h[i]) {
        res += f(i, j, k);
      }
    }
  }
  return res;
}

// vector<int> res = {1, 3, 2, 3, 4, 1, 2, 1, 3, 1, 2, 1, 4, 3, 2, 3, 1, 1, 2, 1};
vector<int> a = {25, 2, 1, 1, 3, 2, 3, 4, 1, 2, 1, 3, 5, 6, 5, 4, 9, 10, 7, 8, 13, 14, 3, 4, 17, 18, 1, 16, 21, 22, 19, 12, 25, 26, 9, 8, 29, 12, 11, 20, 33, 32, 31, 17, 37, 36, 3, 38, 41, 8, 31, 8, 45, 28, 27, 30, 49, 48, 47, 50, 53, 52, 19, 54, 57, 16, 47, 18, 61, 44, 43, 46, 65, 24, 55, 26, 69, 52, 35, 36, 73, 32, 63, 2, 77, 60, 59, 62, 81, 40, 71, 18, 85, 68, 51, 70, 53, 16, 79, 14};
vector<int> res = {3, 1, 2, 1, 4, 3, 2, 7, 6, 5, 6, 3, 4, 5, 1, 1, 2, 1, 4, 3, 2, 5, 1, 7, 6, 9, 4, 11, 10, 13, 8, 15, 14, 17, 4, 19, 18, 21, 16, 23, 22, 25, 12, 27, 26, 29, 8, 31, 30, 33, 20, 35, 34, 37, 24, 39, 38, 41, 28, 43, 42, 45, 24, 47, 46, 49, 36, 51, 50, 53, 16, 55, 54, 57, 44, 59, 58, 61, 40, 63, 62, 65, 52, 67, 66, 69, 32, 71, 70, 73, 60, 75, 74, 77, 56, 79, 78, 81, 68, 83};

vector<int> construct_range(int M, int K) {
  // reverse(res.begin(), res.end());
  reverse(a.begin(), a.end());
  for (auto x : a) res.push_back(x);
  vector<int> ret;
  while (ret.size() < M) {
    for (auto x : res) {
      ret.push_back(x);
      if (ret.size() == M) break;
    }
  }
  return ret;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 5 / 5
• Subtask 8: 2.705 / 5
• Subtask 9: 1.1273 / 5
• Subtask 10: 0.4832 / 5
• Subtask 11: 0.5637 / 5
• Subtask 12: 0.1879 / 5