[模板 | C++] Trie（字典树、前缀树）

URL：P8306 【模板】字典树 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include "bits/stdc++.h"

struct trie {
	int pass, end;
	std::unordered_map <char, int> next;

	trie() {
		pass = 0;
		end = 0;
	}

};

int num = 0;

void insert(std::string s, std::vector <trie> &tr) {
	for (int i = 0, o = 0; i < s.length(); ++ i) {
		if (!tr[o].next.count(s[i])) {
			tr[o].next[s[i]] = ++ num;
		}
		o = tr[o].next[s[i]]; // 先移动到当前si代表的点

		tr[o].pass ++;
		if (i == s.length() - 1) tr[o].end ++;

		//std::cout << "pass = " << tr[o].pass << "\n";
	}
}

int query(std::string s, std::vector <trie> &tr) {
	for (int i = 0, o = 0; i < s.length(); ++ i) {
		if (!tr[o].next.count(s[i])) return 0;
		
		o = tr[o].next[s[i]];

		if (i == s.length() - 1) return tr[o].pass; 
	}

}

signed main() {
	int t; std::cin >> t;

	while (t --) {
		int n, q; std::cin >> n >> q;

		num = 0;

		int sum = 0;
		std::vector <std::string> tmp;

		for (int i = 1; i <= n; ++ i) {
			std::string s; std::cin >> s;
			tmp.push_back(s);
			sum += s.length();
		}

		std::vector <trie> tr(sum << 1);
		for (auto &s : tmp) {
			insert(s, tr);
		}

		for (int i = 1; i <= q; ++ i) {
			std::string s; std::cin >> s;
			std::cout << query(s, tr) << "\n";
		}
	}
}