UVa_540 - Team Queue

团队队列模拟

最新推荐文章于 2023-03-27 21:05:57 发布

原创最新推荐文章于 2023-03-27 21:05:57 发布 · 456 阅读

0 ·

CC 4.0 BY-SA版权

（1）栈队列链表专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种特殊的数据结构——团队队列，并通过一个具体的编程示例详细解释了如何实现这种队列，包括如何处理不同团队成员加入队列的规则及队列的操作。

Team Queue

Queues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occurs often in everyday life. At lunch timethe 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 thequeue from head to tail to check if some of its teammates (elements of the same team) are alreadyin the queue. If yes, it enters the queue right behind them. If not, it enters the queue at the tail andbecomes the new last element (bad luck). Dequeuing is done like in normal queues: elements areprocessed 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 file will contain one or more test cases. Each test case begins with the number of teams t( $1 \le t \le 1000$ ). Then t team descriptions follow, each one consisting of the number of elementsbelonging 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 theimplementation of the team queue should be efficient: both enqueing and dequeuing of an elementshould 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 ablank 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个团队在排一个长队（每个团队有若干人）

当每次新来一个人时，如果有熟人排队就插到熟人的后面（熟人就是和他一个团队的人，和生活中排队买票类似，有熟人，你可以插对）；如果没有熟人（即没有队友），只能排队到长队对尾

解题思路：

1. 首先必须标示每个人所属的团队号，可以用一个数组，或者直接用map保存每个人的团队ID；

2. 对于每个团队必须是符合队列的先进先出，而且要求常数时间出对，入队，所以对于n个团队，必须设置n个队列，保持有序性；

3. 同时用一个队列teamq，保存团队ID，保证团队之间的有序性

代码如下：

#include<iostream>
#include<cstdio>
#include<queue>
#include<map>
using namespace std;

const int MAXSIZE = 1000 +5;
int main()
{
    //freopen("540.txt","r",stdin);
    int n,icase = 0;
    while(cin>>n&&n!=0)
    {
        cout<<"Scenario #"<<++icase<<endl;
        map<int, int>team;
        int x;
        for(int i = 0; i < n; i++)
        {
            int t; cin>>t;
            while(t--) { cin>>x; team[x] = i; }
        }
        queue<int> teamq,q[MAXSIZE];
        for(;;)
        {
            string cmd; cin>>cmd;
            if(cmd[0]=='S') break;
            if(cmd[0]=='E'){
                cin>>x; int id = team[x]; //id 表示对号
                if(q[id].empty()) teamq.push(id);//对号入队
                q[id].push(x); 
            }
            else if(cmd[0] == 'D'){
                int id = teamq.front();
                cout<<q[id].front()<<endl; q[id].pop();
                if(q[id].empty()) teamq.pop(); //队号为id的人都出对列了，对应对号也出对
            }
        }
        cout<<endl;
    }
    return 0;
}