我就是喜欢敲trie树

#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

#define pi 3.1415926535897932385
#define LL64 __int64
#define LL long long
#define oo 2147483647
#define N 200000
#define M 2050

char x[15], y[15], str[3030];

class trie
{
public:
	int pc;
	int trie_node[N][26];
	char word[N][15];
	void init(int i)
	{
		memset(trie_node[i], 0, sizeof(trie_node[i]));
	}
	void insert()
	{
		int p = 0;
		int j = 0;
		while (y[j] != '\0')
		{
			if (trie_node[p][y[j] - 'a'] == 0)
			{
				pc++;
				init(pc);
				trie_node[p][y[j] - 'a'] = pc;
				p = pc;
			}
			else
			{
				p = trie_node[p][y[j] - 'a'];
			}
			j++;
		}
		strcpy(word[p], x);
	}
	void search(int len)
	{
		int p = 0;
		for (int i = 0; i < len; i++)
		{
			if (trie_node[p][x[i] - 'a'] == 0)
			{
				printf("%s", x);
				return;
			}
			else p = trie_node[p][x[i] - 'a'];
			if (i == len - 1) printf("%s", word[p]);
		}
	}
}t;

int main()
{
	while (~scanf("%s", x))
	{
		t.init(0);
		t.pc = 0;
		while (scanf("%s", x))
		{
			if (strcmp(x, "END") == 0) break;
			scanf("%s", y);
			t.insert();
		}

		for (int i = 0; i < t.pc; i++)
		{
			for (int j = 0; j < 26; j++)
			{
				printf("%2d", t.trie_node[i][j]);
			}
			printf("\n");
		}*/
		scanf("%s", x);
		getchar();
		while (gets(str))
		{
			if (strcmp(str, "END") == 0) break;
			int len = strlen(str);
			int l = 0;
			for (int i = 0; i < len; i++)
			{
				if (str[i] >= 'a' && str[i] <= 'z')
				{
					x[l] = str[i];
					l++;
                                        if (i == len - 1){x[i] = '\0'; t.search(l);}
				}
				else
				{
					x[l] = '\0';
					if (l) t.search(l);
					printf("%c", str[i]);
					l = 0;
				}
			}
			printf("\n");
		}
	}
}