#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define It it=se.begin();it!=se.end();it++
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define all(x) begin(x),end(x)
#define unmap unordered_map
#define pii pair<int,int>
#include <bits/stdc++.h>
#define pll pair<ll,ll>
#define vll vector<ll>
#define vi vector<int>
#define ld long double
#define ll long long
#define pb push_back
#define sh short int
#define mid (l+r)/2
#define S second
#define F first
#define sqr 447
using namespace std;
const int inf = 1e9+9;
const int mod = 1e9+7;
const ld pai=acos(-1);
int n,m;
string s[5009];
string p[5009];
string q[5009];
unordered_map < string , bool > pre[5009];
unordered_map < string , bool > suf[5009];
int main(){
fast,cin>>n>>m;
for(int i=0;i<n;i++){
cin>>s[i];
int sz = s[i].size();
string s1 = "";
for(int j=0;j<sz;j++){
s1 += s[i][j];
pre[i][s1] = 1;
}
string s2 = "";
for(int j=sz-1;j>=0;j--){
s2 += s[i][j];
suf[i][s2] = 1;
}
}
for(int i=0;i<m;i++){
int ans = 0;
cin>>p[i]>>q[i];
reverse(all(q[i]));
for(int j=0;j<n;j++){
ans += (pre[j][p[i]] && suf[j][q[i]]);
}
cout<<ans<<endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1792 KB |
Output is correct |
2 |
Correct |
7 ms |
1792 KB |
Output is correct |
3 |
Correct |
7 ms |
1664 KB |
Output is correct |
4 |
Correct |
7 ms |
1664 KB |
Output is correct |
5 |
Correct |
7 ms |
1792 KB |
Output is correct |
6 |
Correct |
7 ms |
1664 KB |
Output is correct |
7 |
Correct |
7 ms |
1792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
910 ms |
1048576 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
12 ms |
5760 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1792 KB |
Output is correct |
2 |
Correct |
7 ms |
1792 KB |
Output is correct |
3 |
Correct |
7 ms |
1664 KB |
Output is correct |
4 |
Correct |
7 ms |
1664 KB |
Output is correct |
5 |
Correct |
7 ms |
1792 KB |
Output is correct |
6 |
Correct |
7 ms |
1664 KB |
Output is correct |
7 |
Correct |
7 ms |
1792 KB |
Output is correct |
8 |
Runtime error |
910 ms |
1048576 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
9 |
Halted |
0 ms |
0 KB |
- |