E - Counting Sequences 2019年ICPC 上海网络赛 指数型生成函数

Counting Sequences

solution

$序列[a_1,a_2,a_3...,a_n],(a_i\in [1,m])，问序列中a_i为偶数的个数非奇有几种$

$考虑生成函数：$
$$T=(1+\frac{x^2}{2!}+\frac{x^4}{4!}+\frac{x^6}{6!}+...{)}^{\frac{m}{2}}\ast (1+\frac{x}{1!}+\frac{x^2}{2!}+\frac{x^3}{3!}+...{)}^{\frac{m+1}{2}}$$$$[let\frac{m}{2}=\frac{m+1}{2}forthetimebeing]$$

$由于偶数个数非奇，只能出现0，2，4...，即第一项,$

$而奇数个数，可以出现0，1，2，3，4...，即第二项.$

$$T=(\frac{e^x+e^{-x}}{2}\ast e^x{)}^{m/2}=(\frac{e^{2x}+1}{2}{)}^{m/2}=\frac{1}{2^{m/2}}(e^{2x}+1{)}^{m/2}$$

$二项式展开：$

$$T=\frac{1}{2^{m/2}}\sum _{i=0}^{m/2}{C}_{m/2}^i{e}^{2ix}$$

$幂级数展开：$

$if\frac{m}{2}=\frac{m+1}{2}:$
$$T=\frac{1}{2^{m/2}}\sum _{i=0}^{m/2}{C}_{m/2}^i\sum _{n=0}^{\infty }{(2i)}^n\frac{x^n}{n!}$$

$if\frac{m}{2}+1=\frac{m+1}{2}:$
$$T=\frac{1}{2^{m/2}}\sum _{i=0}^{m/2}{C}_{m/2}^i\sum _{n=0}^{\infty }{(2i+1)}^n\frac{x^n}{n!}$$

$于是，每一个\frac{x^n}{n!}的系数即我们要的答案累加即可.$

code

/*SiberianSquirrel*//*CuteKiloFish*/
#include <bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (1ll * a * b / gcd(a, b))
#define Polynomial vector<int>
#define Inv(x) quick_pow(x, mod - 2)
#define DEBUG(x, y) cout << x << ": " << y << '\n';
using ld = long double;
using ll = long long;
using ull = unsigned long long;
//const ll mod = 998244353, mod_g = 3, img = 86583718;
const ll mod = 1000000007;
const ld pi = acos(-1.0);
template<typename T> inline T read() {
    T x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
    return x * f;
}
template<typename T> inline T print(T x) {
    if(x < 0) { putchar('-'); x =- x; }
    if(x > 9) print(x / 10);
    putchar(x % 10 + '0');
}

ll fac[int(2e5 + 10)] = {1}, ifac[int(2e5 + 10)] = {1};

ll quick_pow(ll ans, ll p, ll res = 1) {
    for(; p; p >>= 1, ans = ans * ans % mod)
        if(p & 1) res = res * ans % mod;
    return res % mod;
}

ll C(ll n, ll m) {
    if(m == 0 || n == m) return 1;
    if(n < m) return 0;
    return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

inline void solve() {
    for(int i = 1; i <= int(2e5); ++ i) fac[i] = fac[i - 1] * i % mod, ifac[i] = Inv(fac[i]);
    int o; cin >> o; while(o --) {
        ll n, m, res = 0; cin >> n >> m;
        for(int i = 0; i <= m / 2; ++ i) {
            res = (res + C(m / 2, i) * quick_pow(2 * i + (m & 1), n % (mod - 1)) % mod) % mod;
        }
        cout << Inv(quick_pow(2, m / 2)) * res % mod << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
//    freopen("output", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}