UVA_540: Team Queue

最新推荐文章于 2022-11-11 12:07:28 发布

epsilon1

最新推荐文章于 2022-11-11 12:07:28 发布

阅读量506

点赞数

CC 4.0 BY-SA版权

分类专栏： cpp 算法文章标签： c++ uva stl

本文链接：https://blog.youkuaiyun.com/qq_20480611/article/details/48914221

算法同时被 2 个专栏收录

141 篇文章

订阅专栏

cpp

42 篇文章

订阅专栏

本文介绍了一种特殊的数据结构——团队队列，并通过一个具体的编程实现案例来解释如何模拟这种队列的行为。团队队列中，元素按团队进行组织，同一团队的元素在加入或离开队列时会保持相对顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 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 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

Sample Output

Scenario #1
101
102
103
201
202
203

Scenario #2
259001
259002
259003
259004
259005
260001

分析：本题有两个队列，每个团队有一个队列，团队整体又是一个队列。把题中的队列按团队分开，其实团队队列就是一个索引，每次插入删除都要更新团队队列

#include <cstdio>
#include <map>
#include <queue>

using namespace std;

const int maxn = 1000 + 10;

int main()
{
	int t,kase = 0;
	while(~scanf("%d",&t)&&t)
	{
		printf("Scenario #%d\n",++kase);
		map<int,int> team;
		for(int i=0; i<t; i++)
		{
			int n,x;
			scanf("%d",&n);
			while(n--) {scanf("%d",&x); team[x]=i;}
		}

		char op[10];
		queue<int> q,q2[maxn];
		while(~scanf("%s",op))
		{
			if(op[0]=='S')break;
			if(op[0]=='D'){
				int top = q.front();
				printf("%d\n",q2[top].front());
				q2[top].pop();
				if(q2[top].empty())q.pop();
			}else if(op[0]=='E'){
				int x;
				scanf("%d",&x);
				int t = team[x];
				if(q2[t].empty()){q.push(t);}
				q2[t].push(x);
			}
		}
		putchar('\n');
	}
    return 0;
}