POJ 2259 Team Queue

Team Queue
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 4359 Accepted: 1512

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 
  • 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

#include <stdio.h>
#include <memory.h>
 
#include <queue>
#include <map>
using namespace std;
 
map<int, int> teamNo;
map<int, int> teamOrder;
map<int, int> teamCount;
struct element
{
   int content;
   int teamOrder;
   int order;
   bool operator<(const element& e) const
   {
      if(teamOrder > e.teamOrder)
         return true;
      else if(teamOrder == e.teamOrder && order > e.order)
         return true;
      else return false;
   }
   element(int c, int t, int o) : content(c), teamOrder(t), order(o) { }
};
priority_queue<element> q;
 
void init(int teams)
{
   teamNo.clear();
   teamOrder.clear();
   while( !q.empty() )  q.pop();
 
   int elements = 0;
   int content = 0;
   for(int i = 0; i != teams; i++)
   {
      scanf("%d", &elements);
      for(int j = 0; j != elements; j++)
      {
         scanf("%d", &content);
         teamNo[content] = i;
      }
      teamCount[i] = 0;
   }
}
 
void process(int teams, int scenario)
{
   printf("Scenario #%d\n", scenario);
 
   char op[8];
   int content;
   int iOrder = -1;
   int iTeamOrder = -1;
   while(scanf("%s", op) && op[0] != 'S')
   {
      if(op[0] == 'E')
      {
         scanf("%d", &content);
         iOrder++;
         if(teamCount[ teamNo[content] ] == 0)
         {
            iTeamOrder++;
            teamOrder[ teamNo[content] ] = iTeamOrder;
         }
         teamCount[ teamNo[content] ]++;
         q.push( element(content, teamOrder[teamNo[content]], iOrder) );
      }
      else
      {
         printf("%d\n", q.top().content);
         teamCount[teamNo[q.top().content]]--;
         q.pop();
      }
   }
 
   putchar('\n');
}
 
int main()
{
   int teams;
   int scenario = 0;
   while(scanf("%d", &teams) && teams != 0)
   {
      scenario++;
 
      init(teams);
      process(teams, scenario);
   }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值