UVA - Team Queue(隊列)

題目連結:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=481

Time limit 1000 ms Memory limit 32768 kB

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.

The input file 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.

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.

2 3 101 102 103 3 201 202 203 ENQUEUE 101 ENQUEUE 201 ENQUEUE 102 ENQUEUE 202 ENQUEUE 103 ENQUEUE 203 DEQUEUE STOP 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 ENQUEUE 260002 ENQUEUE 260003

Scenario #1 101 102 103 201 202 203 Scenario #2 259001 259002 259003 259004 259005 260001

Description: 給出n個隊列，當出現ENQUEUE指令的時候，就将ENQUEUE後面的那個資料加入隊伍當中，加入隊伍的規則是：如果有同屬一個隊列的資料已經在隊伍裡，那麼就直接加到這個已經在隊伍裡的那個資料的右邊，如果一個都沒有，那麼就将這個資料加入到隊伍的末尾。

Problem solving: 以每隻隊伍建立隊列，再以隊伍序号建立一個隊列，将每個元素入到它所屬的隊伍隊列中，若序号隊列沒有此隊伍的序号，則将序号入隊，當某個隊伍隊列為空時，将序号隊列中的此序号出隊。

Accepted Code: