UVa 540 Team Queue:stl list&queue Simulation queue

540-team Queue

Time limit:3.000 seconds

Http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=103&page=show_ problem&problem=481

Queues and Priority queues are data structures which are known to most computer. Theteam Queue, however, is isn't so-so-known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa are a team queue, for example.

In a team queue, each element, belongs to a. If an element enters the queue, it's searches the queue from head to tail to check if some of itsteammates (elements O f 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 doing like in normal queues:elements are processed from head to tail in the order they appear in the team que Ue.

Your task is to write a, simulates such a team queue.

Input

The input file would contain one or more test cases. Each test case begins with the number of teamst (

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 "the" and remove it from the queue

Stop-end of test case

The input would 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 Sho Uld be Efficient:both enqueing and dequeuing of a element should only take the time.

Output

For each test case, the "scenario #k" of the "saying", the "number of the", and the Wherek is the number of the test case. Then, for eachdequeue command, print the element which was dequeued on a single line. Print a blank line after each test case, even after the last one.

Sample Input

2
3 102
3 201 203 ENQUEUE The ENQUEUE
201
ENQUEUE 102 ENQUEUE ENQUEUE >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
enque UE 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
102
201
203

Scenario #2
259001
259002 259003
259004
259005
260001