POJ 1035 Spell checker

原创 2016年08月30日 17:35:57

Description

You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms. 
If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by one of the following operations: 
?deleting of one letter from the word; 
?replacing of one letter in the word with an arbitrary letter; 
?inserting of one arbitrary letter into the word. 
Your task is to write the program that will find all possible replacements from the dictionary for every given word. 

Input

The first part of the input file contains all words from the dictionary. Each word occupies its own line. This part is finished by the single character '#' on a separate line. All words are different. There will be at most 10000 words in the dictionary. 
The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by the single character '#' on a separate line. There will be at most 50 words that are to be checked. 
All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and each one contains 15 characters at most. 

Output

Write to the output file exactly one line for every checked word in the order of their appearance in the second part of the input file. If the word is correct (i.e. it exists in the dictionary) write the message: " is correct". If the word is not correct then write this word first, then write the character ':' (colon), and after a single space write all its possible replacements, separated by spaces. The replacements should be written in the order of their appearance in the dictionary (in the first part of the input file). If there are no replacements for this word then the line feed should immediately follow the colon.

Sample Input

i
is
has
have
be
my
more
contest
me
too
if
award
#
me
aware
m
contest
hav
oo
or
i
fi
mre
#

Sample Output

me is correct
aware: award
m: i my me
contest is correct
hav: has have
oo: too
or:
i is correct
fi: i

mre: more me

用了map,然后枚举每个串全部的情况。

实际效率还没有暴力快。

#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define fi first
#define se second
#define mp(i,j) make_pair(i,j)
#define pii pair<string,string>
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-8;
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int read()
{
	char ch = getchar();
	while (ch<'0' || ch>'9') ch = getchar();
	int x = ch - '0';
	while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';
	return x;
}
int T, n;
char g[N][20];
map<string, int> M;
string x;
vector<int> ans;

int main()
{
	n = 1;
	while (scanf("%s", g[n]), g[n][0] != '#') M[g[n]] = n++;
	while (cin >> x, x[0] != '#')
	{
		if (M[x])
		{
			cout << x << " is correct" << endl;
			continue;
		}
		ans.clear();
		for (int i = 0; i < x.size(); i++)
		{
			char c = x[i];	
			rep(j, 0, 25) if (c != 'a' + j)
			{
				x[i] = 'a' + j;
				if (M[x]) ans.push_back(M[x]);
			}
			x[i] = c;
			string q = "";
			for (int j = 0; j < x.size(); j++)
			{
				if (j != i) q = q + x[j];
			}
			if (M[q]) ans.push_back(M[q]);
		}
		for (int i = 0; i <= x.size(); i++)
		{
			string l = "", r = "";
			for (int j = 0; j < i; j++) l += x[j];
			for (int j = i; j < x.size(); j++) r += x[j];
			rep(j, 0, 25)
			{
				string y = l + (char)('a' + j) + r;
				if (M[y]) ans.push_back(M[y]);
			}
		}
		sort(ans.begin(), ans.end());
		cout << x << ":";
		for (int i = 0; i < ans.size(); i++)
		{
			if (i && ans[i] == ans[i - 1]) continue;
			printf(" %s", g[ans[i]]);
		}
		putchar(10);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 1035 Spell checker【字符串暴力处理】

Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 24311   ...
  • liuke19950717
  • liuke19950717
  • 2016年07月27日 22:08
  • 207

POJ 1035:Spell checker:字符串操作

Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19237   ...
  • smileyk
  • smileyk
  • 2014年09月19日 20:31
  • 253

POJ 1035 Spell checker 如何写代码的思考

POJ 1035 Spell checker 如何写代码的思考
  • Curious_again
  • Curious_again
  • 2017年06月05日 14:19
  • 239

POJ 1035 Spell checker 【字符串暴力查找】

Spell checker   You, as a member of a development team for a new spell checking program,...
  • C18854805113
  • C18854805113
  • 2017年11月21日 11:47
  • 151

POJ1035 字符串处理(水)

嗯虽然题目上写着水,但是说起来都是辛酸泪啊T^T 题目概述: 如今你身为一个项目组的一员,给你输入一个字典,单词不超过10000个,以#标记结束。之后再给定几个单词,进行字符串的匹配。当然这个...
  • Oh233
  • Oh233
  • 2015年01月14日 20:53
  • 450

编程练习:Spell checker

http://poj.org/problem?id=1035 Description You, as a member of a development team for a ne...
  • span76
  • span76
  • 2015年04月28日 11:10
  • 348

[ACM] POJ 1035 Spell checker (单词查找,删除替换增加任何一个字母)

Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 18693   ...
  • sr19930829
  • sr19930829
  • 2014年07月17日 15:58
  • 1640

(POJ1035)Spell checker 字符串的处理

Spell checker Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24755 Accepte...
  • STILLxjy
  • STILLxjy
  • 2016年09月30日 20:05
  • 174

POJ1035《Spell checker》方法:模拟

就是辨别单词和字典中相等或多一个字母或少一个字母的情况。 #include #include #include using namespace std; char dict[10001][...
  • chinachenyadong
  • chinachenyadong
  • 2013年03月16日 16:59
  • 305

POJ1035——Spell checker(字符串操作)

#include #include #include #include using namespace std; int cnt; struct s { int l; char w[1...
  • u014141559
  • u014141559
  • 2014年07月10日 19:20
  • 402
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1035 Spell checker
举报原因:
原因补充:

(最多只允许输入30个字)