Trie习题

Trie字典树习题

---

HDU P2072 单词数

#include <bits/stdc++.h> 
using namespace std;

const int maxn = 1e5;
int son[maxn][26], idx;
bool vis[maxn];

void init()
{
	idx = 0;
	memset(son, 0, sizeof son);
	memset(vis, 0, sizeof vis);
}

void insert(string &s)
{
	int p = 0;
	for(int i = 0; s[i]; ++i)
	{
		int u = s[i] - 'a';
		if(!son[p][u])
			son[p][u] = ++idx;
		p = son[p][u];
	} 
	vis[p] = true;
}

bool query(string &s)
{
	int p = 0;
	for(int i = 0; s[i]; ++i) 
	{
		int u = s[i] - 'a';
		if(!son[p][u])
			return false;
		p = son[p][u];		
	}
	return vis[p];
}

int main()
{
	string s;
	while(getline(cin, s))
	{
		if(s[0] == '#')
			break;
		init();
		stringstream ss(s);
		string t;
		while(ss >> t)
			insert(t);
		int cnt = 0;
		for(int i = 1; i <= idx; ++i)
			if(vis[i])
				++cnt;
				
		cout << cnt << endl;
	}
	
	return 0;
}

---

HDU P1251统计难题

#include <bits/stdc++.h> 
using namespace std;

const int maxn = 1e7;
int son[maxn][26], cnt[maxn], idx;

void insert(string &s)
{
	int p = 0;
	for(char &c : s)
	{
		int u = c - 'a';
		if(!son[p][u]) 
			son[p][u] = ++idx;
		p = son[p][u];
		++cnt[p];
	}
}

int query(string &s)
{
	int p = 0;
	for(char &c : s)
	{
		int u = c - 'a';
		if(!son[p][u])
			return 0;
		p = son[p][u];
	}
	return cnt[p];
}

int main()
{
    
//  freopen("in.txt", "r", stdin);
  	string s;
  	while(getline(cin, s) && s != "")
  		insert(s);
  		
  	while(cin >> s)
  		cout << query(s) << endl;
    
    return 0;
}

---

HDU P1305 Immediate Decodability

#include <bits/stdc++.h>
using namespace std;

const int maxn = 100;
int son[maxn][2], idx;
vector<string> bits;

void init ()
{
	idx = 0;
	memset(son, 0, sizeof son);
	bits.clear();
}

void insert(string &s)
{
	int p = 0;
	for(char &c : s)
	{
		int u = c - '0';
		if(!son[p][u])
			son[p][u] = ++idx;
		p = son[p][u];
	}
}

bool query(string &s)
{
	int p = 0;
	for(char &c : s) 
	{
		int u = c - '0';
		p = son[p][u];
	}
	
	return son[p][0] || son[p][1];
} 

int main()
{
	freopen("in.txt", "r", stdin);
	int n = 1;
	
	do
	{
		init();
		string s;
		while(cin >> s && s[0] != '9')
		{
			bits.push_back(s);
			insert(s);
		}
		
		if(s.empty())
			return 0;
		
		bool prefix = false;
		for(string &bit : bits)
			if(query(bit))
			{
				prefix = true;
				break;
			}
		
		if(prefix)
			printf("Set %d is not immediately decodable\n", n);
		else
			printf("Set %d is immediately decodable\n", n);
		++n;
	}while(true);
		
	return 0;
}

---

HDU P1671 Phone list

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;
int son[maxn][10], idx;
vector<string> tmp;

void init()
{
	idx = 0;
	tmp.clear();
	memset(son, 0, sizeof son);
}

void insert(string &s)
{
	int p = 0;
	for(char &c : s)
	{
		int u = c - '0';
		if(!son[p][u])
			son[p][u] = ++idx;
		p = son[p][u];
	}
}

bool query(string &s)
{
	int p = 0;
	for(char &c : s)
	{
		int u = c - '0';
		p = son[p][u];
	}
	
	for(int i = 0; i < 10; ++i)
		if(son[p][i])
			return true;
	return false;
}


int main()
{
	freopen("in.txt", "r", stdin);
	int T;
	cin >> T;
	
	while(T--)
	{
		init();
		int n;
		cin >> n;
		for(int i = 0; i < n; ++i)
		{
			string num;
			cin >> num;
			insert(num);
			tmp.push_back(num);
		}
		
		bool f = false;
		for(int i = 0; i < n && !f; ++i)
			if(query(tmp[i]))
				f = true;
		
		puts(!f ? "YES" : "NO");		
	}
	return 0;
}

---

HDU P1247 Hat’s Words

#include <bits/stdc++.h>
using namespace std;

const int maxn = 3e5;
int son1[maxn][26], idx1;	//前缀树 
int son2[maxn][26], idx2;	//后缀树 
bool vis1[maxn], vis2[maxn];
int sum[maxn/3];
vector<string> vs;

void insert1(string &word)	//构造前缀树 
{
	int p = 0;
	for(char &c : word)
	{
		int u = c - 'a';
		if(!son1[p][u])
			son1[p][u] = ++idx1;
		p = son1[p][u];
	}
	vis1[p]  = true;
}

void query1(string &word)	//将word的前缀单词位置标记+1 
{
	int p = 0;
	for(int i = 0; i < word.size() - 1; ++i)
	{
		int u = word[i] - 'a';
		p = son1[p][u];
		if(vis1[p])
			++sum[i];
	}
}

void insert2(string &word)	//构造后缀树 
{
	int p = 0;
	for(int i = word.size() - 1; i >= 0; --i)
	{
		int u = word[i] - 'a';
		if(!son2[p][u])
			son2[p][u] = ++idx2;
		p = son2[p][u];
	}
	vis2[p] = true;
}

void query2(string &word)	//将word的后缀单词位置前一位标记+1 
{
	int p = 0;
	for(int i = word.size() - 1; i > 0; --i)
	{
		int u = word[i] - 'a';
		p = son2[p][u];
		if(vis2[p])
			++sum[i-1];
	}
}

bool check(string &word)
{
	for(int i = 0; i < word.size() - 1; i++)
		if(sum[i] == 2)
			return true;
	return false;
}

int main()
{
//	freopen("in.txt", "r", stdin);
	
	string tmp;
	while(cin >> tmp)
	{
		insert1(tmp);
		insert2(tmp);
		vs.push_back(tmp);
	}
		
	set<string> ans;
	for(string &t : vs)
	{
		memset(sum, 0, sizeof sum);
		query1(t);
		query2(t);
		if(check(t))
			ans.insert(t);
	}

	for(auto t : ans)
		cout << t << endl;
	
	return 0;
}