麻豆小视频在线观看_中文黄色一级片_久久久成人精品_成片免费观看视频大全_午夜精品久久久久久久99热浪潮_成人一区二区三区四区

首頁 > 學(xué)院 > 開發(fā)設(shè)計(jì) > 正文

LA 3135 Argus

2019-11-14 08:49:19
字體:
供稿:網(wǎng)友

原題: 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 n um ≤ 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 2004 2005 2004 2004 2005

中文: 給你一堆命令,每一條命令分為Register Q_num Period ,表示每隔Period秒就會(huì)產(chǎn)生一個(gè)Q_num。現(xiàn)在讓你輸出前k個(gè)Q_num是多少。如果多個(gè)事件同時(shí)發(fā)生,先處理Q_num小的。

#include <bits/stdc++.h>using namespace std;struct reg{ int q,p,mark; reg(int QQ,int pp) { q=qq; p=pp; mark=p; } bool Operator > (const reg &r) const { if(this->mark!=r.mark) return this->mark>r.mark; else return this->q>r.q; }};vector<reg> vr;string s;int q,p,k;void solve(){ priority_queue<reg,vector<reg>,greater<reg>> pq(vr.begin(),vr.end()); while(k>0) { reg ans=pq.top(); pq.pop(); //cout<<ans.q<<" "<<ans.p<<" "<<ans.mark<<endl; cout<<ans.q<<endl; k--; ans.mark+=ans.p; pq.push(ans); } while(!pq.empty()) pq.pop(); vr.clear();}int main(){ ios::sync_with_stdio(false); while(cin>>s) { if(s=="#") { cin>>k; solve(); } else { cin>>q>>p; reg r(q,p); vr.push_back(r); } } return 0;}

解: 訓(xùn)練指南上面緊接著那道“一個(gè)簡單問題”的題目,亞洲區(qū)域賽居然有這么簡單的題目! 很簡單,只要把這些命令按照Period從小到大建立一個(gè)堆,堆頂肯定是Period最小的,輸出結(jié)果然后彈出后,把剛剛輸出命令的時(shí)間增加一個(gè)Period,然后再放回堆中。輸出前k個(gè)即可。


發(fā)表評論 共有條評論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 日本特级a一片免费观看 | 日本黄色一级毛片 | 国产精品一品二区三区四区18 | 国产精品久久久久免费视频 | 在线看国产视频 | 国产人成精品综合欧美成人 | 久久影院在线观看 | 中文字幕在线观看网址 | 亚洲精品tv久久久久久久久久 | 黄色片网页 | 午夜视频在线在免费 | 午夜精品老牛av一区二区三区 | 亚洲草逼视频 | 国产精品久久久久久婷婷天堂 | 亚洲最大av网站 | 日韩精品 | 亚洲精品久久久久久 | 色网站综合 | wwwxxx国产 | 色妞欧美| 成人免费视频视频在线观看 免费 | 精品一区二区三区网站 | 草妞视频 | 男人的天堂色偷偷 | 亚洲精品a级 | 欧美在线观看视频网站 | 久久精品性视频 | 中国免费一级毛片 | av电影观看 | 久久久久久久久久久久久久av | 色综合激情 | 国产羞羞视频 | 深夜视频福利 | 亚洲免费视频大全 | 国产高潮好爽好大受不了了 | 欧美一级美国一级 | 九九热在线视频观看这里只有精品 | 国产精品欧美日韩一区二区 | 久久精品re | 国产一区二区成人在线 | 99riav视频一区二区 |