結果

問題 No.1810 RGB Biscuits
ユーザー stoqstoq
提出日時 2022-01-14 21:59:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 72 ms / 2,000 ms
コード長 6,365 bytes
コンパイル時間 5,676 ms
コンパイル使用メモリ 297,648 KB
実行使用メモリ 15,104 KB
最終ジャッジ日時 2024-11-20 10:03:57
合計ジャッジ時間 7,619 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
14,904 KB
testcase_01 AC 35 ms
14,968 KB
testcase_02 AC 32 ms
14,988 KB
testcase_03 AC 32 ms
14,976 KB
testcase_04 AC 32 ms
14,968 KB
testcase_05 AC 67 ms
14,936 KB
testcase_06 AC 70 ms
15,104 KB
testcase_07 AC 72 ms
14,908 KB
testcase_08 AC 70 ms
14,976 KB
testcase_09 AC 72 ms
14,976 KB
testcase_10 AC 56 ms
14,976 KB
testcase_11 AC 33 ms
14,976 KB
testcase_12 AC 34 ms
14,976 KB
testcase_13 AC 34 ms
14,976 KB
testcase_14 AC 38 ms
14,976 KB
testcase_15 AC 33 ms
14,976 KB
testcase_16 AC 36 ms
14,968 KB
testcase_17 AC 50 ms
15,104 KB
testcase_18 AC 51 ms
15,104 KB
testcase_19 AC 33 ms
14,976 KB
testcase_20 AC 32 ms
14,904 KB
testcase_21 AC 36 ms
15,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

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

#include <atcoder/all>
//#include <atcoder/modint>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 1
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(1000010);

#pragma endregion

// -------------------------------

using Matrix = vector<vector<mint>>;

ostream &operator<<(ostream &os, Matrix &A) noexcept {
  rep(i, A.size()) {
    rep(j, A[0].size()) {
      cout << A[i][j] << (j + 1 == A[0].size() ? "\n" : " ");
    }
  }
  return os;
}

Matrix E(int n) {
  Matrix res(n, vector<mint>(n));
  rep(i, n) rep(j, n) {
    if (i == j)
      res[i][j] = 1;
    else
      res[i][j] = 0;
  }
  return res;
}

Matrix matprod(Matrix A, Matrix B) {
  assert(A[0].size() == B.size());
  int l = A.size(), m = A[0].size(), n = B[0].size();
  Matrix C(l, vector<mint>(n, 0));
  rep(i, l) rep(j, n) { rep(k, m) C[i][j] += A[i][k] * B[k][j]; }
  return C;
}

Matrix matpow(Matrix A, ll n) {
  assert(n >= 0);
  Matrix res = E(A.size()), P = A;
  while (n > 0) {
    if (n & 1) res = matprod(res, P);
    P = matprod(P, P);
    n >>= 1;
  }
  return res;
}

void solve() {
  ll a, b;
  cin >> a >> b;
  Matrix A(3, vector<mint>(3));
  Matrix B(3, vector<mint>(3));
  A[0][0] = A[1][1] = A[2][2] = 1;
  A[2][0] = a, A[2][1] = b;
  B[0][2] = B[1][0] = 1;
  auto C = matprod(B, A);
  int n;
  cin >> n;
  rep(ti, n) {
    Matrix x(3, vector<mint>(1));
    x[0][0] = x[1][0] = 1;
    ll t;
    cin >> t;
    Matrix D;
    if (t % 2 == 0) {
      D = matpow(C, t / 2);
    } else {
      D = matpow(C, (t - 1) / 2);
      D = matprod(A, D);
    }
    x = matprod(D, x);
    mint sum = 0;
    rep(i, 3) sum += x[i][0];
    cout << sum << "\n";
  }
}

int main() { solve(); }
0