結果

問題 No.563 超高速一人かるた large
コンテスト
ユーザー paruki
提出日時 2017-09-11 17:10:40
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,925 bytes
コンパイル時間 2,309 ms
コンパイル使用メモリ 183,552 KB
実行使用メモリ 55,424 KB
最終ジャッジ日時 2024-11-07 16:58:01
合計ジャッジ時間 5,644 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 1 WA * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define rt return
using dbl = double;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        if (value == 0)return 0;
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

struct RollingHash {
    static const int C = 31, C2 = 29, P = 1000000007, P2 = 1000000009;
    int _n;
    vector<long long> pw, pw2, hs, hs2;

    RollingHash() {}
    RollingHash(const string &st)
        :_n((int)st.size()), pw(_n + 1), pw2(_n + 1), hs(_n + 1), hs2(_n + 1)
    {
        pw[0] = pw2[0] = 1;
        rep(i, _n) {
            pw[i + 1] = (pw[i] * C) % P;
            pw2[i + 1] = (pw2[i] * C2) % P2;
            hs[i + 1] = (C*hs[i] + st[i]) % P;
            hs2[i + 1] = (C2*hs2[i] + st[i]) % P2;
        }
    }

    // [l, r)
    pii getHash(int l, int r) {
        int res, res2;
        res = (hs[r] - hs[l] * pw[r - l]) % P;
        res2 = (hs2[r] - hs2[l] * pw2[r - l]) % P2;
        if (res < 0)res += P;
        if (res2 < 0)res2 += P2;
        return mp(res, res2);
    }
};

vector<vector<int>> combinations(int n, int mod) {
    auto res = vector<vector<int>>(n + 1, vector<int>(n + 1));
    rep(i, n + 1) res[i][0] = 1;
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= i; ++j)
        res[i][j] = (res[i - 1][j - 1] + res[i - 1][j]) % mod;
    return res;
}

const int MO = (int)1e9 + 7;
string S[2001];
RollingHash rh[2001];
int f[2001][2001], g[2001][2001];
mint ans[2001], fact[2001];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    rep(i, N) {
        cin >> S[i];
    }
    sort(S, S + N);
    rep(i, N) {
        rh[i] = RollingHash(S[i]);
    }

    rep(i, N)rep(j, N) {
        if (i == j)f[i][j] = 1;
        else if (i > j)f[i][j] = f[j][i];
        else {
            int ok = 0, ng = min(sz(S[i]), sz(S[j])) + 1, mid;
            while (ng - ok > 1) {
                mid = (ok + ng) / 2;
                (rh[i].getHash(0, mid) == rh[j].getHash(0, mid) ? ok : ng) = mid;
            }
            f[i][j] = ng;
        }
    }

    rep(b, N)g[0][b + 1] = f[b][b + 1];
    f[N - 1][N] = 1;
    // g[0][N] = 0
    rep(a, N)FOR(b, a + 1, N) {
        g[a + 1][b + 1] = f[a][b] + f[b][b + 1];
    }

    auto C = combinations(N + 10, MO);

    for (int ba = 1; ba <= N; ++ba) {
        mint sm;
        // 取ってないのがa
        // a+baを次に取る
        for (int a = 0; a + ba < N; ++a) {
            sm += max(f[a][a + ba], f[a + ba][a + ba + 1]);
        }
        // 全体でK個取る
        for (int K = ba; K <= N - 1; ++K) {

            if (ba != N)ans[K - 1] += sm * C[N - ba - 1][K - ba];
        }

    }

    for (int b = 0; b < N; ++b) {
        for (int K = b+1; K <= N; ++K) {
            ans[K - 1] += f[b][b + 1] * C[N - b - 1][K - b - 1];
        }
    }

    fact[0] = 1;
    rep(i, N)fact[i + 1] = fact[i] * (i + 1);

    rep(i, N)cout << ans[i] * fact[i + 1] << endl;
}
0