HDU1509(优先级队列+模拟)
2013-05-04 22:42
453 查看
Windows Message Queue
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2271 Accepted Submission(s): 888
[/b]
[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<iostream> using namespace std; #define IF 1000000 typedef struct node { node* child; node* father; char name[10]; int paremeter; int pripority; }queuenode; int main() { char commond[5]; queuenode *head,*rear,*p,*q; head=new queuenode; rear=head; //strcpy(rear->name,"head"); // rear->pripority=IF; rear->father=head; head->child=rear; while(scanf("%s",commond)!=EOF) { if(strcmp(commond,"GET")==0) { if(rear->father==rear) cout<<"EMPTY QUEUE!"<<endl; else { p=rear; q=p; while(p!=head) { if(q->pripority>=p->pripority) q=p; p=p->father; } if(rear==q)rear=rear->father; q->child->father=q->father; q->father->child=q->child; cout<<q->name<<" "<<q->paremeter<<endl; delete q; } } else { p=new queuenode; head->father=p; p->child=head; p->father=rear; rear->child=p; rear=p; scanf("%s%d%d",p->name,&p->paremeter,&p->pripority); } } return 0; }
相关文章推荐
- 用数组模拟 优先级队列
- Java数组模拟优先级队列数据结构的实例
- hdu1896(模拟+优先级队列)
- HOJ 2778 CPU scheduling(STL 优先级队列+模拟)
- C++模拟实现堆heap和优先级队列poriorty_queue
- Java 模拟队列(一般队列、双端队列、优先级队列)
- uva 12100 Printer Queue 优先级队列模拟题 数组模拟队列
- 【C++】优先级队列的模拟实现
- uva 12100 Printer Queue 优先级队列模拟题 数组模拟队列
- uva 12100 Printer Queue 优先级队列模拟题 数组模拟队列
- 利用优先级队列实现事件驱动模拟
- 模拟进程队列管理——按照优先级入列
- PAT甲题题解-1014. Waiting in Line (30)-模拟,优先级队列
- leetcode 218. The Skyline Problem 优先级队列PriorityQueue + mulitset模拟Heap
- 1443. Printer Queue(用一个数组模拟队列,优先级高的先出队列)
- Java 模拟队列(一般队列、双端队列、优先级队列)
- STL 优先队列的优先级
- CCF--公共钥匙盒--优先队列模拟
- 数据结构--优先级队列
- 堆(优先级队列)