#1260 : String Problem I

样例输入

3 3
tourist
petr
rng
toosimple
rg
ptr

样例输出

0
1
1

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
using namespace std;
const int maxn = 10005; struct Node{int len; string s;
}nd[maxn];
int n,m; int Match(const string &s1, const string &s2){bool isPlus = true; int j = 0; for(int i=0; i<s1.length(); i++){if(s1[i] != s2[j]){if(isPlus){isPlus = false; }else{return false; }}else{j++; }}return true;
}int cmp(const void* a, const void* b){Node* aa = (Node *)a; Node* bb = (Node *)b; return aa->len - bb->len;
}int main(){freopen("in.txt", "r", stdin); int i,j, mid, left, right, target_len, test_start, cnt; string target; scanf("%d %d", &n, &m ); getchar(); for(int i=0; i<n; i++){cin>>nd[i].s;nd[i].len = nd[i].s.length();  }qsort(nd, n, sizeof(nd[0]), cmp); for(i=0; i<m; i++){cin>>target; target_len = target.length() + 1; left = 0; right = n-1; test_start = -1; while(left <= right){mid = left + (right - left)/2; if(nd[mid].len == target_len){j = mid-1; while(j>=0 && nd[j].len == nd[mid].len){j--; }test_start = j + 1; break; }else if(nd[mid].len > target_len){right = mid - 1; }else{left = mid + 1; }}if(test_start == -1){printf("%d\n", 0);}else{cnt = 0; for(j=test_start; nd[j].len == target_len; j++){if(Match(nd[j].s, target)){cnt++; }}printf("%d\n", cnt);}}return 0;
}