fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebear"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 3e5 + 5;
  39. int numWord, numNew, numChar, ans[N];
  40.  
  41. void add(int &x, int y) {
  42.     x += y;
  43.     if (x >= MOD) x -= MOD;
  44.     if (x < 0) x += MOD;
  45. }
  46.  
  47. struct Trie {
  48.     const static int ALPHABET = 26;
  49.     struct Node {
  50.         Node *child[ALPHABET];
  51.         bool last;
  52.         Node() {
  53.             REP(i, ALPHABET) child[i] = NULL;
  54.             last = false;
  55.         }
  56.     };
  57.  
  58.     Node *root;
  59.     Trie() { root = new Node(); }
  60.  
  61.     void ins(string &s) {
  62.         Node *p = root;
  63.         for(char &c : s) {
  64.             int pos = c - 'a';
  65.             if (p -> child[pos] == NULL) p -> child[pos] = new Node();
  66.             p = p -> child[pos];
  67.         }
  68.         p -> last = true;
  69.     }
  70.  
  71.     void dfs(Node *p, int len) {
  72.         if (p -> last) return;
  73.         REP(pos, numChar) {
  74.             if (p -> child[pos] == NULL) add(ans[len + 1], +1);
  75.             else dfs(p -> child[pos], len + 1);
  76.         }
  77.     }
  78. } trie;
  79.  
  80. void init(void) {
  81.     cin >> numWord >> numNew >> numChar;
  82.     FOR(i, 1, numWord) {
  83.         string word;
  84.         cin >> word;
  85.         trie.ins(word);
  86.     }
  87. }
  88.  
  89. void process(void) {
  90.     trie.dfs(trie.root, 0);
  91.     vector<int> len(numNew);
  92.     for(int &i : len) cin >> i;
  93.     sort(all(len));
  94.     int j = 1, result = 1;
  95.  
  96.     for(int i : len) {
  97.         while(j <= i) {
  98.             add(ans[j], 1LL * ans[j - 1] * numChar % MOD);
  99.             j++;
  100.         }
  101.  
  102.         result = 1LL * result * ans[i] % MOD;
  103.         add(ans[i], -1);
  104.     }
  105.     cout << result;
  106. }
  107.  
  108. int main() {
  109.     ios_base::sync_with_stdio(0);
  110.     cin.tie(0); cout.tie(0);
  111.     if (fopen(task".inp", "r")) {
  112.         freopen(task".inp", "r", stdin);
  113.         freopen(task".out", "w", stdout);
  114.     }
  115.     int tc = 1;
  116. //    cin >> tc;
  117.     while(tc--) {
  118.         init();
  119.         process();
  120.     }
  121.     return 0;
  122. }
  123.  
Success #stdin #stdout 0.01s 5328KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
https://ideone.com/EFANEZ
language:
C++14 (gcc 8.3)
created:
15 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!