8.1.6 Windows Message Queue
2013-07-24 20:51
99 查看
Windows Message Queue |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 50 Accepted Submission(s): 33 |
[align=left]Problem Description[/align] Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system will add a message to the queue. Meanwhile, the process will do a loop for getting message from the queue according to the priority value if it is not empty. Note that the less priority value means the higher priority. In this problem, you are asked to simulate the message queue for putting messages to and getting message from the message queue. |
[align=left]Input[/align] There's only one test case in the input. Each line is a command, "GET" or "PUT", which means getting message or putting message. If the command is "PUT", there're one string means the message name and two integer means the parameter and priority followed by. There will be at most 60000 command. Note that one message can appear twice or more and if two messages have the same priority, the one comes first will be processed first.(i.e., FIFO for the same priority.) Process to the end-of-file. |
[align=left]Output[/align] For each "GET" command, output the command getting from the message queue with the name and parameter in one line. If there's no message in the queue, output "EMPTY QUEUE!". There's no output for "PUT" command. |
[align=left]Sample Input[/align]GET PUT msg1 10 5 PUT msg2 10 4 GET GET GET |
[align=left]Sample Output[/align]EMPTY QUEUE! msg2 10 msg1 10 EMPTY QUEUE! |
#include <cmath> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cstdlib> #include <queue> using namespace std; const int maxn=210; struct qq { char s[101]; int t,v,p; friend bool operator < (qq a,qq b) { if (a.p==b.p) return a.t>b.t; return a.p>b.p; } } ya; priority_queue<qq> q; char s[maxn],s1[maxn]; int cnt,l; void close() { exit(0); } void init() { cnt=0; while (scanf("%s",s)!=EOF) { if (s[0]=='G') { if (q.empty()) printf("EMPTY QUEUE!\n"); else { ya=q.top(); q.pop(); l=strlen(ya.s); for (int i=0;i<l;i++) printf("%c",ya.s[i]); printf(" %d\n",ya.v); } } else { cnt++; scanf("%s %d %d",s1,&ya.v,&ya.p); strcpy(ya.s,s1); ya.t=cnt; q.push(ya); } } } int main () { init(); close(); return 0; }
相关文章推荐
- HDU 1509 -- Windows Message Queue(优先队列)
- Windows Message Queue
- Windows Message Queue(水题)
- Windows Message Queue
- hdu 1509 Windows Message Queue (优先队列)
- Oracle 8.1.6,Windows 2000 Server上安装基于Pro*C 的应用软件:change_on_install口令引起的问题
- hdu 1509 Windows Message Queue(优先队列)
- ZOJ - 2724 Windows Message Queue——优先队列
- hdoj 1509 Windows Message Queue 【STL 优先队列】
- HDU 1509 Windows Message Queue(优先队列)
- hrbust 哈理工oj 1246 Windows Message Queue【优先队列】
- ZOJ 2724 Windows Message Queue
- HDU 1509 Windows Message Queue (优先队列)
- ZOJ 2724 Windows Message Queue 堆
- Windows Message Queue
- HDU - 1509 Windows Message Queue (优先队列 重载运算符)
- Windows Message Queue(容器之queue)
- HDU-1509-Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue(优先队列)