HDU 1387 && UVa 540 Team Queue（队列应用）

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

题意：有t个团队的人正在拍一个长队。每次新来一个人时，如果他有队友在排队，那么这个新人会插队到最后一个队友的身后。如果没有任何一个队友排队，则他会排到长队的队尾。输入每个团队中所有队员的编号，要求支持如下三种指令（前两种指令可以穿插进行）。

ENQUEUE x： 编号为x的人进入长队、

DEQUEUE： 长队的队首出队

STOP ： 停止
对于每个DEQUEUE 输出出队人的编号

思路：题意长得就像队列。。。只不过是有很多队列。。。我想不到怎么把队列在一个大的队列里操作。。。后来发现，原来可以把，每个小队列赋值一个编号，那个“大队列”存的是小队列的编号。。。奇妙。。map又一次起了赋值作用。。这是我遇到的第二题了。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1e3 + 5;
int main()
{
    int t, l = 0;
    while(~scanf("%d",&t) ,t)
    {
        map<int, int > team;  
        queue<int> q, q1[maxn]; //q为总的长队列，q1为每个团队的队列
        int n;
        l++;
        printf("Scenario #%d\n",l);
        while(t--)
        {
            scanf("%d",&n);
            int x;
            for(int i = 1; i <= n; i++)
            {
                scanf("%d",&x);
                team[x] = t;   //利用map，给每个队员赋值他们的团队编号
            }
        }
        char cmd[15];
        int x;
        while(~scanf("%s",cmd))
        {
            if(cmd[0] == 'S') break;
            if(cmd[0] == 'E')
            {
                scanf("%d",&x);
                int t = team[x];     //先对团队操作
                if(q1[t].empty()) q.push(t);  //如果这个团队一个人也不在长队列，就把这个“团队t（编号）”放到长队列里
                q1[t].push(x);   //然后把团队t里面新增队员
            }
            if(cmd[0] == 'D')
            {
                int t = q.front();
                printf("%d\n",q1[t].front());
                q1[t].pop();   //如果队首出队之后，长队伍一个人没有，就把这个团队在长队伍里去掉
                if(q1[t].empty()) q.pop();
            }
        }
        printf("\n");
    }
    return 0;
}