hdu1387 模拟队列
2024-08-31 13:00:00
Team Queue |
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 129 Accepted Submission(s): 63 |
|
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 |
|
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 |
|
Sample Output
Scenario #1 |
题意：输入n个队列(q[i])（要对每个队列进行编号），每个队列有m个元素。接下来有三种操作。自己建立一个新的总队列Q(队列的队列)
1.
ENQUEUE，向队列Q压入一个元素a,判断这个元素a是不是属于输入队列q[i]中的元素，是的话，就压入q[i]中去
2.
DEQUEUE，处理Q队列中的第一个分队列，输出每个分队列的队首元素，输出之后将该分队列的队首元素pop出去，如果该分队列为空，就将该分队列从总队列中除名
3.
STOP,停止输入。输入0表示输入结束，程序终止
#include<iostream>
#include<stdio.h>
#include<queue>
#include<string.h>
#include<map>
using namespace std;
int main()
{
int n,k=;
int vis[];
while(scanf("%d",&n)!=EOF&&n)
{
memset(vis,,sizeof(vis));
queue<int>q[];//分队列
queue<int>Q;//总队列
map<int,int>team;
for(int i=;i<=n;i++)
{
int m;
scanf("%d",&m);
for(int j=;j<m;j++)
{
int member;
cin>>member;
team[member]=i;//为每个队员与团队编号建立关系
}
}
printf("Scenario #%d\n",k++);
string str;
while(cin>>str)
{
if(str=="STOP")
break;
else if(str=="ENQUEUE")
{
int mm;
cin>>mm;
q[team[mm]].push(mm);//将该元素插到对应分队列中
if(vis[team[mm]]==)//如果该分队列还没有进入总队列
{
Q.push(team[mm]);
vis[team[mm]]=; }
} else if(str=="DEQUEUE")
{
printf("%d\n",q[Q.front()].front());//输出总队列中处于队首的分队列的队首元素
q[Q.front()].pop();
if(q[Q.front()].empty())//如果该分队列为空
{
vis[Q.front()]=;
Q.pop();//将该分队列除名
} }
}
printf("\n");
} return ;
}
最新文章
- QT210 android2.3 和android4.0 烧写编译日记
- jQuery插件 -- 动态事件绑定插件jquery.livequery.js
- 总结-css编码规范
- 纯CSS打造银色MacBook Air（完整版）
- VS 解决方案管理器和 编辑窗口同步 联动
- iOS开发笔记系列-基础4(变量与数据类型)
- 数据库中DDL、DML、DCL和TCP概念
- STDMETHOD_，STDMETHOD，__declspec(novtable)和__declspec(selectany)
- Jquery 的bind(), live(), delegate(), on()绑定事件方式
- 可以放在html代码中的自动跳转代码
- 【Ubuntu 16】安装net-snmp
- 腾讯qq等级计算公式面试题
- graph slam BACK END 相关技术资料收集
- 如何用MoveIt快速搭建机器人运动规划平台？
- 【WIN32编程】利用汇编写cs1.6辅助
- Class file collision
- java基础基础总结----- 构造方法，可变参数列表
- LeetCode--053--最大子序和
- cmd 查看本地端口被占用程序
- 入门redis