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

题意:有n个队伍。 对于每个ENQUEUE  x 命令。 如果x所在的队伍已经在队列中, 则x排在队列中它的队伍的尾巴, 否则排在队列的末尾。 可以理解为队列中的队列的味道。

这题有点蒙,但是弄懂后,感觉自己对队列似乎了解深了许多啊!

//Asimple
//#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <deque>
#include <string>
#include <string.h>
#include <vector>
#include <stack>
#include <ctype.h>
#include <queue>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <time.h>
#include <bitset>
#include <list> using namespace std;
#define INF 0xFFFFFFFF
typedef long long ll ;
typedef list<int>::iterator l_iter;
typedef multimap<string,string>::iterator mss_iter;
typedef map<string,string>::iterator m_iter;
typedef set<int>::iterator s_iter;
typedef vector<int>::iterator v_iter;
multimap<string,string> mss;
const int maxn = 1000;
const int Max = 1000000;
int n, T, num, cnt;
string str;
stack<set<int> > stk;
map<set<int>, int> m;
set<int> s1, s2;
queue<int> q;
queue<int> qq[maxn];
list<int> L;
int a[Max]; int main()
{
int k = 1 ;
while( cin >> T && T )
{
while( !q.empty() ) q.pop();
for(int i=0; i<maxn; i++)
while( !qq[i].empty() )
qq[i].pop();
memset(a,0,sizeof(a));
//入队
for(int i=0; scanf("%d",&n)==1; i++)
{
for(int j=0; j<n; j++)
{
scanf("%d%*c",&num);
a[num] = i ;
}
} cout << "Scenario #" << k << endl ;
while(true)
{
cin >> str ;
if( str == "STOP" )
{
cout << endl ;
break;
}
if( str == "ENQUEUE" )
{
scanf("%d%*c",&num);
if( qq[a[num]].empty() )
q.push(a[num]);
qq[a[num]].push(num);
}
if( str == "DEQUEUE" )
{
int q_num = q.front();
cout << qq[q_num].front() << endl ;
qq[q_num].pop();
if( qq[q_num].empty() )
q.pop();
}
} k ++ ;
} return 0;
}

ACM题目————Team Queue的更多相关文章

  1. ACM学习历程——UVA540 Team Queue(队列,map:Hash)

    Description   Team Queue   Team Queue  Queues and Priority Queues are data structures which are know ...

  2. Team Queue(STL练习题)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1387 Team Queue Time Limit: 2000/1000 MS (Java/Others ...

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

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

  4. UVA Team Queue

    版权声明:本文为博主原创文章.未经博主同意不得转载. https://blog.csdn.net/u013840081/article/details/26180081 题目例如以下: Team Qu ...

  5. UVA.540 Team Queue (队列)

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

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

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

  7. POJ 2259 Team Queue(队列)

    题目原网址:http://poj.org/problem?id=2259 题目中文翻译: Description 队列和优先级队列是大多数计算机科学家已知的数据结构. 然而,Team Queue并不是 ...

  8. UVA 540 Team Queue(模拟+队列)

    题目代号:UVA 540 题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page ...

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

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

随机推荐

  1. Java线程同步和线程通信

    一.线程同步 当多个线程访问同一个数据时,非常容易出现线程安全问题.这时候就需要用线程同步. 不可变类总是线程安全的,因为它的对象状态是不可改变的,但可变类对象需要额外的方法来保证线程安全. 1.同步 ...

  2. ViewController 的代码规范

    1.#pragma mark - life cycle viewDidLoad viewWillAppear 2.#pragma mark - delegate #pragma mark collec ...

  3. C# 微信支付教程系列之扫码支付

    微信支付教程系列之扫码支付            今天,我们来一起探讨一下这个微信扫码支付.何为扫码支付呢?这里面,扫的码就是二维码了,就是我们经常扫一扫的那种二维码图片,例如,我们自己添加好友的时候 ...

  4. 最长上升子序列的变形(N*log(N))hdu5256

    序列变换 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submis ...

  5. UI design principles

    Master's conclusion: 1. fix a color pattern 2. fix the frames the UI will use 3. fix the subject tha ...

  6. maven笔记-入门(helloWorld)

    maven: pom.xml:文件 groupId,artifactId,Version定义了一个项目的基本坐标 groupId:定义了项目属于哪个组,往往与项目所在的组织和公司有关 artifact ...

  7. linux第7天 I/O的五种模型, select

    服务器端避免僵尸进程的方法: 1)通过忽略SIGCHLD信号,解决僵尸进程 signal(SIGCHLD, SIG_IGN) 2)通过wait方法,解决僵尸进程 signal(SIGCHLD, han ...

  8. demo06

    city_data.xml <?xml version="1.0" encoding="utf-8"?> <resources> < ...

  9. paper 6:支持向量机系列三:Kernel —— 介绍核方法,并由此将支持向量机推广到非线性的情况。

    前面我们介绍了线性情况下的支持向量机,它通过寻找一个线性的超平面来达到对数据进行分类的目的.不过,由于是线性方法,所以对非线性的数据就没有办法处理了.例如图中的两类数据,分别分布为两个圆圈的形状,不论 ...

  10. Sql Server服务远程过程调用失败解决

    Sql Server服务远程过程调用失败解决   问题:       今天SQL数据库登录不上了,然后想启动Sql实例,却发现如下问题(配置环境:win7旗舰版x64,SqlServer2008R2, ...