TOJ 2028.Excuses, Excuses!(字符串)

原创 2016年08月30日 22:58:49

题目链接:http://acm.tju.edu.cn/toj/showp2028.html


2028.   Excuses, Excuses!
Time Limit: 0.5 Seconds   Memory Limit: 65536K
Total Runs: 288   Accepted Runs: 115



Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to reduce the amount of time required listening to goofy excuses, Judge Ito has asked that you write a program that will search for a list of keywords in a list of excuses identifying lame excuses. Keywords can be matched in an excuse regardless of case.

Input

Input to your program will consist of multiple sets of data. Line 1 of each set will contain exactly two integers. The first number (1 ≤ K ≤ 20) defines the number of keywords to be used in the search. The second number (1 ≤ E ≤ 20) defines the number of excuses in the set to be searched. Lines 2 through K+1 each contain exactly one keyword. Lines K+2 through K+1+E each contain exactly one excuse. All keywords in the keyword list will contain only contiguous lower case alphabetic characters of length L (1 ≤ L ≤ 20) and will occupy columns 1 through L in the input line. All excuses can contain any upper or lower case alphanumeric character, a space, or any of the following punctuation marks [".,!?] not including the square brackets and will not exceed 70 characters in length. Excuses will contain at least 1 non-space character.

Output

For each input set, you are to print the worst excuse(s) from the list. The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords. If a keyword occurs more than once in an excuse, each occurrance is considered a separate incidence. A keyword "occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.

For each set of input, you are to print a single line with the number of the set immediately after the string "Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in the input's order. After each set of output, you should print a blank line.

Sample Input

5 3
dog
ate
homework
canary
died
My dog ate my homework.
Can you believe my dog died after eating my canary... AND MY HOMEWORK?
This excuse is so good that it contain 0 keywords.
6 5
superhighway
crazy
thermonuclear
bedroom
war
building
I am having a superhighway built in my bedroom.
I am actually crazy.
1234567890.....,,,,,0987654321?????!!!!!!
There was a thermonuclear war!
I ate my dog, my canary, and my homework ... note outdated keywords?

Sample Output

Excuse Set #1
Can you believe my dog died after eating my canary... AND MY HOMEWORK?

Excuse Set #2
I am having a superhighway built in my bedroom.
There was a thermonuclear war!



Source: South Central USA 1996
Submit   List    Runs   Forum   Statistics

一道字符串匹配的题,就是输出与key数组匹配最多的串,注意串不知一个!

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <string> 

using namespace std;
struct Node{
	char str[201];
	int num;
}Word[31];
int main(){
	int n,t;
	char key[31][31];
	char str[201];
	int flag=1;
	while(~scanf("%d %d",&n,&t)){
		
		int Maxn=-1;
		for(int i=0;i<n;i++)
			scanf("%s",key[i]);
		getchar();
		//printf("%s\n",key[4]);
		for(int i=1;i<=t;i++){
			Word[i].num=0;
			gets(str);
			//printf("%s\n",str);
			int len=strlen(str);
			char tmp[201];
			strcpy(tmp,str);
			strcpy(Word[i].str,str);
			//printf("%s\n",tmp);
			for(int j=0;j<len;j++)
				if(tmp[j]>='A'&&tmp[j]<='Z')
					tmp[j]=tmp[j]-'A'+'a';
			string s(tmp);
			for(int j=0;j<n;j++){
				int sat=0;
				while(1){
					sat=s.find(key[j],sat);
					if(sat==-1)
						break;
					if(sat>=1)
						if((tmp[sat-1]<'a'||tmp[sat-1]>'z')&&(tmp[sat+strlen(key[j])]<'a'||tmp[sat+strlen(key[j])]>'z'))
							Word[i].num++;
					sat++;
				}
				if(Maxn<Word[i].num)
					Maxn=Word[i].num;
			}
		}
		printf("Excuse Set #%d\n",flag++);
		for(int i=1;i<=t;i++)
			if(Word[i].num==Maxn)
				printf("%s\n",Word[i].str);
		printf("\n");
	}
} 


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

Excuses, Excuses!(字符串查找)

Excuses, Excuses! Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit St...
  • u014361775
  • u014361775
  • 2014年12月04日 09:14
  • 365

单调队列——广告印刷

最近,afy决定给TOJ印刷广告,广告牌是刷在城市的建筑物上的,城市里有紧靠着的N个建筑。 afy决定在上面找一块尽可能大的矩形放置广告牌。我们假设每个建筑物都有一个高度, 从左到右给出每个建筑物的高...
  • code_pang
  • code_pang
  • 2013年11月04日 12:09
  • 2550

TOJ 1283 A DP Problem 字符串处理,搜索

这个题,很多细节需要处理。  思路比较简单讲=号两边的 算式 整理为 ax+b=cx+d 的形式,这样再来计算; 总体来说难度不大。 记得结果为负号并且是浮点数的时候,与正数不一样; 比如 3x= -...
  • u013652219
  • u013652219
  • 2014年02月22日 18:41
  • 692

NKOJ 2150 广告印刷 单调队列

【单调队列】广告印刷 Time Limit:10000MS  Memory Limit:65536K Total Submit:296 Accepted:108  Case Time Limit:10...
  • zp___waj
  • zp___waj
  • 2016年06月15日 06:56
  • 713

toj 3515堆的应用

#include #include #include using namespace std; #define N 110004 struct Heap{ int da[N],size; void...
  • NeQrhk
  • NeQrhk
  • 2016年07月19日 08:25
  • 220

toj 4316 报数游戏

toj 4316 报数游戏 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 68 测试通过:35 描述n 个人站成...
  • q547550831
  • q547550831
  • 2016年08月17日 16:00
  • 438

TOJ 3533 - 黑白图像

小白书上的图的例题. LRJ介绍了两种方法, 一种是利用递归进行DFS
  • u014247806
  • u014247806
  • 2014年05月03日 19:05
  • 727

TOJ 4099 组队要和谐

组队要和谐 时间限制(普通/Java):1000MS/1000MS     运行内存限制:65536KByte 总提交: 19            测试通过: 4 描述 为了备战明年的省赛...
  • u011686226
  • u011686226
  • 2013年08月17日 19:42
  • 754

TOJ 2789.Monthly Expense(二分经典题目)

题目链接 : http://acm.tju.edu.cn/toj/showp2789.html Farmer John is an astounding accounting wizard and...
  • muyujinxi
  • muyujinxi
  • 2016年07月21日 18:08
  • 359

toj 4596 一行盒子

toj 4596 一行盒子 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 116 测试通过:11 描述你有一行盒...
  • q547550831
  • q547550831
  • 2016年08月20日 17:23
  • 747
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:TOJ 2028.Excuses, Excuses!(字符串)
举报原因:
原因补充:

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