/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";
const int MAXN = 100001;
const int Mod = 1000000007;
const int P = 424243;
int sum(int a, int b) {
return (a + b >= Mod ? a + b - Mod: a + b);
}
int mul(int a, int b) {
return (1LL * a * b) % Mod;
}
int n, m;
int nxt[MAXN * 22][4];
int where[MAXN];
int uk = 1;
string s[MAXN], p[MAXN], q[MAXN];
bool good[MAXN];
int ps[MAXN];
vector<pair<int, int> > g[MAXN * 22];
int ans[MAXN];
vector<int> ft[MAXN * 22];
int get(char c) {
if (c == 'A') {
return 0;
}
if (c == 'G') {
return 1;
}
if (c == 'U') {
return 2;
}
return 3;
}
void add(string s, int f) {
int cur = 0;
for (auto x: s) {
int f = nxt[cur][get(x)];
if (f) {
cur = f;
} else {
nxt[cur][get(x)] = uk;
cur = uk;
uk++;
}
}
where[f] = cur;
}
void dfs(int u, map<int, int> &cnt) {
for (auto x: ft[u]) {
cnt[x]++;
}
for (int t = 0; t < 4; t++) {
if (!nxt[u][t]) {
continue;
}
int h = nxt[u][t];
map<int, int> cnt1;
dfs(h, cnt1);
if (sz(cnt) < sz(cnt1)) {
swap(cnt, cnt1);
}
for (auto x: cnt1) {
cnt[x.first] += x.second;
}
}
for (auto y: g[u]) {
ans[y.first] += (cnt.find(y.second) == cnt.end() ? 0: cnt.at(y.second));
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//read(FILENAME);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
add(s[i], i);
}
ps[0] = 1;
for (int i = 1; i < MAXN; i++) {
ps[i] = mul(ps[i - 1], P);
}
for (int i = 0; i < m; i++) {
cin >> p[i] >> q[i];
good[sz(q[i])] = true;
int cur = 0;
bool bad = false;
for (auto x: p[i]) {
if (!nxt[cur][get(x)]) {
bad = true;
} else {
cur = nxt[cur][get(x)];
}
}
int hsh = 0;
for (auto x: q[i]) {
hsh = sum(mul(hsh, P), get(x) + 1);
}
//cout << hsh << endl;
if (!bad) {
//cout << i + 1 << endl;
g[cur].pb({i, hsh});
}
}
for (int i = 0; i < n; i++) {
int cur = 0;
for (int j = sz(s[i]) - 1; j >= 0; j--) {
cur = sum(cur, mul(get(s[i][j]) + 1, ps[sz(s[i]) - j - 1]));
//cout << cur << endl;
if (good[sz(s[i]) - j]) {
ft[where[i]].pb(cur);
}
}
}
map<int, int> cnt;
dfs(0, cnt);
for (int i = 0; i < m; i++) {
cout << ans[i] << '\n';
}
return 0;
}
Compilation message
selling_rna.cpp:52:50: error: redefinition of 'template<class T, class U> std::ostream& operator<<(std::ostream&, const std::map<T, U>&)'
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
^~~~~~~~
selling_rna.cpp:51:50: note: 'template<class T, class U> std::ostream& operator<<(std::ostream&, const std::map<T, U>&)' previously declared here
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
^~~~~~~~
