/**
* Author : Nguyen Tuan Vu
* Created : 02.12.2022
**/
#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define MASK(x) ((1)<<(x))
#define BIT(x, i) (((x)>>(i))&(1))
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define db(val) "["#val" = "<<(val)<<"] "
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
template <class X, class Y> bool minimize(X &a, Y b) {
if (a > b) return a = b, true;
return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
if (a < b) return a = b, true;
return false;
}
using namespace std;
mt19937 jdg(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l, int r) {return l + jdg() % (r - l + 1);}
void file(){
#define TASK "TASK"
if(fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
}
const int N = 1e5 + 5;
int n, nquery;
string s[N];
namespace sub4 {
struct TRIE_PREF {
struct node {
node *child[26];
int L, R;
node() {
L = -1, R = -1;
REP(i, 26) child[i] = NULL;
}
} *root;
TRIE_PREF() {
root = new node();
}
void add(string &x, int ID) {
node *p = root;
for (auto c : x) {
if (p -> child[c - 'A'] == NULL) p -> child[c - 'A'] = new node();
p = p -> child[c - 'A'];
if (p -> L == -1) p -> L = p -> R = ID;
else p -> R = ID;
}
}
pair <int, int> get(string &x) {
node *p = root;
for (auto c : x) {
if (p -> child[c - 'A'] == NULL) return make_pair(-1, 0);
p = p -> child[c - 'A'];
}
return make_pair(p -> L, p -> R);
}
} pref;
struct TRIE_SUFF {
struct node {
node *child[26];
vector <int> S;
node() {
REP(i, 26) child[i] = NULL;
}
} *root;
TRIE_SUFF() {
root = new node();
}
void add(string &x, int ID) {
node *p = root;
for (auto c : x) {
if (p -> child[c - 'A'] == NULL) p -> child[c - 'A'] = new node();
p = p -> child[c - 'A'];
p -> S.push_back(ID);
}
}
int get(string &x, int L, int R) {
node *p = root;
for (auto c : x) {
if (p -> child[c - 'A'] == NULL) return 0;
p = p -> child[c - 'A'];
}
return upper_bound(ALL(p -> S), R) - lower_bound(ALL(p -> S), L);
}
} suff;
void solve() {
FOR(i, 1, n) {
pref.add(s[i], i);
reverse(ALL(s[i]));
suff.add(s[i], i);
}
while (nquery--) {
string PREF, SUFF;
cin >> PREF >> SUFF;
reverse(ALL(SUFF));
pair <int, int> Pref = pref.get(PREF);
int Suff = suff.get(SUFF, Pref.first, Pref.second);
cout << Suff << '\n';
}
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
file();
cin >> n >> nquery;
FOR(i, 1, n) cin >> s[i];
sub4::solve();
cerr << "Time elapsed: " << TIME << " s.\n";
return 0;
}
/*
==================================================+
INPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
OUTPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
*/
Compilation message
selling_rna.cpp: In function 'void file()':
selling_rna.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | freopen(TASK".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | freopen(TASK".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
3412 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
358 ms |
529824 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
4380 KB |
Output is correct |
| 2 |
Incorrect |
15 ms |
5740 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
3412 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
