Description

 

Team Queue

  Team Queue 

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 (    ). 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 根据题目意思,这个team队列,只需要考虑当前team里面是否有人在排队,
故可以每个team派一个代表去排队,然后team内部同时进行排队即可。而这个代表实用team脚标即可。而只有当team内部人全部出队后,team才出队。
然而需要快速查找每个人属于哪个team,需要使用一种映射方式,此处可以采用了map,也可以直接数组,因为数据不是很大。 代码1:采用stl队列
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#define LL long long using namespace std; int t;
int Hash[];
bool vis[];
queue<int> q[]; void input()
{
memset(Hash, -, sizeof(Hash));
memset(vis, false, sizeof(vis));
for (int i = ; i < ; ++i)
while (!q[i].empty())
q[i].pop();
int num, id = , tmp;
for (int i = ; i < t; ++i)
{
scanf("%d", &num);
for (int i = ; i < num; ++i)
{
scanf("%d", &tmp);
Hash[tmp] = id;
}
id++;
}
} void push(queue<int> &teamQ, int k)
{
if (!vis[Hash[k]])
{
vis[Hash[k]] = true;
teamQ.push(Hash[k]);
}
q[Hash[k]].push(k);
} void pop(queue<int> &teamQ)
{
int k = teamQ.front(), out;
out = q[k].front();
q[k].pop();
if (q[k].empty())
{
teamQ.pop();
vis[k] = false;
}
printf("%d\n", out);
} void work()
{
queue<int> teamQ;
char str[];
int k;
for (;;)
{
scanf("%s", str);
if (str[] == 'S')
return;
if (str[] == 'E')
{
scanf("%d", &k);
push(teamQ, k);
}
else
pop(teamQ);
}
} int main()
{
//freopen("test.in", "r", stdin);
int times = ;
while (scanf("%d", &t) != EOF && t)
{
printf("Scenario #%d\n", times++);
input();
work();
printf("\n");
}
return ;
}

此处team内部排队使用了链式结构的Queue。
代码2:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <string>
#define inf 0x3fffffff
#define eps 1e-10 using namespace std; struct isQueue
{
int val;
isQueue *next;
}; struct Queue
{
isQueue *top;
isQueue *rear;
void Init()
{
top = (isQueue *)malloc(sizeof(isQueue));
rear = (isQueue *)malloc(sizeof(isQueue));
top->next = rear;
rear->val = -1;
}
void Pop()
{
top = top->next;
}
int Front()
{
return top->next->val;
}
void Push(int k)
{
isQueue *v = (isQueue *)malloc(sizeof(isQueue));
rear->val = k;
rear->next = v;
rear = rear->next;
rear->val = -1;
}
bool Empty()
{
if (top->next->val == -1)
return 1;
else
return 0;
}
}; struct node
{
int isin;
Queue turn;
}; node p[1005];
map <int, int> Hash;
int t; void Init()
{
Hash.clear();
int k, v;
for (int i = 0; i < t; ++i)
{
p[i].isin = 0;
p[i].turn.Init();
scanf("%d", &k);
for (int j = 0; j < k; ++j)
{
scanf("%d", &v);
Hash[v] = i;
}
}
} void qt()
{
char ch[20];
int num;
int x;
queue <int> q;
for (;;)
{
scanf("%s", ch);
if (ch[0] == 'S')
{
printf("\n");
return;
}
if (ch[0] == 'E')
{
scanf("%d", &num);
x = Hash[num];
if (p[x].isin == 0)
{
q.push(x);
p[x].turn.Push(num);
p[x].isin++;
}
else
{
p[x].turn.Push(num);
p[x].isin++;
}
}
else if (ch[0] == 'D')
{
x = q.front();
num = p[x].turn.Front();
if (p[x].isin == 1)
q.pop();
p[x].turn.Pop();
p[x].isin--;
printf("%d\n", num);
}
}
} int main()
{
//freopen ("test.txt", "r", stdin);
int times = 1;
while (scanf("%d", &t) != EOF && t != 0)
{
printf("Scenario #%d\n", times);
Init();
qt();
times++;
}
return 0;
}

