結果
問題 | No.563 超高速一人かるた large |
ユーザー | はまやんはまやん |
提出日時 | 2017-08-26 00:03:01 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,420 bytes |
コンパイル時間 | 2,421 ms |
コンパイル使用メモリ | 191,516 KB |
実行使用メモリ | 8,064 KB |
最終ジャッジ日時 | 2024-10-15 16:18:51 |
合計ジャッジ時間 | 5,688 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
7,552 KB |
testcase_01 | AC | 6 ms
7,552 KB |
testcase_02 | AC | 9 ms
7,424 KB |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | AC | 6 ms
8,064 KB |
testcase_20 | RE | - |
ソースコード
#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; } typedef ModInt<1000000007> mint; 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); } }; #define def INT_MAX/2 template<class V, int NV> struct SegTree { V comp(V l, V r) { return min(l, r); }; vector<V> val; SegTree() { val = vector<V>(NV * 2, def); } V get(int l, int r) { //[l,r] if (l > r) return def; l += NV; r += NV + 1; V ret = def; while (l < r) { if (l & 1) ret = comp(ret, val[l++]); if (r & 1) ret = comp(ret, val[--r]); l /= 2; r /= 2; } return ret; } void update(int i, V v) { i += NV; val[i] = v; while (i>1) i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); } void add(int i, V v) { update(i, val[i + NV] + v); } }; struct ManyLCP { vector<string> v; SegTree<int, 1<<10> st; vector<int> dic; void add(string s) { v.push_back(s); } void build() { vector<pair<string, int>> p; rep(i, 0, v.size()) p.push_back({ v[i], i }); sort(p.begin(), p.end()); rep(i, 0, p.size() - 1) { string a = p[i].first; string b = p[i + 1].first; int cnt = 0; rep(i, 0, min(a.length(), b.length())) { if (a[i] == b[i]) cnt = i + 1; else break; } st.update(i, cnt); } dic.resize(v.size()); rep(i, 0, p.size()) dic[p[i].second] = i; } int lcp(int i, int j) { int a = dic[i], b = dic[j]; if (a > b) swap(a, b); return st.get(a, b - 1); } }; /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ Comb<mint, 101> com; int N; string S[20]; mint dp[1 << 20]; //--------------------------------------------------------------------------------------------------- mint ans[20]; void _main() { ManyLCP lcp; cin >> N; rep(i, 0, N) cin >> S[i]; rep(i, 0, N) lcp.add(S[i]); lcp.build(); rep(mask, 0, 1 << N) { int cn = 0; rep(i, 0, N) if ((mask >> i) & 1) cn++; ans[cn] += dp[mask]; vector<int> ok(N, 0); int cnt = 0; rep(i, 0, N) if (~(mask >> i) & 1) ok[i] = 1, cnt++; rep(i, 0, N) if (ok[i]) { int c = 1; rep(j, 0, N) if (ok[j] && i != j) c = max(c, lcp.lcp(i, j) + 1); dp[mask | (1 << i)] += dp[mask] + com.aPb(cn, cn) * c; } } //rep(mask, 0, 1 << N) printf("dp[%d] = %d\n", mask, dp[mask]); rep(i, 1, N + 1) cout << ans[i] << endl; }