#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXL 2000000
#define MAXN 100010
#define MOD 1000000007
int trie[MAXL][4], siz[MAXL], idx[MAXL], nodes, timer, hshidx, key, f[300];
bool sorted[MAXL];
vector<int> gde[MAXL];
unordered_map<int,int> cudo, celi;
lld hsh[MAXN], hsh1[MAXN], st[MAXN];
string P, Q, S;
void ubaci(int node, string &s, int idx, int len) {
if(idx == len) return;
int c = f[s[idx]];
if(trie[node][c] == 0) trie[node][c] = ++nodes;
gde[hsh[len-1-idx]].pb(node);
ubaci(trie[node][c], s, idx+1, len);
}
int DFS(int node) {
idx[node] = ++timer;
for(int i = 0; i < 4; i++) if(trie[node][i]) siz[node] += DFS(trie[node][i]);
return ++siz[node];
}
void hashuj(string &s, lld hsh[], int lens) {
fill(hsh, hsh+lens+5, 0);
for(int i = 0; i < lens; i++) {
hsh[i] += st[i]*(f[s[i]]+1);
if(hsh[i] >= MOD) hsh[i] %= MOD;
hsh[i+1] += hsh[i];
if(cudo[hsh[i]] == 0) cudo[hsh[i]] = ++hshidx;
hsh[i] = cudo[hsh[i]];
}
}
void hashuj1(string &s, lld hsh[], int lens) {
fill(hsh, hsh+lens+5, 0);
for(int i = 0; i < lens; i++) {
hsh[i] += st[i]*(f[s[i]]+1);
if(hsh[i] >= MOD) hsh[i] %= MOD;
hsh[i+1] += hsh[i];
}
}
int query(int node, string &s, int idxx, int len) {
if(idxx == len) return node;
int c = f[s[idxx]];
if(trie[node][c] == 0) return -1;
return query(trie[node][c], s, idxx+1, len);
}
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int N, M; cin >> N >> M;
f['A'] = 0, f['G'] = 1, f['C'] = 2, f['U'] = 3, st[0] = 1;
for(int i = 1; i < MAXN; i++) st[i] = (st[i-1]*5 >= MOD ? (st[i-1]*5)%MOD : st[i-1]*5);
for(int i = 1; i <= N; i++) {
cin >> S;
int lenS = sz(S);
reverse(all(S));
hashuj1(S, hsh, lenS);
celi[hsh[lenS-1]]++;
hashuj(S, hsh, lenS);
reverse(all(S));
ubaci(0, S, 0, lenS);
}
int kol = hshidx;
DFS(0);
for(int q = 0; q < M; q++) {
int rez = 0;
cin >> P >> Q;
int lenQ = sz(Q), lenP = sz(P);
reverse(all(Q));
hashuj1(Q, hsh, lenQ); key = cudo[hsh[lenQ-1]];
int koji = query(0, P, 0, lenP);
if(key == 0 || koji == -1) {
cout << 0 << endl;
continue;
}
if(!sorted[key]) {
for(int i = 0; i < sz(gde[key]); i++) gde[key][i] = idx[gde[key][i]];
sort(all(gde[key]));
sorted[key] = 1;
}
reverse(all(P));
hashuj1(P, hsh1, lenP);// hashuj1(Q, hsh, lenQ);
/*for(int i = 0; i < lenQ; i++) {
if(hsh[lenQ-1] - hsh[lenQ-2-i] == hsh1[i]*st[lenQ-i-1]) {
lld cur = hsh1[lenP-1]*st[lenQ-i-1] + hsh[lenQ-2-i];
rez += celi[cur];
}
}*/
rez += upper_bound(all(gde[key]), idx[koji]+siz[koji]-1) - lower_bound(all(gde[key]), idx[koji]);
cout << rez << endl;
}
return 0;
}
Compilation message
selling_rna.cpp: In function 'void ubaci(int, std::__cxx11::string&, int, int)':
selling_rna.cpp:29:21: warning: array subscript has type 'char' [-Wchar-subscripts]
int c = f[s[idx]];
^
selling_rna.cpp: In function 'void hashuj(std::__cxx11::string&, long long int*, int)':
selling_rna.cpp:42:32: warning: array subscript has type 'char' [-Wchar-subscripts]
hsh[i] += st[i]*(f[s[i]]+1);
^
selling_rna.cpp: In function 'void hashuj1(std::__cxx11::string&, long long int*, int)':
selling_rna.cpp:52:32: warning: array subscript has type 'char' [-Wchar-subscripts]
hsh[i] += st[i]*(f[s[i]]+1);
^
selling_rna.cpp: In function 'int query(int, std::__cxx11::string&, int, int)':
selling_rna.cpp:59:22: warning: array subscript has type 'char' [-Wchar-subscripts]
int c = f[s[idxx]];
^
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:78:9: warning: unused variable 'kol' [-Wunused-variable]
int kol = hshidx;
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
41 ms |
48120 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1577 ms |
207072 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
66 ms |
48888 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
41 ms |
48120 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
