Time Limit: 0.5 Seconds Memory Limit:65536K
Total Runs: 803 Accepted Runs:394
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. AfterPeriod seconds of register, the result will be returned for the first time, and after that, the result will be returned everyPeriod seconds.
Here we have several different queries registered in Argus at once. It is confirmed that all the queries have differentQ_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 ofQ_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
Source: China 2004 - Beijing Onsite
问你按时间顺序前K个查询返回的ID是啥。如果同时返回,俺ID小的优先。
这题是个优先队列,按照时间优先的顺序搞一个队列,每次取出最优的Query,扔到另一个队列(普通数组实现或者直接打印就行)。
Show Code - Run ID 1488338
Submit Time: 2014-12-14 13:04:20 Language: GNU C++ Result: AcceptedPid: 1093 Time: 0.00 sec. Memory: 1084 K. Code Length: 0.9 K.
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
struct Node {
int time; //反馈时间起点
int id;
int loop; //时间周期
};
//比较器
struct cmp {
bool operator()(const Node a, const Node b) {
return a.time == b.time ? a.id > b.id : a.time > b.time;
}
};
int main() {
char s[16];
while (~scanf(" %s", s)) {
priority_queue<Node, vector<Node>, cmp> Q;
Node ri;
while (s[0] != '#') {
scanf(" %d %d %s", &ri.id, &ri.time, s);
ri.loop = ri.time;
Q.push(ri);
}
int K;
scanf(" %d", &K);
for (int i = 0; i < K; ++i) {
//取优先级高的打印
ri = Q.top();
Q.pop();
printf("%d\n", ri.id);
//把下一个周期的query推送回队列
ri.time += ri.loop;
Q.push(ri);
}
}
return 0;
}