Excuses, Excuses!(POJ_1598)

原创 2016年05月31日 20:42:15


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 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.


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 any order. After each set of output, you should print a blank line.

Sample Input

5 3
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
I am having a superhighway built in my bedroom.
I am actually crazy.
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!


一个字符串的小题竟然还卡了一段时间, 关键就是在中间处理上经常出错,或者是少写了点什么, 不过这题最大的收获, 一个是map的遍历。。。之前看的都已经忘光了,这次又重新学了一遍, 还有一个就是gets的风险和fgets的用法, 决定以后都用fgets来输入有空格的字符串,省得cb天天warning= =

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>

using namespace std;

int main()
    int n, m;
    char keywords[22][22];
    char str[22][77];
    int ans[22];
    int ccc = 0;
    map<char *, int> Map;
    while(scanf("%d%d", &n, &m) != EOF)
        for(int i = 0; i < n; i++)
            scanf("%s", keywords[i]);
        for(int x = 0; x < m; x++)

            fgets(str[x], 77, stdin);
            int len = strlen(str[x]), c = 0, cnt = 0;
            str[x][len - 1] = 0x00;
            char t[77];
            memset(t, 0, sizeof(t));
            for(int i = 0; i < len; i++)
                if(cnt && !isalpha(str[x][i]))
                    t[cnt] = '\0';
                    for(int j = 0; j < n; j++)
                        if(strcmp(t, keywords[j]) == 0)
                    cnt = 0;
                        t[cnt++] = str[x][i] + 32;
                        t[cnt++] = str[x][i];
            int cont = 0;
            map<char *, int> :: iterator it;
            for(it = Map.begin(); it != Map.end(); it++)
                cont += it->second;
            ans[x] = cont;
        int maxx = -1;
        for(int i = 0; i < m; i++)
            if(ans[i] > maxx)
                maxx = ans[i];
        printf("Excuse Set #%d\n", ccc);
        for(int i = 0; i < m; i++)
            if(ans[i] == maxx)
                printf("%s\n", str[i]);
    return 0;


HDU 1606(POJ 1598 UVA 409) Excuses, Excuses!(字符串匹配处理)

Excuses, Excuses! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...
  • YJX_xx
  • YJX_xx
  • 2014年07月21日 16:19
  • 562

poj 1598 Excuses, Excuses!

//这题有两点需要注意的:1.有可能excuses中存在着大写字母,这就需要将其大写字母转换为小写字母再比较 //2.keysword不能是excuses中的字串,而是一个单词,具体见下面的样例! ...
  • yzl_rex
  • yzl_rex
  • 2012年08月06日 19:05
  • 500

poj1598Excuses, Excuses!(字符串处理)

Excuses, Excuses! Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3991 ...
  • Sxx312
  • Sxx312
  • 2016年05月23日 17:14
  • 295

POJ 1598 Excuses, Excuses!

Description Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame...

Positively Must Know About Unicode and Character Sets (No Excuses!)

by Joel Spolsky Wednesday, October 08, 2003 Ever wonder about that mysterious Content-Type tag? Yo...


#include #include #include #include #include #include #include #include #include #include #include ...


题目大意: 我的理解: 暴力。 我的code: #include #include #include using namespace std; int n,m; //n个关键词,m个句子 ...

UVA 题目409 - Excuses, Excuses!

Excuses, Excuses!  Judge Ito is having a problem with people subpoenaed for jury duty g...
  • SJF0115
  • SJF0115
  • 2013年04月29日 14:13
  • 2740

uva 409 Excuses, Excuses!

简单字符串题目,有一点集合的小应用 #include #include #include #include #include using namespace std; #define...

UVa 409 Excuses! Excuses!

题目要注意的地方: 1)不区分大小写! 2)判断一个单词是否合法:前后是空格或者是非字母字符。比如8342364823abcd$^%$&^^* 那么,里面那个abcd也算是一个合法的单词。 原文...
  • gneveek
  • gneveek
  • 2011年10月06日 19:32
  • 750
您举报文章:Excuses, Excuses!(POJ_1598)