#432922 (C++17) No.995 タピオカオイシクナーレ

提出ソース

結果

問題	No.995 タピオカオイシクナーレ
ユーザー	Haar
提出日時	2020-02-21 22:28:48
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	15 ms / 2,000 ms
コード長	8,111 bytes
コンパイル時間	2,064 ms
コンパイル使用メモリ	201,144 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-04-17 08:09:44
合計ジャッジ時間	3,164 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	1 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	1 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	15 ms 5,376 KB
testcase_17	AC	14 ms 5,376 KB
testcase_18	AC	15 ms 5,376 KB
testcase_19	AC	15 ms 5,376 KB
testcase_20	AC	15 ms 5,376 KB
testcase_21	AC	15 ms 5,376 KB
testcase_22	AC	14 ms 5,376 KB
testcase_23	AC	15 ms 5,376 KB
testcase_24	AC	15 ms 5,376 KB
testcase_25	AC	15 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif

using namespace std;

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T> void puts_all(const T &value){std::cout << value << "\n";}
template <typename T, typename ...Args> void puts_all(const T &value, const Args&... args){std::cout << value << " ";puts_all(args...);}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}
template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));}


struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


template <uint32_t M> class ModInt{
public:
  uint64_t val;
  
  constexpr ModInt(): val(0){}
  constexpr ModInt(std::int64_t n){
    if(n >= M) val = n % M;
    else if(n < 0) val = n % M + M;
    else val = n;
  }
  
  inline constexpr auto operator+(const ModInt &a) const {return ModInt(val + a.val);}
  inline constexpr auto operator-(const ModInt &a) const {return ModInt(val - a.val);}
  inline constexpr auto operator*(const ModInt &a) const {return ModInt(val * a.val);}
  inline constexpr auto operator/(const ModInt &a) const {return ModInt(val * a.inv().val);}
  
  inline constexpr auto& operator=(const ModInt &a){val = a.val; return *this;}
  inline constexpr auto& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;}
  inline constexpr auto& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}
  inline constexpr auto& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;}
  inline constexpr auto& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;}
 
  inline constexpr bool operator==(const ModInt &a) const {return val == a.val;}
  inline constexpr bool operator!=(const ModInt &a) const {return val != a.val;}
 
  inline constexpr auto& operator++(){*this += 1; return *this;}
  inline constexpr auto& operator--(){*this -= 1; return *this;}
 
  inline constexpr auto operator++(int){auto t = *this; *this += 1; return t;}
  inline constexpr auto operator--(int){auto t = *this; *this -= 1; return t;}
 
  inline constexpr static ModInt power(int64_t n, int64_t p){
    if(p < 0) return power(n, -p).inv();
    
    int64_t ret = 1, e = n;
    for(; p; (e *= e) %= M, p >>= 1) if(p & 1) (ret *= e) %= M;
    return ret;
  }
 
  inline 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;
  }
 
  inline constexpr static auto frac(int64_t a, int64_t b){return ModInt(a) / ModInt(b);}
  
  inline constexpr auto power(int64_t p) const {return power(val, p);}
  inline constexpr auto inv() const {return inv(val);}
 
  friend inline constexpr auto operator-(const ModInt &a){return ModInt(-a.val);}
 
  friend inline constexpr auto operator+(int64_t a, const ModInt &b){return ModInt(a) + b;}
  friend inline constexpr auto operator-(int64_t a, const ModInt &b){return ModInt(a) - b;}
  friend inline constexpr auto operator*(int64_t a, const ModInt &b){return ModInt(a) * b;}
  friend inline constexpr auto operator/(int64_t a, const ModInt &b){return ModInt(a) / b;}
 
  friend std::istream& operator>>(std::istream &s, ModInt<M> &a){s >> a.val; return s;}
  friend std::ostream& operator<<(std::ostream &s, const ModInt<M> &a){s << a.val; return s;}
};

