Team Queue |
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 129 Accepted Submission(s): 63 |
|
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 |
题意：输入n个队列(q[i])（要对每个队列进行编号），每个队列有m个元素。接下来有三种操作。自己建立一个新的总队列Q(队列的队列)
1.
ENQUEUE，向队列Q压入一个元素a,判断这个元素a是不是属于输入队列q[i]中的元素，是的话，就压入q[i]中去
2.
DEQUEUE，处理Q队列中的第一个分队列，输出每个分队列的队首元素，输出之后将该分队列的队首元素pop出去，如果该分队列为空，就将该分队列从总队列中除名
3.
STOP,停止输入。输入0表示输入结束，程序终止
#include<iostream> #include<stdio.h> #include<queue> #include<string.h> #include<map> using namespace std; int main() { int n,k=1; int vis[1005]; while(scanf("%d",&n)!=EOF&&n) { memset(vis,0,sizeof(vis)); queue<int>q[1005];//分队列 queue<int>Q;//总队列 map<int,int>team; for(int i=1;i<=n;i++) { int m; scanf("%d",&m); for(int j=0;j<m;j++) { int member; cin>>member; team[member]=i;//为每个队员与团队编号建立关系 } } printf("Scenario #%d ",k++); string str; while(cin>>str) { if(str=="STOP") break; else if(str=="ENQUEUE") { int mm; cin>>mm; q[team[mm]].push(mm);//将该元素插到对应分队列中 if(vis[team[mm]]==0)//如果该分队列还没有进入总队列 { Q.push(team[mm]); vis[team[mm]]=1; } } else if(str=="DEQUEUE") { printf("%d ",q[Q.front()].front());//输出总队列中处于队首的分队列的队首元素 q[Q.front()].pop(); if(q[Q.front()].empty())//如果该分队列为空 { vis[Q.front()]=0; Q.pop();//将该分队列除名 } } } printf(" "); } return 0; }