UVA 12686 Trending Topic

Trending Topic

Time limit: 1.000 seconds 

Imagine you are in the hiring process for a company whose principal activity is the analysis of information in the Web. One of the tests consists in writing a program for maintaining up to date a set of trending topics. You will be hired depending on the efficiency of your solution. They provide you with text from the most active blogs. The text is organised daily and you have to provide the sorted list of the N most frequent words during the last 7 days, when asked.

INPUT

Each input file contains one test case. The text corresponding to a day is delimited by tag <text>. Queries of top N words can appear between texts corresponding to two different days. A top N query appears as a tag like <top 10 />. In order to facilitate you the process of reading from input, the number always will be delimited by white spaces, as in the sample.

 

 

Notes:

• All words are composed only of lowercase letters of size at most 20.

• The maximum number of different words that can appear is 20000.

• The maximum number of words per day is 20000.

• Words of length less than four characters are considered of no interest.

• The number of days will be at most 1000.

• 1 ≤ N ≤ 20

 

OUTPUT

The list of N most frequent words during the last 7 days must be shown given a query. Words must appear in decreasing order of frequency and in alphabetical order when equal frequency. There must be shown all words whose counter of appearances is equal to the word at position N. Even if the amount of words to be shown exceeds N.

 

SAMPLE INPUT

<text> imagine you are in the hiring process of a company whose main business is analyzing the information that appears in the web </text>

<text> a simple test consists in writing a program for maintaining up to date a set of trending topics </text>

<text> you will be hired depending on the efficiency of your solution </text>

<top 5 />

<text> they provide you with a file containing the text corresponding to a highly active blog </text>

<text> the text is organized daily and you have to provide the sorted list of the n most frequent words during last week when asked </text>

<text> each input file contains one test case the text corresponding to a day is delimited by tag text </text>

<text> the query of top n words can appear between texts corresponding to two different days </text>

<top 3 />

<text> blah blah blah blah blah blah blah blah blah please please please </text>

<top 3 />

 

SAMPLE OUTPUT
<top 5>

analyzing 1

appears 1

business 1

company 1

consists 1

date 1

depending 1

efficiency 1

hired 1

hiring 1

imagine 1

information 1

main 1

maintaining 1

process 1

program 1

simple 1

solution 1

test 1

that 1

topics 1

trending 1

whose 1

will 1

writing 1

your 1

</top>

<top 3>

text 4

corresponding 3

file 2

provide 2

test 2

words 2

</top>

<top 3>

blah 9

text 4

corresponding 3

please 3

</top>

 

解题：极其蛋疼狗血的破题目。

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <cstdlib>
#include <string>
#include <set>
#include <map>
#include <stack>
#define LL long long
#define pii pair<int,int>
#define INF 0x3f3f3f3f
using namespace std;
struct cao{
    string word;
    int cnt;
    cao(string x = "*",int y = 0){
        word = x;
        cnt = y;
    }
};
map<string,int>mp;
string tmp;
vector<string>v[7];
cao nima[200100];
bool cmp(const cao &x,const cao &y){
    if(x.cnt == y.cnt) return x.word < y.word;
    return x.cnt > y.cnt;
}
int main() {
    mp.clear();
    int n = 0,i,j,ask,tot;
    while(cin>>tmp){
        if(tmp == "<text>"){
            j = n%7;
            for(i = 0; i < v[j].size(); i++) mp[v[j][i]]--;
            v[j].clear();
            while(cin>>tmp){
                if(tmp == "</text>") break;
                if(tmp.length() >= 4){
                    mp[tmp]++;
                    v[j].push_back(tmp);
                }
            }
            n++;
        }else{
            cin>>ask>>tmp;
            tot = 0;
            for(map<string,int>::iterator it = mp.begin();it != mp.end(); it++)
                nima[tot++] = cao(it->first,it->second);
            sort(nima,nima+tot,cmp);
            printf("<top %d>\n",ask);
            for(i = 0,j = 0; i < ask; i++)
                printf("%s %d\n",nima[i].word.c_str(),nima[i].cnt);
            for(j = i,i--; j < tot && nima[j].cnt == nima[i].cnt; j++)
                 printf("%s %d\n",nima[j].word.c_str(),nima[j].cnt);
            puts("</top>");
        }
    }
    return 0;
}