template <typename T, int N> struct SquareMatrix{
  std::array<std::array<T,N>,N> matrix;

  SquareMatrix(){
    for(size_t i = 0; i < N; ++i) for(size_t j = 0; j < N; ++j) matrix[i][j] = 0;
  }
  SquareMatrix(const T &val){
    for(size_t i = 0; i < N; ++i) matrix[i].fill(val);
  }
  SquareMatrix(std::initializer_list<std::initializer_list<T>> list){
    int i = 0;
    for(auto it1 = list.begin(); it1 != list.end(); ++it1, ++i){
      int j = 0;
      for(auto it2 = it1->begin(); it2 != it1->end(); ++it2, ++j){
        matrix[i][j] = *it2;
      }
    }
  }

  bool operator==(const SquareMatrix<T,N> &val) const {return matrix == val.matrix;}
  bool operator!=(const SquareMatrix<T,N> &val) const {return !(*this == val);}

  auto& operator=(const SquareMatrix &val){
    this->matrix = val.matrix;
    return *this;
  }

  auto& operator+=(const SquareMatrix &val){
    for(size_t i = 0; i < N; ++i) for(size_t j = 0; j < N; ++j) matrix[i][j] = matrix[i][j] + val[i][j];
    return *this;
  }

  auto& operator-=(const SquareMatrix &val){
    for(size_t i = 0; i < N; ++i) for(size_t j = 0; j < N; ++j) matrix[i][j] = matrix[i][j] - val[i][j];
    return *this;
  }

  auto& operator*=(const SquareMatrix &val){
    std::array<std::array<T,N>,N> temp = {};
    for(size_t i = 0; i < N; ++i) for(size_t j = 0; j < N; ++j) for(size_t k = 0; k < N; ++k) temp[i][j] = temp[i][j] + matrix[i][k] * val[k][j];
    std::swap(matrix, temp);
    return *this;
  }

  inline const auto& operator[](size_t i) const {return matrix[i];}
  inline auto& operator[](size_t i){return matrix[i];}
  inline int size() const {return N;}
  
  static auto make_unit(){
    SquareMatrix<T,N> ret;
    for(size_t i = 0; i < N; ++i) ret[i][i] = 1;
    return ret;
  }
  
  auto transpose() const {
    SquareMatrix<T,N> ret;
    for(size_t i = 0; i < N; ++i) for(size_t j = 0; j < N; ++j) ret[i][j] = matrix[j][i];
    return ret;
  }
 
  void show(int w = 10) const {
#ifdef DEBUG
    std::cerr << "⎛" << std::string((w+1)*N, ' ') << "⎞" << std::endl;
    for(size_t i = 0; i < N; ++i){
      std::cerr << "⎜";
      for(size_t j = 0; j < N; ++j) std::cerr << std::setw(w) << matrix[i][j] << " ";
      std::cerr << "⎟";
      std::cerr << std::endl;
    }
    std::cerr << "⎝" << std::string((w+1)*N, ' ') << "⎠" << std::endl;
#endif
  }
};

template <typename T, int N> auto operator+(const SquareMatrix<T,N> &a, const SquareMatrix<T,N> &b){auto ret = a; ret += b; return ret;}
template <typename T, int N> auto operator-(const SquareMatrix<T,N> &a, const SquareMatrix<T,N> &b){auto ret = a; ret -= b; return ret;}
template <typename T, int N> auto operator*(const SquareMatrix<T,N> &a, const SquareMatrix<T,N> &b){auto ret = a; ret *= b; return ret;}

template <typename T, int N> SquareMatrix<T,N> power(SquareMatrix<T,N> a, uint64_t p){
  if(p == 0) return SquareMatrix<T,N>::make_unit();
  if(p == 1) return a;
  
  auto temp = power(a, p/2);
  auto ret = temp * temp;

  if(p%2) ret *= a;
 
  return ret;
}


using mint = ModInt<1000000007>;
using Mat = SquareMatrix<mint, 2>;

int main(){
  LLI N, M, K, p, q; cin >> N >> M >> K >> p >> q;
  vector<LLI> b(N); cin >> b;

  mint pr = mint::frac(p, q);
  
  mint ans = 0;

  Mat a = {{1 - pr, pr}, {pr, 1 - pr}};
  a = power(a, K);

  REP(i,M){
    ans += b[i] * a[0][0];
  }

  FOR(i,M,N){
    ans += b[i] * a[0][1];
  }

  puts_all(ans);

  return 0;
}

yukicoder

結果

テストケース

ソースコード