ACM学习历程——UVA540 Team Queue(队列,map:Hash)
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)的更多相关文章
- 团体队列UVA540 Team Queue(队列简单用法)
题目背景 队列和优先级队列是大多数计算机科学家都知道的数据结构.但是团队队列却不被人熟知,尽管在生活中经常出现.比如,午餐时间的食堂门口的队列就是一个团队队列.在一个团队队列中,每个元素属于一个团队. ...
- AndyQsmart ACM学习历程——ZOJ3870 Team Formation(位运算)
Description For an upcoming programming contest, Edward, the headmaster of Marjar University, is for ...
- UVA540 Team Queue——题解 by hyl天梦
UVA540 Team Queue 题解 题目描述:题目原题 https://vjudge.net/problem/UVA-540 Queues and Priority Queues are dat ...
- UVA.540 Team Queue (队列)
UVA.540 Team Queue (队列) 题意分析 有t个团队正在排队,每次来一个新人的时候,他可以插入到他最后一个队友的身后,如果没有他的队友,那么他只能插入到队伍的最后.题目中包含以下操作: ...
- 【UVA - 540】Team Queue (map,队列)
Team Queue Descriptions: Queues and Priority Queues are data structures which are known to most comp ...
- UVa540 Team Queue(队列queue)
队列 STL队列定义在头文件<queue>中, 用“ queue<int>s ” 方式定义, 用push()和pop()进行元素的入队和出队操作, front()取队首元素(但 ...
- UVa540 Team Queue
// 题意:有t个团队的人在排队.每次来了一个新人之后,如果他有队友在排队,那么这个新人会插队到队友的身后. // 要求支持三种指令:ENQUEUE x; DEQUEUE(队首出队); STOP.模拟 ...
- POJ 2259 - Team Queue - [队列的邻接表]
题目链接:http://poj.org/problem?id=2259 Queues and Priority Queues are data structures which are known t ...
- ACM学习历程—HDU2476 String painter(动态规划)
http://acm.hdu.edu.cn/showproblem.php?pid=2476 题目大意是给定一个起始串和一个目标串,然后每次可以将某一段区间染成一种字符,问从起始串到目标串最少需要染多 ...
随机推荐
- vim 模式查找
1. / 正向查找, ?反向查找 2. \v 激活very magic搜索模式,撰写正则表达式更接近于perl的正则表达式,大多数字符不需要进行转义 3. \V 激活noVeryMagic模式,按字符 ...
- 如何用openssl命令行生成证书
老大要我在web server里面加上https功能,可是但就使用openssl生成证书就耗费了我两天时间,网上有很多相关的资料,但是都写的很复杂, 照着他们的来,还是走了很多弯路. 我总结一下,步骤 ...
- 分布式搜索elasticsearch 环境搭建
1.elasticsearch安装 elasticsearch的安装超级easy,解压即用(要事先安装好java环境). 到官网 http://www.elasticsearch.org下载最新版的 ...
- Web网页开发常见经典问题
1.网络请求参数共享 转发dispatcher和重定向redirect 对于参数共享的区别 Redirect和Dispatcher 区别
- Android 手机怎么录屏制成gif图片(电脑录制gif图)
参考:http://www.cnblogs.com/dasusu/p/4903511.html 上面的博主说的很详细了,但作为学习记录我就重新写一遍帮助自己加深记忆 一.准备条件 1.你搭建了Andr ...
- 摩根大通银行被黑客攻克, ATM机/网银危在旦夕,winxp退市灾难来临了
winxp4月退市到如今还不到半年,就出现故障了 7600多万个消费者银行账户被黑.此外还有700万个小企业账户的信息也被黑客窃取,这个算不算灾难呢?假设等到银行业彻底崩溃,资金彻底丧失,那不仅仅是灾 ...
- win732 安装hadoop
windows下安装hadoop http://www.cnblogs.com/coder2012/archive/2013/05/25/3096631.html硬盘格式应为NTFS1 下载安装 Cy ...
- win7激活附带激活软件
链接: https://pan.baidu.com/s/1i46yoHR 密码: 7k6y
- notHere 对框架解决方案的框架预期处理
<script> import wepy from 'wepy' import api from '../api/api' import util from '../utils/util' ...
- 【题解】P4886快递员
[题解]P4886 快递员 淀粉质好题!!!加深了我对点分治的理解.最近分治学了好多啊. 题目大意 给定你一颗有边权的树,再给你\(m\)和点对,请你在树上选出来一个点,使得所有点对到这个点的距离的最 ...