poj 2259 Team Queue (模拟)
来源:互联网 发布:材料价格查询软件 编辑:程序博客网 时间:2024/06/04 22:16
Team Queue
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions:5344 Accepted: 1827
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.
#include<stdio.h>#include<queue>#include<string.h>#include<algorithm>using namespace std;queue<int>q1[1005];queue<int>q;int pos[1005];int num[1000005];int main(){ int n,m,x,iCase=0; while(scanf("%d",&n),n){ printf("Scenario #%d\n",++iCase); memset(num,0,sizeof(num)); memset(pos,0,sizeof(pos)); for(int i=0;i<1005;i++){ while(!q1[i].empty()){ q1[i].pop(); } } while(!q.empty())q.pop(); for(int i=0;i<n;i++){ scanf("%d",&m); for(int j=0;j<m;j++){ scanf("%d",&x); num[x]=i; } } char op[10]; while(~scanf("%s",op)){ if(strcmp("STOP",op)==0)break; if(strcmp(op,"ENQUEUE")==0){ scanf("%d",&x); if(pos[num[x]]==0) { q.push(num[x]); pos[num[x]]=1; } q1[num[x]].push(x);; } else { int Pos = q.front(); printf("%d\n",q1[Pos].front()); q1[Pos].pop(); if(q1[Pos].empty()){ q.pop(); pos[Pos]=0; } } } printf("\n"); }}
阅读全文
0 0
- POJ 2259 Team Queue(队列模拟)
- poj 2259 Team Queue (模拟)
- POJ 2259 Team Queue【模拟队列】
- 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
- POJ 2259 Team Queue(队列)
- Uva540(poj 2259)-Team Queue(佇列)
- uva 540 Team Queue(队列+模拟)
- uva540 Team Queue(模拟:队列)
- UVA540 Team Queue(模拟:队列)
- ZOJ 1948 POJ 2259 Team Queue
- [HOJ]1456、[POJ]2259:Team queue
- select into from 在plsql中的错误
- SpringCloud学习笔记-Hystrix熔断器
- .NET编程利器: Reflector for .NET
- Makefile特殊符号
- MongoDB索引创建
- poj 2259 Team Queue (模拟)
- 黑白棋对战(电脑下不过我)
- 【已解决】WARNING: REMOTE HOST IDENTIFICATION HAS CHANGED!
- 关于各操作系统对UVC协议支持的说明
- IBM-MQ原理及使用场景
- Mybatis逆向生成实体类,DAO层与mapper.xml文件
- 时间转换函数
- 自顶向下,逐项求精
- web项目打war包后的结构