#199911 (C++14) No.562 超高速一人かるた small

• 問題: No.562 超高速一人かるた small
• ユーザー: tsutaj
• 提出日時: 2017-08-25 23:52:05
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 633 ms / 3,000 ms
• コード長: 2,314 bytes
• コンパイル時間: 1,281 ms
• コンパイル使用メモリ: 102,692 KB
• 実行使用メモリ: 19,840 KB
• 最終ジャッジ日時: 2024-10-15 16:48:05
• 合計ジャッジ時間: 9,351 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 21

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
int diff[25][25];
int dp[1 << 20], enumerate[1 << 20], rec[25];
int N;
vector<string> vs;
signed main() {
    cin >> N;
    rep(i,0,N) {
        string s; cin >> s;
        vs.push_back(s);
    }
    rep(i,0,N) rep(j,i+1,N) {
        int idx = 0, ans = -1;
        while(idx < vs[i].length() && idx < vs[j].length()) {
            if(vs[i][idx] != vs[j][idx]) {
                ans = idx;
                break;
            }
            else idx++;
        }
        if(ans < 0) ans = min(vs[i].length(), vs[j].length());
        diff[i][j] = diff[j][i] = ans + 1;
    }
    /*
    rep(i,0,N) {
        rep(j,0,N) printf("%lld ", diff[i][j]);
        cout << endl;
    }
    */
    enumerate[(1 << N) - 1] = 1;
    repr(bit,(1<<N)-1,0) {
        rep(i,0,N) if(bit >> i & 1) {
            int ma = 1;
            rep(j,0,N) if(bit >> j & 1) chmax(ma, diff[i][j]);
            int nbit = bit ^ (1 << i);
            (enumerate[nbit] += enumerate[bit]) %= MOD;
            (dp[nbit] += (dp[bit] + enumerate[bit] * ma) % MOD) %= MOD;
        }
    }
    // rep(i,0,1<<N) printf("dp[%lld] = %lld, enum = %lld\n", i, dp[i], enumerate[i]);
    rep(bit,0,1<<N) {
        int cnt = __builtin_popcount(bit);
        (rec[cnt] += dp[bit]) %= MOD;
    }
    repr(i,N-1,0) cout << rec[i] << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX