ARC 065C DayDream Trie+暴力

点击打开链接

题意:给出串str问是否能由若干个s串按任意顺序组成

思路:对s建立Trie 在Trie上对str进行暴力匹配即可

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=1e6+20;
const int M=30;
char s[M][M]={{"dream"},{"dreamer"},{"erase"},{"eraser"}};
int len[5];

int root,num=0;
int Next_n[N][M],word[N];//trie Next[u][id] u结点编号 
void insert(int x)
{
	int u=0,l=len[x];
	for(int i=0;i<l;i++)
	{
		char t=s[x][i];
		int id=t-'a';
		if(!Next_n[u][id])
		{
			Next_n[u][id]=++num;
		}
		u=Next_n[u][id];	
	}
	word[u]=x;//结点u是第几个单词 
}
char str[N];
int n;
bool flag=false;
void dfs(int pos)
{
	if(pos>=n)
	{
		flag=true;
		return;
	}
	if(!flag)
	{
		int u=root;
		for(int i=pos+1;i<=n;i++)
		{
			int id=str[i]-'a';
			u=Next_n[u][id];
			
			if(!u)
			break;
		
			if(word[u]!=-1)
			{
				dfs(pos+len[word[u]]);//用单词u,失败在回溯回来继续匹配 
			}
		}
		
	}
}
int main()
{
	memset(Next_n,0,sizeof(Next_n));
	memset(word,-1,sizeof(word));
	root=0;
	for(int i=0;i<4;i++)//dictionary
	{
		len[i]=strlen(s[i]);
		insert(i);
	}
	
	while(scanf("%s",str+1)!=EOF)
	{
		flag=false;
		n=strlen(str+1);
		dfs(0);//暴力匹配 
		if(flag)
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
	}
	return 0;
}