UVaOJ540---Team Queue
来源:互联网 发布:智能电视和网络电视有什么区别 编辑:程序博客网 时间:2024/06/05 14:44
540 - Team Queue
Time limit: 3.000 seconds
540 - Team Queue
Time limit: 3.000 secondsQueues 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
23 101 102 1033 201 202 203ENQUEUE 101ENQUEUE 201ENQUEUE 102ENQUEUE 202ENQUEUE 103ENQUEUE 203DEQUEUEDEQUEUEDEQUEUEDEQUEUEDEQUEUEDEQUEUESTOP25 259001 259002 259003 259004 2590056 260001 260002 260003 260004 260005 260006ENQUEUE 259001ENQUEUE 260001ENQUEUE 259002ENQUEUE 259003ENQUEUE 259004ENQUEUE 259005DEQUEUEDEQUEUEENQUEUE 260002ENQUEUE 260003DEQUEUEDEQUEUEDEQUEUEDEQUEUESTOP0
Sample Output
Scenario #1101102103201202203Scenario #2259001259002259003259004259005260001
Miguel A. Revilla
1999-01-11
#include <iostream>#include <string>#include <cstring>using namespace std ;const int maxn = 1000 + 10 ;int r , c ;int qfront ;int team[maxn] ;int Queue[maxn][maxn] ;int visit[maxn] ;int map[maxn * maxn] ;int rear[maxn] ;int front[maxn] ;void init(){ r = 0 ; qfront = 0 ; memset( team , 0 , sizeof( team ) ) ; memset( Queue , 0 , sizeof( Queue ) ) ; memset( map , 0 , sizeof( map ) ) ; memset( visit , -1 , sizeof( visit ) ) ; memset( rear , 0 , sizeof( rear ) ) ; memset( front , 0 , sizeof( front ) ) ; return ;}void enqueue( int num ){ //如果有队友,插入队友列的后面 if( visit[map[num]] != -1 ) { Queue[visit[map[num]]][rear[visit[map[num]]]++] = num ; } else//如果没有,在二维队列中添加新的队列,并标记队列所在的行(即标记他的优先性) { Queue[r][0] = num ; visit[map[num]] = r ; rear[r]++ ; r++ ; } return ;}void dequeue(){ cout << Queue[qfront][front[qfront]++] << endl ;//输入队列前端的元素 //如果该队列元素为空,该队列出二维队列,就因为这个才wa了好多次呀 if( front[qfront] >= rear[qfront] ) { visit[map[Queue[qfront][front[qfront]-1]]] = -1 ; qfront++ ; } return ;}int main(){ int t ; int icase = 1 ; while( cin >> t ) { if( !t ) break ; cout << "Scenario #" << icase++ << endl ; init() ; int n ; for( int i = 0 ; i < t ; i++ ) { cin >> n ; for( int j = 0 ; j < n ; j++ ) { cin >> team[j] ; map[team[j]] = i ;//映射队元素所在的队号 } } string command ; int member ; while( cin >> command ) { if( command == "STOP" ) { cout << endl ; break ; } if( command == "ENQUEUE" ) { cin >> member ; enqueue( member ) ; } if( command == "DEQUEUE" ) dequeue() ; } } return 0 ;}
- UVaOJ540---Team Queue
- Queue Team
- Team Queue
- Team Queue
- Team Queue
- Team Queue
- UVa540 Team Queue (queue)
- Team Queue(queue) - uva 540
- ZOJ 1948 Team Queue
- UVa 540 Team Queue
- uva540 team queue
- poj2259 Team Queue (队列)
- uva 540 team queue
- 540 - Team Queue***
- Uva 540 Team Queue
- uva 540 - Team Queue
- Team Queue STL
- UVa 540 - Team Queue
- 如何读开源代码
- UVaOJ11234---Expressions
- android获取设备分辨率
- ubuntu svn安装配置
- 第四次课堂练习
- UVaOJ540---Team Queue
- C++ 运算符重载
- 局部索引和全局索引
- android 自定义xml属性
- flex显示sprite
- POJ题目分类推荐
- centos 6.3 虚拟机 安装vmware tools
- 关于 C# 调用 ICTCLAS 逐句分词报异常的问题解决
- 使用LayoutOpt进行布局优化