POJ 2259 Team Queue【模拟队列】
来源:互联网 发布:优化排名工具 编辑:程序博客网 时间:2024/05/17 04:25
Team Queue
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4449 Accepted: 1541
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.
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:
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.
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
AC代码:
#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;int a[1011*1000];int main(){int T,Kase=0;while(~scanf("%d",&T),T) {for(int i=1;i<=T;++i) {int s; scanf("%d",&s);for(int j=1;j<=s;++j) {int tem=0; scanf("%d",&tem);a[tem]=i;} }queue<int> Q[T+1];queue<int> qm;char str[22]; printf("Scenario #%d\n",++Kase); while(~scanf("%s",str),str[0]!='S') {if(str[0]=='D') {int F=qm.front();int y=Q[F].front(); Q[F].pop();printf("%d\n",y); if(Q[F].empty()) qm.pop(); }else {int x; scanf("%d",&x);if(Q[a[x]].empty()) qm.push(a[x]);Q[a[x]].push(x);}}puts("");}return 0;}
0 0
- POJ 2259 Team Queue(队列模拟)
- POJ 2259 Team Queue【模拟队列】
- POJ 2259 Team Queue(队列)
- POJ 2259 Team Queue 数据结构 队列
- poj-2259-Team Queue【优先队列】
- poj 2259 Team Queue (模拟)
- Team Queue (uva540 队列模拟)
- Team Queue(poj 2259)
- POJ 2259 Team Queue
- POJ 2259 Team Queue
- POJ 2259 --- Team Queue
- POJ 2259Team Queue
- POJ 2259 Team Queue
- POJ 2259 Team Queue
- POJ 2259 Team Queue
- uva 540 Team Queue(队列+模拟)
- uva540 Team Queue(模拟:队列)
- uva 540 Team Queue (队列模拟)
- 在GDB中查看 C/C++ Unicode文本变量内容(wchar_t*)
- 深度学习
- snmpget请求获取服务器参数(snmpv3) 并连接MySQL数据库
- lightoj 1033 区间dp
- Android Studio使用汇总
- POJ 2259 Team Queue【模拟队列】
- C# 泛型学习总结(一)
- react学习笔记 item2 --- JSX
- HTML多出文本,用省略号解决的办法
- nginx-rtmp中next_publish与ngx_rtmp_publish
- EMS SQL Manager下载及中文配置
- NIO学习资料
- 使用Picasso下载图片时的错误
- 【NOIp模拟】【dp】俄罗斯方块