萌新trie0分求条

#include <bits/stdc++.h>
using namespace std;
const int N = 5e6+5;
int t[N][90], tot;
char s[N], tmp[N];
int T, n, Q;
vector<int>book[N];
void insert(int belong, char *s, int ln) {
	int u = 0;
	for (int i = 0; i < ln; i++) {
		int v = s[i] - 'a';
		if (!t[u][v])
			t[u][v] = ++tot;
		u = t[u][v];
	}
	book[u].push_back(belong);
}
void search(char *s, int ln) {
	int u = 0;
	for (int i = 0; i < ln; i++) {
		int v = s[i] - 'a';
		if (!t[u][v])
			return;
		u = t[u][v];
	}
	book[u].erase(unique(book[u].begin(), book[u].end()), book[u].end());
	for (int i = 0; i < book[u].size()-1; i++) {
        if(i==book[u].size()-1) cout<<book[u][i];
		else cout << book[u][i] << ' ';
    }
	cout << endl;
}
void solve() {
	cin >> T;
	for (int i = 1; i <= T; i++) {
		cin >> n;
		for (int j = 0; j < n; j++) {
			scanf("%s", s);
			insert(i, s, strlen(s));
		}
	}
	cin >> Q;
	while (Q--) {
		scanf("%s", tmp);
		search(tmp, strlen(tmp));
	}
}
int main() {
	solve();
	return 0;
}