Windows Message Queue
来源:互联网 发布:易知投资工资 编辑:程序博客网 时间:2024/05/17 02:06
Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2576 Accepted Submission(s): 1008
Problem Description
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.
Input
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.
Output
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.
Sample Input
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
Sample Output
EMPTY QUEUE!
msg2 10
msg1 10
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2576 Accepted Submission(s): 1008
Problem Description
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.
Input
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.
Output
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.
Sample Input
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
Sample Output
EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
accode
#include<iostream>#include<vector>#include<queue>#include<string>#include<cstdio>using namespace std;struct node{ char s[100]; int n; int p; int i;};struct cmp{ bool operator()(const node&a,const node&b) { if(a.p==b.p) //如果p相等,就根据给出的顺序排序 { return a.i>b.i; } return a.p>b.p; }};int main(){ node t; priority_queue<node,vector<node>,cmp>Q;//优先级队列,用vector实现 string st; int k=1; while(cin>>st) { if(st=="GET") { if(Q.empty())//如果队列为空 { cout<<"EMPTY QUEUE!\n"; } else { t=Q.top(); Q.pop(); cout<<t.s<<' '<<t.n<<endl; } } else { cin>>t.s>>t.n>>t.p; t.i=k++; Q.push(t); } } return 0;}
0 0
- windows, thread ,message queue
- hdu1509 Windows Message Queue
- zoj2724-Windows Message Queue
- HDU1509-Windows Message Queue
- Windows Message Queue
- Windows Message Queue
- zoj_2724 Windows Message Queue
- hdu1509 Windows Message Queue
- hdoj- Windows Message Queue
- Windows Message Queue
- hd1509 Windows Message Queue
- H - Windows Message Queue
- Windows Message Queue--hdu1509
- HDU1509---Windows Message Queue
- Windows Message Queue
- hdu1509 Windows Message Queue
- Windows Message Queue
- Windows Message Queue
- 利用哈夫曼编码英文字母表(第六周作业)
- javaScript 总结
- "Hello World " —— 深入理解程序从编译到运行
- CSS 定位position属性
- .NET工程师必须掌握的知识点
- Windows Message Queue
- S3C2440上MMC/SD卡驱动实例开发讲解(一)
- X-47B已执行首次夜间飞行
- S3C2440上MMC/SD卡驱动实例开发讲解(二)
- 爱立信面试,面试官给我出的 C 算法问题
- 棋盘问题
- POJ 2236 Wireless Network(并查集)
- 遍历集合时出现的异常Exception in thread "main" java.util.ConcurrentModificationException
- 1059 搬寝室