hdu 1075 What Are You Talking About

trie树，注意处理只是字符串前缀而不是完整的对应关系的情况

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;


const int N = 10000005;


struct Trie
{
int next[30];
char str[15];
}trie[N];


int cnt = 1;


void insert(char *p,char *q)
{
int root = 0;
for(int i = 0;p[i];i++)
{
int x = p[i]-'a'+1;
if(trie[root].next[x]==0)
{
trie[root].next[x] = cnt;
root = cnt++;
}
else
{
root = trie[root].next[x];
}
}
strcpy(trie[root].str,q);
}


bool query(char *p)
{
int root = 0;
for(int i  =0;p[i];i++)
{
int x = p[i] - 'a' + 1;
if(trie[root].next[x]==0)
return 0;
else
root = trie[root].next[x];
}
if(trie[root].str[0]=='\0')
return 0;
printf("%s",trie[root].str);
return 1;
}


char line[3005];
char p[20],q[20];


int main()
{
while(gets(line))
{
if(strcmp(line,"START")==0)
continue;
if(strcmp(line,"END")==0)
break;
sscanf(line,"%s %s",p,q);
insert(q,p);
}
while(gets(line))
{
if(strcmp(line,"START")==0)
continue;
if(strcmp(line,"END")==0)
break;
int j = 0;
for(int i = 0;line[i];i++)
{
if(line[i]>='a'&&line[i]<='z')
{
p[j++] = line[i];
}
else
{
p[j] = '\0';
j = 0;
if(query(p)==0)
printf("%s",p);
printf("%c",line[i]);
}
}
if(j)
{
if(query(p)==0)
printf("%s",p);
}
printf("\n");
}
return 0;
}