Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define f(i,a,b) for(int i = a ; i < b ; i++)
- #define fd(i,a,b) for(int i = a ; i >= b ; i--)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define mp make_pair
- #define rall(x) (x).rbegin() , (x).rend()
- #define PI acos( -1.0 )
- #define EPS 1E-9
- #define TAM 100010
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- typedef vector <ii> vii;
- typedef vector<int> vi;
- int t,n,m,x,y,ans;
- unsigned long long hash[1010][1010],mi[1010],p[1010],q[1010],B[1010];
- char s[300];
- void KMPreprocess(){
- int i,j=0;
- memset(B,0,sizeof(B));
- for(i=2;i<=y;i++){
- while(j && p[i]!=p[j+1])
- j=B[j];
- if(p[i]==p[j+1])
- j++;
- B[i]=j;
- }
- }
- void find(int pos){
- int i,j=0;
- f(i,1,m+1)
- q[i]=hash[pos+x][i]-hash[pos][i]*mi[x];
- f(i,1,m+1){
- while(j && q[i]!=p[j+1])
- j=B[j];
- if(q[i]==p[j+1])
- j++;
- if (j==y){
- ans++;
- j=B[j];
- }
- }
- }
- int main()
- { int i,j;
- scanf("%d",&t);
- while(t--){
- scanf("%d%d",&n,&m);
- memset(p,0,sizeof(p));
- mi[0]=1;ans=0;
- f(i,1,n+1)
- {
- scanf("%s",s+1);
- f(j,1,m+1)
- hash[i][j]=hash[i-1][j]*2333+s[j];
- mi[i]=mi[i-1]*2333;
- }
- scanf("%d%d",&x,&y);
- f(i,1,x+1){
- scanf("%s",s+1);
- f(j,1,y+1)
- p[j]=p[j]*2333+s[j];
- }
- KMPreprocess();
- f(i,0,n-x+1)
- find(i);
- printf("%d\n",ans);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement