#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
ll mod = 58749678952092199;
ll hash_base = 31;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m;
cin >> n >> m;
auto get_hash = [&](string s){
ll hsh = 0;
vector<ll> hashes(s.length());
REP(i, s.length()){
hsh *= hash_base;
hsh += (int)(s[i] - 'A' + 1);
hsh %= mod;
hashes[i] = hsh;
}
return hashes;
};
vector<string> rna_chains(n);
REP(i, n) cin >> rna_chains[i];
vector<pair<ll, ll>> queries;
vector<ll> v;
vector<pair<int, int>> sizes;
REP(i, m){
string p, q;
cin >> p >> q;
reverse(all(q));
sizes.pb(mp(p.length(), q.length()));
v = get_hash(p);
ll hsh1 = v[(int)p.length() - 1];
v = get_hash(q);
ll hsh2 = v[(int)q.length() - 1];
queries.pb({hsh1, hsh2});
}
sort(all(sizes));
sizes.erase(unique(all(sizes)), sizes.end());
vector<ll> v2;
map<pll, int> mapka;
REP(i, n){
v = get_hash(rna_chains[i]);
reverse(all(rna_chains[i]));
v2 = get_hash(rna_chains[i]);
int len = rna_chains[i].length();
REP(j, sizes.size()){
if(sizes[j].ff > len || sizes[j].ss > len) continue;
mapka[mp(v[sizes[j].ff-1], v2[sizes[j].ss-1])]++;
}
}
REP(j, queries.size()){
if(mapka.find(queries[j]) != mapka.end())
cout << mapka[queries[j]] << "\n";
else
cout << 0 << "\n";
}
return 0;
}
Compilation message
selling_rna.cpp: In lambda function:
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
selling_rna.cpp:94:9: note: in expansion of macro 'REP'
94 | REP(i, s.length()){
| ^~~
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
selling_rna.cpp:127:9: note: in expansion of macro 'REP'
127 | REP(j, sizes.size()){
| ^~~
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
selling_rna.cpp:132:5: note: in expansion of macro 'REP'
132 | REP(j, queries.size()){
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
309 ms |
5996 KB |
Output is correct |
| 2 |
Correct |
783 ms |
11884 KB |
Output is correct |
| 3 |
Correct |
504 ms |
11500 KB |
Output is correct |
| 4 |
Correct |
637 ms |
12012 KB |
Output is correct |
| 5 |
Execution timed out |
1595 ms |
279748 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
3676 KB |
Output is correct |
| 2 |
Correct |
40 ms |
2788 KB |
Output is correct |
| 3 |
Correct |
46 ms |
3552 KB |
Output is correct |
| 4 |
Correct |
21 ms |
3296 KB |
Output is correct |
| 5 |
Correct |
41 ms |
2788 KB |
Output is correct |
| 6 |
Correct |
54 ms |
3552 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
309 ms |
5996 KB |
Output is correct |
| 9 |
Correct |
783 ms |
11884 KB |
Output is correct |
| 10 |
Correct |
504 ms |
11500 KB |
Output is correct |
| 11 |
Correct |
637 ms |
12012 KB |
Output is correct |
| 12 |
Execution timed out |
1595 ms |
279748 KB |
Time limit exceeded |
| 13 |
Halted |
0 ms |
0 KB |
- |
