【UVa 540】Team Queue-白红宇

【UVa 540】Team Queue

阅读量：5180 次

发布时间：2019-06-13

本文共 3441 字，大约阅读时间需要 11 分钟。

Team Queue

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 ( $1 \le t \le 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

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

这题主要是不要想太多。开个map或者记录数组，判断一下哪个人属于哪支队伍。

然后把每一支队伍看做一个整体放在一个大队列中。每次出队判断第一个人是在那支队伍，是不是这支队伍的最后一个。

入队类似。

#include
     
      #include
      
       #include
       #include
        
         using namespace std;map
         
           belong;int nteam;int main(){    int Test = 0;    while (scanf("%d", &nteam) && nteam)    {        printf("Scenario #%d\n", ++Test);        queue
          
            bigteam; queue
           
             group[1005]; for (int i = 0; i < nteam; ++i) { int nm; scanf("%d", &nm); for (int j = 0; j < nm; ++j) { int member; scanf("%d", &member); belong[member] = i; } } char cmd[10]; while (scanf("%s", cmd)) { if (cmd[0] == 'S') break; if (cmd[0] == 'E') { int x; scanf("%d", &x); int teamid = belong[x]; if (group[teamid].empty()) bigteam.push(teamid); group[teamid].push(x); } else { int teamid = bigteam.front(); printf("%d\n", group[teamid].front()); group[teamid].pop(); if (group[teamid].empty()) bigteam.pop(); } } printf("\n"); } return 0;}

转载于:https://www.cnblogs.com/albert7xie/p/4730673.html

你可能感兴趣的文章