結果
| 問題 | No.563 超高速一人かるた large |
| ユーザー |
👑  はまやんはまやん
|
| 提出日時 | 2017-08-28 11:16:07 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,864 bytes |
| コンパイル時間 | 2,318 ms |
| コンパイル使用メモリ | 184,324 KB |
| 実行使用メモリ | 814,208 KB |
| 最終ジャッジ日時 | 2024-04-24 01:40:38 |
| 合計ジャッジ時間 | 3,917 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | MLE | - |
| testcase_20 | -- | - |
ソースコード
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % 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 inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
Comb() {fac.resize(FAC_MAX, 1); ifac.resize(FAC_MAX, 1);rep(i, 1, FAC_MAX) fac[i] = fac[i - 1] * i;
rep(i, 1, FAC_MAX) ifac[i] = T(1) / fac[i];}
T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
return aCb(n + k - 1, k); }
};
struct Trie {
struct Node { int cnt, dep, hit; string str; Node* c[26]; Node() { cnt = dep = hit = 0; str = ""; rep(i, 0, 26) c[i] = 0; } };
Node* root; Trie() { root = new Node(); }
void add(string x) { update(root, x); }
void update(Node*& x, string a, int b = 0) {
if (!x) x = new Node(); x->cnt++; x->dep = b;
x->str = a.substr(0, b); // <- you can erase this
if (b == a.length()) { x->str = a; x->hit = 1; return; } update(x->c[a[b] - 'a'], a, b + 1);
}
void dump() { dump(root); }
void dump(Node*& x) {
printf("%d [cnt:%d,dep:%d,hit:%d,str:%s]", x, x->cnt, x->dep, x->hit, x->str.c_str());
rep(i, 0, 26) {
if (x->c[i]) printf(" (%c -> %d)", char('a' + i), x->c[i]);
} printf("\n");
rep(i, 0, 26) if (x->c[i]) dump(x->c[i]);
}
void getAllBranchDfs(Node* cu, vector<Node*> &res) {
int cnt = 0;
rep(i, 0, 26) if (cu->c[i]) cnt++;
if (2 <= cnt || cu->hit) res.push_back(cu);
rep(i, 0, 26) if (cu->c[i]) getAllBranchDfs(cu->c[i], res);
}
vector<Node*> getAllBranch() {
vector<Node*> res;
getAllBranchDfs(root, res);
return res;
}
};
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
Comb<mint, 2020> com;
int N; string S[2020];
mint ans[2020];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> S[i];
Trie trie;
rep(i, 0, N) trie.add(S[i]);
//trie.dump();
auto v = trie.getAllBranch();
return;
fore(node, v) {
//printf("! %s\n", node->str.c_str());
rep(i, 0, 26) if (node->c[i]) {
int c = node->c[i]->cnt;
int cc = node->cnt - c;
int other = N - node->cnt;
mint res = node->c[i]->dep;
rep(j, 0, other + 1) rep(k, 0, cc) {
mint co = com.aPb(c, c - 1) * com.aPb(other, j) * com.aPb(cc, k) * com.fac[c - 1 + j + k] * com.ifac[j] * com.ifac[k] * com.ifac[c - 1];
mint d = res * co;
ans[c + j + k] += d;
//printf("%d : %d %d\n", c + j, res.get(), co.get());
}
}
if (node->hit) {
mint res = node->dep + 1;
int c = node->cnt;
int other = N - c;
rep(j, 0, other + 1) rep(k, 0, c - 1){
mint co = com.aPb(c - 1, k) * com.aPb(other, j) * com.aCb(k + j, j);
mint d = res * co;
ans[j + k + 1] += d;
//printf("%d : %d %d\n", c + j, res.get(), co.get());
}
}
}
rep(i, 2, N + 1) ans[i] += ans[i - 1] * (N - i + 1);
ans[N] += com.fac[N];
rep(i, 1, N + 1) printf("%d\n", ans[i].get());
}