Submission #1161965

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, Q;
string S[100000];
int p[256];

class Trie {
public:
  Trie *a[26];
  int ctr;
  bool leaf;
  int vc, lc;
  int skip;

  Trie() {
    for (int i=0; i<26; i++) a[i] = NULL;
    leaf = false;
    ctr = 0;
    vc = 0;
    lc = 0;
    skip = 0;
  }
  void insert(const char *s) {
    if (*s == '\0') {
      leaf = true;
      ctr++;
      return;
    }
    int k = *s - 'a';
    if (a[k] == NULL) {
      a[k] = new Trie();
      vc++;
      lc = k;
    }
    a[k]->insert(s+1);
    ctr++;
  }

  void shorten() {
    for (int i=0; i<26; i++) {
      if (a[i] == NULL) continue;
      Trie *p = a[i];
      if (p->leaf || p->vc != 1) continue;
      int s = 0;
      while (true) {
        int lc = p->lc;
        if (p->a[lc]->leaf == false && p->ctr == p->a[lc]->ctr) {
          p = p->a[lc];
          s++;
        }
        else break;
      }
      if (s > 0) {
        a[i] = p;
        a[i]->skip += s;
      }
      a[i]->shorten();
    }
  }

  int find(const char *s) {
    s += skip;
    if (*s == '\0') return leaf;
    int c = leaf;
    int k = *s - 'a';
    for (int i=0; i<26; i++) {
      if (a[i] != NULL && p[i] < p[k]) c += a[i]->ctr;
    }
    if (a[k] == NULL) return c;
    c += a[k]->find(s+1);
    return c;
  }
};


signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N;
  rep(i, N) cin >> S[i];
  cin >> Q;

  Trie trie;
  rep(i, N) {
    trie.insert(S[i].c_str());
  }
  trie.shorten();
  rep(i, Q) {
    int k; cin >> k;
    k--;
    rep(i, 26) {
      char c;
      cin >> c;
      p[c - 'a'] = i;
    }
    cout << trie.find(S[k].c_str()) << "\n";
  }
  return 0;
}

Submission Info

Judge Result