tests/triangular_array_compressor.test.cpp

• View this file on GitHub
• Last update: 2025-06-08 00:56:00+09:00

Depends on

• Assertion macro (tools/assert_that.hpp)
• One-to-one mapping from a triangular array to a one-dimensional array (tools/triangular_array_compressor.hpp)

Code

// competitive-verifier: STANDALONE

#include <functional>
#include <iostream>
#include "tools/assert_that.hpp"
#include "tools/triangular_array_compressor.hpp"

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);

  for (int n = 0; n <= 7; ++n) {
    {
      tools::triangular_array_compressor<std::less<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n - 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= i2 && i2 < j2 && j2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::less_equal<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n + 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= i2 && i2 <= j2 && j2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::greater<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n - 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= j2 && j2 < i2 && i2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::greater_equal<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= i; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n + 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= j2 && j2 <= i2 && i2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
  }

  return 0;
}

#line 1 "tests/triangular_array_compressor.test.cpp"
// competitive-verifier: STANDALONE

#include <functional>
#include <iostream>
#line 1 "tools/assert_that.hpp"



#line 5 "tools/assert_that.hpp"
#include <cstdlib>

#define assert_that_impl(cond, file, line, func) do {\
  if (!cond) {\
    ::std::cerr << file << ':' << line << ": " << func << ": Assertion `" << #cond << "' failed." << '\n';\
    ::std::exit(EXIT_FAILURE);\
  }\
} while (false)
#define assert_that(...) assert_that_impl((__VA_ARGS__), __FILE__, __LINE__, __func__)


#line 1 "tools/triangular_array_compressor.hpp"



#include <cassert>
#line 6 "tools/triangular_array_compressor.hpp"
#include <utility>

namespace tools {
  template <typename Compare>
  class triangular_array_compressor;

  template <>
  class triangular_array_compressor<::std::less<int>> {
    int m_size;

  public:
    triangular_array_compressor() = default;
    triangular_array_compressor(const int n) : m_size(n) {
      assert(n >= 0);
    }

    int size() const {
      return m_size;
    }

    int compress(const int i, const int j) const {
      const auto& n = this->m_size;
      assert(0 <= i && i < j && j < n);
      return (i >= (n + 1) / 2 ? (n - 1 - i) * (n - 1) - 1 : i * (n - 2) - 1) + j;
    }

    ::std::pair<int, int> decompress(const int k) const {
      const auto& n = this->m_size;
      assert(0 <= k && k < n * (n - 1) / 2);
      auto i = k / (n - 1);
      auto j = k % (n - 1);
      if (j < n - 1 - i) {
        j += i + 1;
      } else {
        i = n - 1 - i;
        ++j;
      }
      return {i, j};
    }
  };

  template <>
  class triangular_array_compressor<::std::less_equal<int>> {
    int m_size;

  public:
    triangular_array_compressor() = default;
    triangular_array_compressor(const int n) : m_size(n) {
      assert(n >= 0);
    }

    int size() const {
      return m_size;
    }

    int compress(const int i, const int j) const {
      const auto& n = this->m_size;
      assert(0 <= i && i <= j && j < n);
      return (i >= (n + 1) / 2 ? (n - 1 - i) * (n + 1) + 1 : i * n) + j;
    }

    ::std::pair<int, int> decompress(const int k) const {
      const auto& n = this->m_size;
      assert(0 <= k && k < n * (n + 1) / 2);
      auto i = k / (n + 1);
      auto j = k % (n + 1);
      if (j < n - i) {
        j += i;
      } else {
        i = n - 1 - i;
        --j;
      }
      return {i, j};
    }
  };

  template <>
  class triangular_array_compressor<::std::greater<int>> {
    int m_size;

  public:
    triangular_array_compressor() = default;
    triangular_array_compressor(const int n) : m_size(n) {
      assert(n >= 0);
    }

    int size() const {
      return m_size;
    }

    int compress(const int i, const int j) const {
      const auto& n = this->m_size;
      assert(0 <= j && j < i && i < n);
      return (i >= (n + 1) / 2 ? (n - 1 - i) * n : i * (n - 1)) + j;
    }

    ::std::pair<int, int> decompress(const int k) const {
      const auto& n = this->m_size;
      assert(0 <= k && k < n * (n - 1) / 2);
      auto i = k / (n - 1);
      auto j = k % (n - 1);
      if (i <= j) {
        j -= i;
        i = n - 1 - i;
      }
      return {i, j};
    }
  };

  template <>
  class triangular_array_compressor<::std::greater_equal<int>> {
    int m_size;

  public:
    triangular_array_compressor() = default;
    triangular_array_compressor(const int n) : m_size(n) {
      assert(n >= 0);
    }

    int size() const {
      return m_size;
    }

    int compress(const int i, const int j) const {
      const auto& n = this->m_size;
      assert(0 <= j && j <= i && i < n);
      return (i >= (n + 1) / 2 ? (n - 1 - i) * (n + 1) + n - i : i * (n + 1)) + j;
    }

    ::std::pair<int, int> decompress(const int k) const {
      const auto& n = this->m_size;
      assert(0 <= k && k < n * (n + 1) / 2);
      auto i = k / (n + 1);
      auto j = k % (n + 1);
      if (i + 1 <= j) {
        j -= i + 1;
        i = n - 1 - i;
      }
      return {i, j};
    }
  };
}


#line 7 "tests/triangular_array_compressor.test.cpp"

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);

  for (int n = 0; n <= 7; ++n) {
    {
      tools::triangular_array_compressor<std::less<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n - 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= i2 && i2 < j2 && j2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::less_equal<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n + 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= i2 && i2 <= j2 && j2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::greater<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n - 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= j2 && j2 < i2 && i2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
    {
      tools::triangular_array_compressor<std::greater_equal<int>> f(n);
      assert_that(f.size() == n);
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= i; ++j) {
          const auto k = f.compress(i, j);
          assert_that(0 <= k && k < n * (n + 1) / 2);
          const auto [i2, j2] = f.decompress(k);
          assert_that(0 <= j2 && j2 <= i2 && i2 < n);
          assert_that(i == i2 && j == j2);
        }
      }
    }
  }

  return 0;
}

Back to top page