HDU 1387 Team Queue

来源:互联网 发布:淘宝网美肤宝眼霜 编辑:程序博客网 时间:2024/05/29 12:29
Team Queue

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1410 Accepted Submission(s): 475


Problem Description
Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is a team queue, for example.
In a team queue each element belongs to a team. If an element enters the queue, it first searches the queue from head to tail to check if some of its teammates (elements of the same team) are already in the queue. If yes, it enters the queue right behind them. If not, it enters the queue at the tail and becomes the new last element (bad luck). Dequeuing is done like in normal queues: elements are processed from head to tail in the order they appear in the team queue.

Your task is to write a program that simulates such a team queue.



Input
The input will contain one or more test cases. Each test case begins with the number of teams t (1<=t<=1000). Then t team descriptions follow, each one consisting of the number of elements belonging to the team and the elements themselves. Elements are integers in the range 0 - 999999. A team may consist of up to 1000 elements.

Finally, a list of commands follows. There are three different kinds of commands:

ENQUEUE x - enter element x into the team queue
DEQUEUE - process the first element and remove it from the queue
STOP - end of test case
The input will be terminated by a value of 0 for t.



Output
For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the element which is dequeued on a single line. Print a blank line after each test case, even after the last one.


Sample Input
2
3 101 102 103
3 201 202 203
ENQUEUE 101
ENQUEUE 201
ENQUEUE 102
ENQUEUE 202
ENQUEUE 103
ENQUEUE 203
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
5 259001 259002 259003 259004 259005
6 260001 260002 260003 260004 260005 260006
ENQUEUE 259001
ENQUEUE 260001
ENQUEUE 259002
ENQUEUE 259003
ENQUEUE 259004
ENQUEUE 259005
DEQUEUE
DEQUEUE
ENQUEUE 260002
ENQUEUE 260003
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0


Sample Output
Scenario #1
101
102
103
201
202
203

Scenario #2
259001
259002
259003
259004
259005

260001


k个团队排队,如果有认识的人就排在认识的人后边,(这里认识的人表示他们在同一个团队中),如果没有就要在队尾开始痛苦的排队了,

第一次WA:应该q里边存的是团队的编号,不是队员的编号。。。。提交WA

第二次:将声明队列q2放在程序执行中,每一次输入新数据就会重新生成新队列,因为队列没有清空队列元素的函数接口,而集合映射里有清空数组元素的功能。改正之后提交WA。

第三次:将自己的代码和AC的代码一点一点对照克隆,最后发现输出格式有错误。。。晕,案例应该是从1开始的,不是从0开始的。。。。提交AC


#include <iostream>#include <cstdio>#include <map>#include <queue>#include <fstream>using namespace std;map<int,int> team;int main(void){      // fstream cin("F.txt");    int t,o=1;    while(cin>>t,t)    {      //  q.clear();       // q2.clear();        //o++;        for(int i=0;i<t;i++)        {        int m;         int x;        cin>>m;        for(int j=0;j<m;j++)        {        cin>>x;        team[x]=i;        }        }        queue<int> q,q2[1100];        cout<<"Scenario #"<<o++<<endl;          //  char c;           // cin>>c;        while(1)        {            string s;        cin>>s;        if(s=="STOP")            break;        else if(s=="ENQUEUE")        {            int x;            cin>>x;            int k=team[x];            if(q2[k].empty()) q.push(k);            q2[k].push(x);        }        else if(s=="DEQUEUE")        {            int k=q.front();            cout<<q2[k].front()<<endl;            q2[k].pop();            if(q2[k].empty())  q.pop();        }        }        cout<<endl;        team.clear();    }    return 0;}

0 0
原创粉丝点击