【CF 954 H】Path Counting（DP）

Description

click me

Solution

求出$f_{i,j}$表示与第$i$层的点距离为$j$的点的个数。

直接记数即可。
记得开滚动。。

Source

/************************************************
 * Hack me if you can
 * Au: Hany01
 * Date: Mar 22nd, 2018
 * Contest: ECR Round40
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("cf954h.in", "r", stdin);
    freopen("cf954h.out", "w", stdout);
#endif
}

const int maxn = 5005;

int n;
LL a[maxn], f[maxn][3], g[maxn][3];

inline LL Pow(LL a, LL b) {
    LL Ans = 1;
    for ( ; b; b >>= 1, a = (a * a) % Mod) if (b & 1) (Ans *= a) %= Mod;
    return Ans;
}

int main()
{
    File();

    n = read();
    For(i, 1, n - 1) a[i] = read();

    For(i, 1, n) f[i][1] = i == 1 ? 0 : 1, g[i][1] = a[i], g[i][0] = 1;

    LL inv2 = Pow(2, Mod - 2);
    For(i, 1, 2 * n - 2) {
        LL Ans = 0, now = 1;
        int t = (i - 1) % 3;
        if (i > 2) {
            For(i, 1, n) {
                if (i > 1) f[i][t] = (f[i - 1][(t + 2) % 3] + g[i][(t + 1) % 3] * (a[i - 1] - 1) % Mod) % Mod;
                else f[i][t] = 0;
                g[i][t] = g[i + 1][(t + 2) % 3] * a[i] % Mod;
            }
        }
        For(dep, 1, n) {
            if (i == 1) {
                (Ans += (LL)(f[dep][1] + g[dep][1]) * now % Mod) %= Mod;
                (now *= a[dep]) %= Mod;
                continue;
            }
            if (i == 2) {
                (Ans += (LL)(f[dep][1] + g[dep][1]) % Mod * (LL)(f[dep][1] + g[dep][1] - 1) % Mod * now % Mod) %= Mod;
                (now *= a[dep]) %= Mod;
                continue;
            }
            (Ans += (LL)(f[dep][t] + g[dep][t]) % Mod * (LL)((dep == 1 ? 0 : 1) + a[dep] - 1) % Mod * (LL)now % Mod) %= Mod;
            (now *= a[dep]) %= Mod;
        }
        (Ans *= inv2) %= Mod;
        cout << Ans << ' ';
    }

    return 0;
}
//中国各处是壁，然而无形，像‘鬼打墻’一般，使你随时能‘碰’，能打这墻的，
//能碰而不感到痛苦的，是胜利者。 
//  --《碰壁之后》一九二五年，鲁迅