test/yukicoder/658/main.test.cpp

View this file on GitHub
Last update: 2021-04-23 23:44:44+09:00
Problem: https://yukicoder.me/problems/no/658
Link: View error logs on GitHub Actions

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/no/658"

#include <iostream>
#include "Mylib/DynamicProgramming/SpeedupTechnique/kitamasa_algorithm.cpp"
#include "Mylib/IO/input_tuples.cpp"
#include "Mylib/Number/Mint/mint.cpp"

namespace hl = haar_lib;

using mint = hl::modint<17>;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int Q;
  std::cin >> Q;

  for (auto [N] : hl::input_tuples<int64_t>(Q)) {
    hl::kitamasa_algorithm<mint> ka(4, {0, 0, 0, 1}, {1, 1, 1, 1});
    std::cout << ka[N - 1] << std::endl;
  }

  return 0;
}

#line 1 "test/yukicoder/658/main.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/658"

#include <iostream>
#line 2 "Mylib/DynamicProgramming/SpeedupTechnique/kitamasa_algorithm.cpp"
#include <cstdint>
#include <vector>

namespace haar_lib {
  template <typename T>
  class kitamasa_algorithm {
    int size_;
    std::vector<T> initial_values_, coeff_;

  public:
    kitamasa_algorithm() {}
    kitamasa_algorithm(int size, const std::vector<T> &initial_values, const std::vector<T> &coeff) : size_(size), initial_values_(initial_values), coeff_(coeff) {}

    std::vector<T> inc(const std::vector<T> &a) const {
      std::vector<T> ret(size_);

      for (int i = 0; i < size_; ++i) ret[i] += a[size_ - 1] * coeff_[i];
      for (int i = 1; i < size_; ++i) ret[i] += a[i - 1];

      return ret;
    }

    std::vector<T> dbl(const std::vector<T> &a) const {
      std::vector<T> ret(size_), b(a);

      for (int j = 0; j < size_; ++j) {
        for (int i = 0; i < size_; ++i) {
          ret[i] += a[j] * b[i];
        }

        b = inc(b);
      }

      return ret;
    }

    T eval(const std::vector<T> &v) const {
      T ret = 0;
      for (int i = 0; i < size_; ++i) ret += v[i] * initial_values_[i];
      return ret;
    }

    std::vector<T> get(int64_t index) const {
      std::vector<T> ret(size_);
      ret[0] = 1;

      bool check = false;
      for (int i = 63; i >= 0; --i) {
        if (check) ret = dbl(ret);

        if (index & (1LL << i)) {
          ret   = inc(ret);
          check = true;
        }
      }

      return ret;
    }

    T operator[](int64_t index) const {
      if (index < size_) return initial_values_[index];
      return eval(get(index));
    }
  };
}  // namespace haar_lib
#line 2 "Mylib/IO/input_tuples.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuples.cpp"
#include <tuple>
#include <utility>
#line 6 "Mylib/IO/input_tuple.cpp"

namespace haar_lib {
  template <typename T, size_t... I>
  static void input_tuple_helper(std::istream &s, T &val, std::index_sequence<I...>) {
    (void) std::initializer_list<int>{(void(s >> std::get<I>(val)), 0)...};
  }

  template <typename T, typename U>
  std::istream &operator>>(std::istream &s, std::pair<T, U> &value) {
    s >> value.first >> value.second;
    return s;
  }

  template <typename... Args>
  std::istream &operator>>(std::istream &s, std::tuple<Args...> &value) {
    input_tuple_helper(s, value, std::make_index_sequence<sizeof...(Args)>());
    return s;
  }
}  // namespace haar_lib
#line 8 "Mylib/IO/input_tuples.cpp"

namespace haar_lib {
  template <typename... Args>
  class InputTuples {
    struct iter {
      using value_type = std::tuple<Args...>;
      value_type value;
      bool fetched = false;
      int N, c = 0;

      value_type operator*() {
        if (not fetched) {
          std::cin >> value;
        }
        return value;
      }

      void operator++() {
        ++c;
        fetched = false;
      }

      bool operator!=(iter &) const {
        return c < N;
      }

      iter(int N) : N(N) {}
    };

    int N;

  public:
    InputTuples(int N) : N(N) {}

    iter begin() const { return iter(N); }
    iter end() const { return iter(N); }
  };

  template <typename... Args>
  auto input_tuples(int N) {
    return InputTuples<Args...>(N);
  }
}  // namespace haar_lib
#line 4 "Mylib/Number/Mint/mint.cpp"

