Submission #1250752

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250752		ogkostya	3개의 봉우리 (IOI25_triples)	C++20	78.93 / 100	1245 ms	595012 KiB

triples

#include "triples.h"
#include <set>

long long count_triples(std::vector<int> H)
{

  int n = H.size();
  // if (n < 1000000)
  //   return 0;
  std::vector<std::set<std::pair<int, int>>> s(n, std::set<std::pair<int, int>>());

  for (int j = 1; j < n - 1; j++)
  {
    int i, k;
    i = j - H[j];
    if (i >= 0)
    {
      k = j + H[i];
      if (k < n && k - i == H[k])
        s[i].insert(std::pair<int, int>(j, k));

      k = i + H[i];
      if (k < n && k > j && H[k] == k - j)
        s[i].insert(std::pair<int, int>(j, k));
    }

    k = j + H[j];
    if (k < n)
    {
      i = j - H[k];
      if (i >= 0 && k - i == H[i])
        s[i].insert(std::pair<int, int>(j, k));
      i = k - H[k];
      if (i >= 0 && i < j && j - i == H[i])
        s[i].insert(std::pair<int, int>(j, k));
    }
  }

  std::vector<std::vector<int>> p(n, std::vector<int>());
  for (int i = n - 1; i >= 0; i--)
  {
    int j;
    if (i + H[i] < n)
    {
      for (int k : p[i + H[i]])
      {
        j = i + H[i];
        if (j < k && H[j] == k - i)
          s[i].insert(std::pair<int, int>(j, k));
        j = i + H[k];
        if (j < k && H[j] == k - i)
          s[i].insert(std::pair<int, int>(j, k));
      }
    }
    if (i - H[i] >= 0)
      p[i - H[i]].push_back(i);
  }

  long long ans = 0;
  for (int i = 0; i < s.size(); i++)
  {
    ans += s[i].size();
  }

  return ans;
}

int array[] = {3, 1, 2, 1, 4, 3, 2};

std::vector<int> construct_range(int M, int K)
{
  std::vector<int> ans(M, 1);
  for (int i = 0; i < M; i++)
  {
    ans[i] = array[i % 7];
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 6 / 6
• Subtask 3: 10 / 10
• Subtask 4: 11 / 11
• Subtask 5: 16 / 16
• Subtask 6: 19 / 19
• Subtask 7: 5 / 5
• Subtask 8: 2.13 / 5
• Subtask 9: 0.8568 / 5
• Subtask 10: 0.3673 / 5
• Subtask 11: 0.4286 / 5
• Subtask 12: 0.1429 / 5