結果
問題 | No.1521 Playing Musical Chairs Alone |
ユーザー |
|
提出日時 | 2021-05-28 20:32:15 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 3,016 bytes |
コンパイル時間 | 3,384 ms |
コンパイル使用メモリ | 133,884 KB |
最終ジャッジ日時 | 2025-01-21 19:07:30 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <iostream>#include <algorithm>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = unsigned;using u64 = unsigned long long;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;template <u32 M>struct modint {u32 val;public:static modint raw(int v) { modint x; x.val = v; return x; }modint() : val(0) {}template <class T>modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }modint(bool v) { val = ((unsigned int)(v) % M); }modint& operator++() { val++; if (val == M) val = 0; return *this; }modint& operator--() { if (val == 0) val = M; val--; return *this; }modint operator++(int) { modint result = *this; ++*this; return result; }modint operator--(int) { modint result = *this; --*this; return result; }modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; }modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; }modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; }modint& operator/=(const modint& b) { return *this = *this * b.inv(); }modint operator+() const { return *this; }modint operator-() const { return modint() - *this; }modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }modint inv() const { return pow(M-2); }friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; }friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; }friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; }friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; }friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; }friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; }};using mint = modint<MOD>;template <class T>T pow_ (T x, T n, T M){uint64_t u = 1, xx = x;while (n > 0){if (n&1) u = u * xx % M;xx = xx * xx % M;n >>= 1;}return static_cast<T>(u);};int main() {int n, k, l;cin >> n >> k >> l;vector<mint> t(n);for (int i = 1; i <= l; ++i) {t[i%n]++;}auto merge = [&](vector<mint> L, vector<mint> R){vector<mint> ans(n);for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {ans[(i+j)%n] += L[i]*R[j];}}return ans;};vector<mint> u(n), xx = t;u[0] = 1;while (k > 0){if (k&1) u = merge(u, xx);xx = merge(xx, xx);k >>= 1;}for (int i = 0; i < n; ++i) {printf("%d\n", u[i].val);}return 0;}