LA3135:Argus(优先队列)
2015-06-10 19:20
375 查看
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
2004
2005
2004
2004
2005
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
2004
2005
2004
2004
2005
#include <iostream> #include <stdio.h> #include <string.h> #include <stack> #include <queue> #include <map> #include <set> #include <vector> #include <math.h> #include <bitset> #include <algorithm> #include <climits> using namespace std; #define LS 2*i #define RS 2*i+1 #define UP(i,x,y) for(i=x;i<=y;i++) #define DOWN(i,x,y) for(i=x;i>=y;i--) #define MEM(a,x) memset(a,x,sizeof(a)) #define W(a) while(a) #define gcd(a,b) __gcd(a,b) #define LL long long #define N 100005 #define MOD 1000000007 #define INF 0x3f3f3f3f #define EXP 1e-8 struct node { int num,p,cnt; bool operator< (node a)const { if(cnt!=a.cnt) return cnt>a.cnt; return num>a.num; } }; char str[20]; int num,p,n; int main() { priority_queue<node> Q; while(~scanf("%s",str)) { node a; if(str[0]=='#') break; scanf("%d%d",&a.num,&a.p); a.cnt = a.p; Q.push(a); } scanf("%d",&n); while(n--) { node a = Q.top(); Q.pop(); printf("%d\n",a.num); a.cnt=a.cnt+a.p; Q.push(a); } return 0; }
相关文章推荐
- Kmeans聚类算法及其java实现
- DB2 “The transaction log for the database is full” 存在的问题及解决方案
- WdatePicker日历控件使用方法
- 黑马程序员——Java基础(流程控制语句、选择结构、循环结构、方法)
- 创建线程后为什么马上调用CloseHandle()来关闭句柄
- LeetCode Remove Linked List Elements
- View Controller 生命周期的各个方法的用法
- 自定义cell,添加uilable,并且给lable添加tap手势,不响应的问题,对应解决方法
- android studio 快速进行应用程序包名更换
- 个人IOCP服务器例子解说
- winxp计算机管理中服务详解
- P225 3
- STM32-USB详细使用说明(转)
- Java 递归算法
- “世界很美好,值得你为之奋斗”我只同意后半句。
- 360技术开发实习笔试题1-java
- Android消息系统(一)
- POJ 2485 最小生成树
- bzoj 1314: River过河 优先队列
- java web学习路线2