poj 2051 Argus

最新推荐文章于 2016-11-13 10:38:01 发布

weixin_30256901

最新推荐文章于 2016-11-13 10:38:01 发布

阅读量120

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/w0w0/archive/2011/12/08/2281263.html

介绍了一个名为Argus的数据流管理系统，该系统能够处理实时连续的数据流，并允许用户注册查询指令来获取所需的数据分析结果。例如，可以设定每五分钟返回一次过去五分内的最高温度等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Argus

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 7771		Accepted: 3434

Description

A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such as Web usage logs and telephone call records. Likewise, queries over streams run continuously over a period of time and incrementally return new results as new data arrives. For example, a temperature detection system of a factory warehouse may run queries like the following.

Query-1: "Every five minutes, retrieve the maximum temperature over the past five minutes."
Query-2: "Return the average temperature measured on each floor over the past 10 minutes."

We have developed a Data Stream Management System called Argus, which processes the queries over the data streams. Users can register queries to the Argus. Argus will keep the queries running over the changing data and return the results to the corresponding user with the desired frequency.

For the Argus, we use the following instruction to register a query:

Register Q_num Period

Q_num (0 < Q_num <= 3000) is query ID-number, and Period (0 < Period <= 3000) is the interval between two consecutive returns of the result. After Period seconds of register, the result will be returned for the first time, and after that, the result will be returned every Period seconds.

Here we have several different queries registered in Argus at once. It is confirmed that all the queries have different Q_num. Your task is to tell the first K queries to return the results. If two or more queries are to return the results at the same time, they will return the results one by one in the ascending order of Q_num.

Input

The first part of the input are the register instructions to Argus, one instruction per line. You can assume the number of the instructions will not exceed 1000, and all these instructions are executed at the same time. This part is ended with a line of "#".

The second part is your task. This part contains only one line, which is one positive integer K (<= 10000).

Output

You should output the Q_num of the first K queries to return the results, one number per line.

Sample Input

Register 2004 200
Register 2005 300
#
5

Sample Output

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

struct n
{
int q_num;
int time;
int value;
};
vector<n> nodes;
int comp(n a,n b)
{
if(a.value!=b.value)
return a.value<b.value;
return a.q_num<b.q_num;
}
int main()
{
char temp[10];
int Q_num,period;
int k;
    vector<n>::iterator ite;    
//    freopen("E:\\c++\\oj\\t.txt","rt",stdin);
    cin>>temp;
while(strcmp(temp,"#")!=0)
    {
        cin>>Q_num>>period;
        n new_node;
        new_node.q_num=Q_num;
        new_node.time=period;
        new_node.value=period;
        nodes.push_back(new_node);
        cin>>temp;
    }
    cin>>k;
while(k--)
    {
        n ins;    
        ite=min_element(nodes.begin(),nodes.end(),comp);
        cout<<(*ite).q_num<<endl;
        ins.q_num = (*ite).q_num;
        ins.time = (*ite).time;
        ins.value = (*ite).value+ins.time;
        nodes.erase(ite);
        nodes.push_back(ins);
    }
return 0;
}