题目:
Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1394 Accepted Submission(s): 511
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!
Author
ZHOU, Ran
Source
Zhejiang University Local Contest 2006, Preliminary
Recommend
linle
源码:
#include<iostream>
#include<cstring>
using namespace std;
struct cmd//定义命令结构体 用堆表示优先队列,对优先级、序号进行排序
{
char msg[2000];
int pri;
int num;
int par;
}c[70000];
int length=0;///堆长度
int cnt=0;记录命令序号
void insert()/插入一条命令
{
cin>>c[length].msg>>c[length].par>>c[length].pri;
c[length].num=cnt;
cnt++;
length++;
int i=length-1;
while(1)
{
if(i==0)break;
if(c[i].pri<c[(i-1)/2].pri)
{
cmd temp=c[i];
c[i]=c[(i-1)/2];
c[(i-1)/2]=temp;
i=(i-1)/2;
}
else break;
}
}
void heapfy(int i)调整堆特性
{
int max=i;
int left=i*2+1;
int right=i*2+2;
if(left<length&&(c[max].pri>c[left].pri||(c[max].pri==c[left].pri&&c[max].num>c[left].num)))
{
max=left;
}
if(right<length&&(c[max].pri>c[right].pri||(c[max].pri==c[right].pri&&c[max].num>c[right].num)))
{
max=right;
}
if(max!=i)
{
cmd temp=c[i];
c[i]=c[max];
c[max]=temp;
heapfy(max);
}
}
cmd get()///获得队首元素
{
cmd temp;
temp=c[0];
c[0]=c[length-1];
c[length-1]=temp;
length--;
heapfy(0);
return c[length];
}
int main()
{
char ch[5];
while(cin>>ch)
{
if(strcmp(ch,"GET")==0)
{
if(length==0)
{
cout<<"EMPTY QUEUE!"<<endl;
}
else
{
cmd res=get();
cout<<res.msg<<' '<<res.par<<endl;
}
}
else if(strcmp(ch,"PUT")==0)
{
insert();
}
}
return 0;
}