namespace haar_lib {
  template <int32_t M>
  class modint {
    uint32_t val_;

  public:
    constexpr static auto mod() { return M; }

    constexpr modint() : val_(0) {}
    constexpr modint(int64_t n) {
      if (n >= M)
        val_ = n % M;
      else if (n < 0)
        val_ = n % M + M;
      else
        val_ = n;
    }

    constexpr auto &operator=(const modint &a) {
      val_ = a.val_;
      return *this;
    }
    constexpr auto &operator+=(const modint &a) {
      if (val_ + a.val_ >= M)
        val_ = (uint64_t) val_ + a.val_ - M;
      else
        val_ += a.val_;
      return *this;
    }
    constexpr auto &operator-=(const modint &a) {
      if (val_ < a.val_) val_ += M;
      val_ -= a.val_;
      return *this;
    }
    constexpr auto &operator*=(const modint &a) {
      val_ = (uint64_t) val_ * a.val_ % M;
      return *this;
    }
    constexpr auto &operator/=(const modint &a) {
      val_ = (uint64_t) val_ * a.inv().val_ % M;
      return *this;
    }

    constexpr auto operator+(const modint &a) const { return modint(*this) += a; }
    constexpr auto operator-(const modint &a) const { return modint(*this) -= a; }
    constexpr auto operator*(const modint &a) const { return modint(*this) *= a; }
    constexpr auto operator/(const modint &a) const { return modint(*this) /= a; }

    constexpr bool operator==(const modint &a) const { return val_ == a.val_; }
    constexpr bool operator!=(const modint &a) const { return val_ != a.val_; }

    constexpr auto &operator++() {
      *this += 1;
      return *this;
    }
    constexpr auto &operator--() {
      *this -= 1;
      return *this;
    }

    constexpr auto operator++(int) {
      auto t = *this;
      *this += 1;
      return t;
    }
    constexpr auto operator--(int) {
      auto t = *this;
      *this -= 1;
      return t;
    }

    constexpr static modint pow(int64_t n, int64_t p) {
      if (p < 0) return pow(n, -p).inv();

      int64_t ret = 1, e = n % M;
      for (; p; (e *= e) %= M, p >>= 1)
        if (p & 1) (ret *= e) %= M;
      return ret;
    }

    constexpr static modint inv(int64_t a) {
      int64_t b = M, u = 1, v = 0;

      while (b) {
        int64_t t = a / b;
        a -= t * b;
        std::swap(a, b);
        u -= t * v;
        std::swap(u, v);
      }

      u %= M;
      if (u < 0) u += M;

      return u;
    }

    constexpr static auto frac(int64_t a, int64_t b) { return modint(a) / modint(b); }

    constexpr auto pow(int64_t p) const { return pow(val_, p); }
    constexpr auto inv() const { return inv(val_); }

    friend constexpr auto operator-(const modint &a) { return modint(M - a.val_); }

    friend constexpr auto operator+(int64_t a, const modint &b) { return modint(a) + b; }
    friend constexpr auto operator-(int64_t a, const modint &b) { return modint(a) - b; }
    friend constexpr auto operator*(int64_t a, const modint &b) { return modint(a) * b; }
    friend constexpr auto operator/(int64_t a, const modint &b) { return modint(a) / b; }

    friend std::istream &operator>>(std::istream &s, modint &a) {
      s >> a.val_;
      return s;
    }
    friend std::ostream &operator<<(std::ostream &s, const modint &a) {
      s << a.val_;
      return s;
    }

    template <int N>
    static auto div() {
      static auto value = inv(N);
      return value;
    }

    explicit operator int32_t() const noexcept { return val_; }
    explicit operator int64_t() const noexcept { return val_; }
  };
}  // namespace haar_lib
#line 7 "test/yukicoder/658/main.test.cpp"

namespace hl = haar_lib;

using mint = hl::modint<17>;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int Q;
  std::cin >> Q;

  for (auto [N] : hl::input_tuples<int64_t>(Q)) {
    hl::kitamasa_algorithm<mint> ka(4, {0, 0, 0, 1}, {1, 1, 1, 1});
    std::cout << ka[N - 1] << std::endl;
  }

  return 0;
}

kyopro-lib

This documentation is automatically generated by online-judge-tools/verification-helper

test/yukicoder/658/main.test.cpp

Depends on

Code