UVALive 3135 Argus(优先队列)
来源:互联网 发布:接机用车有什么软件 编辑:程序博客网 时间:2024/06/08 07:02
思路:优先队列
#include<bits/stdc++.h>using namespace std;struct Item{int QNum,Period,Time;bool operator <(const Item&a)const{return Time > a.Time || (Time == a.Time && QNum > a.QNum);}};int main(){priority_queue<Item> pq;char s[20];while (scanf("%s",s) && s[0]!='#'){Item item;scanf("%d%d",&item.QNum,&item.Period);item.Time = item.Period;pq.push(item);}int K;scanf("%d",&K);while (K--){Item r = pq.top();pq.pop();printf("%d\n",r.QNum);r.Time+=r.Period;pq.push(r);}return 0;}
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 P eriod
Q num (0 < Qnum ≤ 3000) is query ID-number, and P eriod (0 < P eriod ≤ 3000) is the interval
between two consecutive returns of the result. After P eriod seconds of register, the result will be
returned for the first time, and after that, the result will be returned every P eriod 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
2004
2005
2004
2004
2005
- UVALive - 3135 - Argus (优先队列!!)
- UVALive 3135 Argus(优先队列)
- UVALive 3135 Argus(优先队列)
- UVALive - 3135 Argus 优先队列
- UVALive - 3135 Argus 优先队列
- UVALive - 3135 Argus【优先队列】
- UVALive 3135--Argus+自定义优先队列的优先规则
- 【优先队列之多路归并】UVALive 3135 Argus
- 指南 第三章 例题3 UVALive 3135 Argus(优先队列的应用)
- LA 3135 Argus ( 优先队列 )
- LA 3135 argus(优先队列)
- LA 3135 Argus 优先队列
- 1203 - Argus(优先队列)
- Beijing 2004 / UVa 1203 / UVALive 3135 / ZOJ 2212 Argus (优先队列)
- 优先队列 阿格斯(Argus Beijing La 3135)
- LA3135——Argus(优先队列)
- poj 2051 Argus(优先队列)
- UVA 1203 - Argus(优先队列)
- iOS开发里面的4个层次
- ios socket第三方框架 AsyncSocket使用简介
- LintCode:平衡二叉树
- Symfony2创建基于域名的路由(原创翻译)
- 【原】iOSCoreAnimation动画系列教程(二):CAKeyFrameAnimation【包会】
- UVALive 3135 Argus(优先队列)
- 括号匹配(二)
- 最好不过的IOS开发者面试题---纪念离我们远去的MRC模式
- 顺序表的常规函数
- Android SDK下载太慢,更换国内镜像源
- javadoc解决中文乱码问题
- 几个常用存储引擎的特点
- Fragment 视图重绘问题
- Floating-Point Numbers, UVa11809