[Acwing] 142. 前缀统计 Tire_记录个数

前言

传送门 :

思路

属于是 字典树 基础题,我们只需要在建树操作末尾的时候,记录一下个数即可

然后查询的时候加上

Mycode

// Problem: 前缀统计
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/144/
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()
#define Fup(i,a,b) for(int i=a;i<=b;i++)
#define Fde(i,a,b) for(int i=a;i>=b;i--)

typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;
const int N = 1e6+10;
int cnt[N],trie[N][26],idx;
int n,m;

void add(string s){
	int u = 0 ;
	for(int i = 0 ; i < (int)s.size(); i++ ){
		int p  =  s[i] - 'a';
		if(!trie[u][p]) trie[u][p] = ++idx;
		u = trie[u][p];  
	}
	
	cnt[u] ++;
}

int query(string s){
	int u   = 0 ;
	int res = 0 ;
	
	for(int i  = 0 ;i< (int)s.size(); i++){
		int  p = s[i] -'a';
		if(!trie[u][p]) return res;
		res+=cnt[trie[u][p]];
		u = trie[u][p];
	}
	return res;
	
}
void solve(){
	cin>>n>>m;
	
	for(int i=1;i<=n;i++){
		string s;cin>>s;
		add(s);
	}
	for(int i=1;i<=m;i++){
		string s;cin>>s;
		cout<<query(s)<<endl;
		
	}
}

int main(){
    //int t;cin>>t;while(t--)
    solve();
    return 0 ;
}