結果
| 問題 | No.562 超高速一人かるた small |
| ユーザー |
 しらっ亭
|
| 提出日時 | 2017-08-25 23:10:29 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 712 ms / 3,000 ms |
| コード長 | 8,012 bytes |
| コンパイル時間 | 1,927 ms |
| コンパイル使用メモリ | 186,708 KB |
| 実行使用メモリ | 7,296 KB |
| 最終ジャッジ日時 | 2024-10-15 16:41:44 |
| 合計ジャッジ時間 | 11,304 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define forr(x,arr) for(auto&& x:arr)#define _overload3(_1,_2,_3,name,...) name#define _rep2(i,n) _rep3(i,0,n)#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)#define _rrep2(i,n) _rrep3(i,0,n)#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define bit(n) (1LL<<(n))#define sz(x) ((int)(x).size())#define TEN(n) ((ll)(1e##n))#define fst first#define snd secondstring DBG_DLM(int &i){return(i++==0?"":", ");}#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}template<class T>ostream&operator<<(ostream&os,vector<T>v);template<class T>ostream&operator<<(ostream&os,set<T>v);template<class T>ostream&operator<<(ostream&os,queue<T>q);template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);template<int I,class TPL>void DBG(ostream&os,TPL t){}template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}#define DBG1(v,...){DBG_OUTPUT(v);}#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}#define DEBUG0(){DBG_LINE();cerr<<endl;}#ifdef LOCAL#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}#else#define out(...)#endifusing ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}const int mod = 1e9+7;template<int MOD> struct Mint {int x;Mint() : x(0) {}Mint(int y) : x(y >= 0 ? y % MOD : MOD - (-y) % MOD) {}Mint(int64_t sll) : x(sll % MOD) { if (x < 0) x += MOD; }Mint &operator+=(const Mint &rhs){ if((x += rhs.x) >= MOD) x -= MOD; return *this; }Mint &operator-=(const Mint &rhs){ if((x += MOD - rhs.x) >= MOD) x -= MOD; return *this; }Mint &operator*=(const Mint &rhs){ x = 1LL*x*rhs.x % MOD; return *this; }Mint &operator/=(const Mint &rhs){ x = (1LL*x*rhs.inv().x) % MOD; return *this; }Mint operator-() const { return Mint(-x); }Mint operator+(const Mint &rhs) const { return Mint(*this) += rhs; }Mint operator-(const Mint &rhs) const { return Mint(*this) -= rhs; }Mint operator*(const Mint &rhs) const { return Mint(*this) *= rhs; }Mint operator/(const Mint &rhs) const { return Mint(*this) /= rhs; }bool operator<(const Mint &rhs) const { return x < rhs.x; }Mint inv() const {signed a = x, b = MOD, u = 1, v = 0, t;while(b){ t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }return Mint(u);}Mint operator^(uint64_t t) const {Mint e = *this, res = 1;for(; t; e *= e, t>>=1) if (t & 1) res *= e;return res;}};template<int MOD> ostream &operator<<(ostream &os, const Mint<MOD> &rhs) { return os << rhs.x; }template<int MOD> istream &operator>>(istream &is, Mint<MOD> &rhs) { int64_t s; is >> s; rhs = Mint<MOD>(s); return is; };using mint = Mint<mod>;using vm=vector<mint>;using vvm=vector<vm>;using vvvm=vector<vvm>;const int SET_FACT_MAX =100;mint fact[SET_FACT_MAX];mint revFact[SET_FACT_MAX];void setFact() {const int N = SET_FACT_MAX;fact[0] = 1;for (int i = 1; i < N; i++) {fact[i] = fact[i - 1] * i;}revFact[N - 1] = fact[N - 1] ^ (mod - 2);for (int i = N - 2; i >= 0; i--) {revFact[i] = revFact[i + 1] * (i + 1);}}mint nPr(int n, int r) { return n >= r ? fact[n] * revFact[n - r] : 0; }mint nCr(int n, int r) { return nPr(n, r) * revFact[r]; }mint nHr(int n, int r) { return n == 0 && r == 0 ? 1 : nCr(n + r - 1, r); }struct RollingHash64 {const int base = 1e9+7;const int N;vector<int64_t> P, H;RollingHash64(const string & S) : N(S.size()), P(N+1, 1), H(N+1, 0) {for (int i = 0; i < N; i++) {int c = (int) (S[i] - ' ');H[i+1] = H[i] * base + c;P[i+1] = P[i] * base;}}int64_t hash() const {return hash(0, N);}int64_t hash(int r) const {return H[r];}int64_t hash(int l, int r) const {return H[r] - H[l] * P[r - l];}bool equals(int l1, int r1, int l2, int r2) const {if (l1 < 0 || l2 < 0) return false;if (r1 > N || r2 > N) return false;if (r1 - l1 != r2 - l2) return false;return hash(l1, r1) == hash(l2, r2);}bool equals(int p1, int p2, int len) const {return equals(p1, p1 + len, p2, p2 + len);}bool equals(int pos, const RollingHash64 &other) const {int r = pos + other.N;if (r >= N) return false;return hash(pos, r) == hash(0, other.N);}int lcp(int p1, int p2) const {int ok = 0;int ng = min(N - p1, N - p2) + 1;while (ng - ok > 1) {int mid = (ok + ng) / 2;(equals(p1, p1 + mid, p2, p2 + mid) ? ok : ng) = mid;}return ok;}};void Main() {int n = ri();setFact();vs S(n);rep(i, n) S[i] = rs();sort(all(S));out(S);string s;vi P(n+1);rep(i, n) {P[i] = sz(s);s += S[i];s += ('A' + i);}RollingHash64 rh(s);vvi lcp(n, vi(n));rep(i, n) rep(j, n) {lcp[i][j] = rh.lcp(P[i], P[j]);}vm dp(bit(n));rep(i, bit(n)) {rep(j, n) if ((bit(j) & i) == 0) {int ma = 0;rep(k, n) if (j != k && (bit(k) & i) == 0) {amax(ma, lcp[j][k]);}int ij = i|bit(j);int bci = __builtin_popcount(i);dp[ij] += dp[i] + fact[bci] * (ma + 1);}}vm Z(22);rep(i, bit(n)) {int bc = __builtin_popcount(i);Z[bc] += dp[i];}out(Z);rep(i, 1, n+1) {cout << Z[i] << "\n";}}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);Main();return 0;}