HDU -1387 Team Queue

Team Queue

Time Limit: 2000/1000 MS (Java/Others)	Memory Limit: 65536/32768 K (Java/Others)

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，然后是队内人数以及队员编号，下面是很多行命令，"ENQUEUE d"表示编号为d的人开始排队，"DEQUEUE"表示队首的人出队，并且输出这个人的编号。排队有一个规矩，如果某人来排队时发现有他的队友在前面，那么它可以插队排在队友的后面。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;

int team[1000005];//每个人所在队的编号
queue<int>bigteam;//排队靠前的队伍编号
queue<int>teamlist[1005];//每个队的排序

int main()
{
    int t, n, num, len=1;;
    while(scanf("%d", &t), t)
    {
        while(!bigteam.empty())
            bigteam.pop();
        for(int i=0; i<1005; i++)
            while(!teamlist[i].empty())
                teamlist[i].pop();

        memset(team, 0, sizeof(team));
        for(int i=1; i<=t; i++)//先把每个人在那个队伍标记一下
        {
            scanf("%d", &n);
            for(int j=0; j<n; j++)
            {
                scanf("%d", &num);
                team[num]=i;
            }
        }
        printf("Scenario #%d\n", len++);
        char com[10];
        while(scanf("%s", com))
        {
            if(!strcmp(com, "ENQUEUE"))
            {
                scanf("%d", &num);
                if(teamlist[team[num]].empty())//如果这个人所在队伍还没有人
                    bigteam.push(team[num]);//压入这个人的队伍编号
                teamlist[team[num]].push(num);//如果这个人所在队伍已经有人，压入这个人的编号
            }
            else if(!strcmp(com, "DEQUEUE"))
            {
                int first_team_num=bigteam.front();//获取排在最前方的队伍编号
                printf("%d\n", teamlist[first_team_num].front());//把这只队伍的第一个人送出
                teamlist[first_team_num].pop();
                if(teamlist[first_team_num].empty())//如果这个编号的队伍没人了
                    bigteam.pop();
            }
            else
            {
                printf("\n");
                break;
            }
        }
    }

    return 0;
}