ACM学习历程——UVA540 Team Queue(队列,map:Hash)的更多相关文章

  1. 团体队列UVA540 Team Queue(队列简单用法)

    题目背景 队列和优先级队列是大多数计算机科学家都知道的数据结构.但是团队队列却不被人熟知,尽管在生活中经常出现.比如,午餐时间的食堂门口的队列就是一个团队队列.在一个团队队列中,每个元素属于一个团队. ...

  2. AndyQsmart ACM学习历程——ZOJ3870 Team Formation(位运算)

    Description For an upcoming programming contest, Edward, the headmaster of Marjar University, is for ...

  3. UVA540 Team Queue——题解 by hyl天梦

    UVA540 Team Queue 题解 题目描述:题目原题 https://vjudge.net/problem/UVA-540 Queues and Priority Queues are dat ...

  4. UVA.540 Team Queue (队列)

    UVA.540 Team Queue (队列) 题意分析 有t个团队正在排队,每次来一个新人的时候,他可以插入到他最后一个队友的身后,如果没有他的队友,那么他只能插入到队伍的最后.题目中包含以下操作: ...

  5. 【UVA - 540】Team Queue (map,队列)

    Team Queue Descriptions: Queues and Priority Queues are data structures which are known to most comp ...

  6. UVa540 Team Queue(队列queue)

    队列 STL队列定义在头文件<queue>中, 用“ queue<int>s ” 方式定义, 用push()和pop()进行元素的入队和出队操作, front()取队首元素(但 ...

  7. UVa540 Team Queue

    // 题意:有t个团队的人在排队.每次来了一个新人之后,如果他有队友在排队,那么这个新人会插队到队友的身后. // 要求支持三种指令:ENQUEUE x; DEQUEUE(队首出队); STOP.模拟 ...

  8. POJ 2259 - Team Queue - [队列的邻接表]

    题目链接:http://poj.org/problem?id=2259 Queues and Priority Queues are data structures which are known t ...

  9. ACM学习历程—HDU2476 String painter(动态规划)

    http://acm.hdu.edu.cn/showproblem.php?pid=2476 题目大意是给定一个起始串和一个目标串,然后每次可以将某一段区间染成一种字符,问从起始串到目标串最少需要染多 ...

随机推荐

  1. Spring学习十四----------Spring AOP实例

    © 版权声明:本文为博主原创文章,转载请注明出处 实例 1.项目结构 2.pom.xml <project xmlns="http://maven.apache.org/POM/4.0 ...

  2. Spring学习十二----------Bean的配置之@ImportResource和@Value

    © 版权声明:本文为博主原创文章,转载请注明出处 @ImportResource -引入XML配置文件 @Value -从配置文件中获取值 实例 1.项目结构 2.pom.xml <projec ...

  3. python之脚本参数optparse

    import optparse usage = "myprog[ -f <filename>][-s <xyz>] arg1[,arg2..]" opter ...

  4. wifi认证Portal开发系列(一):Radius与FreeRadius简介

    RADIUS 维基百科上的介绍: Remote Authentication Dial-In User Service (RADIUS) is a networking protocol that p ...

  5. HTTP状态码介绍详细

    HTTP协议中几个状态码的含义:1xx(临时响应) 表示临时响应并需要请求者继续执行操作的状态代码. 代码 说明 100 (继续) 请求者应当继续提出请求. 服务器返回此代码表示已收到请求的第一部分, ...

  6. Android NDK开发初步

    在配置好NDK开发之后就能够使用C/C++开发android了.以下以一个HelloWorld项目来说明 1.新建一个Androidproject 新建一个HelloWorldproject 代码例如 ...

  7. 2015年多校联合训练第一场OO’s Sequence(hdu5288)

    题意:给定一个长度为n的序列,规定f(l,r)是对于l,r范围内的某个数字a[i],都不能找到一个相应的j使得a[i]%a[j]=0.那么l,r内有多少个i,f(l,r)就是几. 问全部f(l,r)的 ...

  8. SRM 626 D1L1: FixedDiceGameDiv1,贝叶斯公式,dp

    题目:http://community.topcoder.com/stat?c=problem_statement&pm=13239&rd=15859 用到了概率论中的贝叶斯公式,而贝 ...

  9. jQuery中slideToggle()的详细使用方法和解释

    $(selector).slideToggle(speed,callback) 参数       speed和callback Speed  可选.规定元素从隐藏到显示的速度,默认‘normal’可能 ...

  10. VI带行号查看

        :set nu         带行号查看,并不改变文件内容 :set nonu     取消带行号查看 在每个用户的主目录下,都有一个 vi 的配置文件".vimrc"或 ...