【队列】POJ2259-Team Queue-【容易题】

本题大意：

姑且这么理解吧，有很多人，每个人都属于一个小队

现在所有人要排一列队（跟那个小队没关系），根据enqueue或者dequeue指令行事

不过有一点 在enqueue的时候，如果队伍前面有熟人（同一个小队的人，就可以插到那个人的后面去）

相当于去食堂排一列队伍打饭，如果前面有同班同学就可以插队到后面，没有的话就从最后面排

用teamQueue记录长队伍中每个队伍的序列，因为实际情况肯定是按照每个小队 一块一块的排列下去的

然后用ved判断该组小队是否有元素已经在队伍中，如果要入队的那个人的小队，没有其他的队员在队列中，则将该小队的序号插入到teamQueue中

弹出的话就放在result队列里  最后全部弹出即可（当然也可以直接输出不记录result）

Team Queue

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 2137		Accepted: 797

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. 
Warning: A test case may contain up to 200000 (two hundred thousand) commands, so the implementation of the team queue should be efficient: both enqueing and dequeuing of an element should only take constant time.

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

#include <iostream>
#include <queue>
#include <map>

using namespace std;

int main()
{
	int teamNum,ca;
	cin>>teamNum;
	for(ca=1;teamNum!=0;ca++)
	{
		//一个case的开始我需要
		queue<int> teamQueue;
		queue<int> teamMember[1010];
		queue<int> result;
		map<int,int> teamMap;
		int ved[1010]={0};
		memset(ved,0,sizeof(ved) );

		for(int i=0;i<teamNum;i++)
		{
			int tn,temp;
			scanf("%d",&tn);
			while(tn--)
			{
				scanf("%d",&temp);
				teamMap[temp]=i;
			}
		}//end for i<teamNum

		char op[20];
		while(scanf("%s",&op),strcmp(op,"STOP")!=0 )
		{
			
			if(strcmp(op,"ENQUEUE")==0)
			{
				int value;
				scanf("%d",&value);
				if(ved[teamMap[value] ]==0)
				{
					teamQueue.push( teamMap[value] );//加入队列号
					ved[ teamMap[value] ]=1;
				}
				teamMember[ teamMap[value] ].push( value );
			}
			else if(strcmp(op,"DEQUEUE")==0 )
			{
				if(teamQueue.empty() )
					cout<<"error! teamQueue.empty()==0"<<endl;

				result.push( teamMember[ teamQueue.front() ].front() );
				teamMember[ teamQueue.front() ].pop();
				if(teamMember[ teamQueue.front() ].empty() )//第一个组的人已经没有了
				{
					ved[ teamQueue.front() ]=0;
					teamQueue.pop();
				}
			}//end op process
		}//end all op process
		printf("Scenario #%d\n",ca);
		while(result.empty()==0)
		{
			printf("%d\n",result.front() );
			result.pop();
		}
		cout<<endl;
		cin>>teamNum;
	}//end one case
	return 0;
}