Excuses, Excuses!(POJ_1598)

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

Description

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 any 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!

代码

一个字符串的小题竟然还卡了一段时间, 关键就是在中间处理上经常出错,或者是少写了点什么, 不过这题最大的收获, 一个是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)
    {
        ccc++;
        for(int i = 0; i < n; i++)
        {
            scanf("%s", keywords[i]);
        }
        getchar();
        for(int x = 0; x < m; x++)
        {

            Map.clear();
            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)
                        {
                            Map[t]++;;
                            c++;
                            break;
                        }
                    }
                    cnt = 0;
                }
                else
                {
                    if(isupper(str[x][i]))
                        t[cnt++] = str[x][i] + 32;
                    else
                        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]);
            }
        }
        printf("\n");
    }
    return 0;
}

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

UVA 409 - Excuses, Excuses!(字符串)

Excuses, Excuses!  Judge Ito is having a problem with people subpoenaed for jury duty...
  • coco430
  • coco430
  • 2013年07月24日 09:34
  • 317

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
  • 2785

poj1598Excuses, Excuses!(字符串处理)

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

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

题目链接:http://acm.tju.edu.cn/toj/showp2028.html 2028.   Excuses, Excuses! Time Limit: 0.5 Se...
  • muyujinxi
  • muyujinxi
  • 2016年08月30日 22:58
  • 104

Excuses, Excuses!

Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in ord...
  • NDohia
  • NDohia
  • 2016年04月09日 22:38
  • 115

poj1598 Excuses, Excuses!

poj1598 Excuses, Excuses!
  • jw72jw
  • jw72jw
  • 2011年01月29日 12:25
  • 1495

Problem B: Excuses, Excuses!

Description Judge Ito is having a problem with people subpoenaed for jury duty giving rather la...
  • phytn
  • phytn
  • 2014年11月20日 21:41
  • 441

UVA409 Excuses, Excuses!解题报告

一道字符串处理的题目,要求对给出的单词找到给出句子中匹配最多的句子。 核心是单词的匹配,思路也很直接,把每个单词但单独提取出来匹配。 题目不难,但是有挺多值得注意的编程细节。 #incl...
  • u012411003
  • u012411003
  • 2014年01月26日 16:30
  • 439

uva409 - Excuses, Excuses!

Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in ord...
  • Frankiller
  • Frankiller
  • 2012年06月05日 16:08
  • 1042

UVa 409 Excuses, Excuses!

/* coder: ACboy date: 2010-3-6 result: AC description: UVa 409 Excuses, Excuses!*/#include #include ...
  • ACb0y
  • ACb0y
  • 2010年03月06日 09:29
  • 1156
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Excuses, Excuses!(POJ_1598)
举报原因:
原因补充:

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