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.

输入

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

样例输出

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

之前想利用map的排序解决但是无奈时间超限，搜了一下发现了大牛的写法，翻译一下。

1. #include <stdio.h>  
2. #include <iostream>     
3. #include <string>   
4. #include <queue>  
5. #include <map>  
6. using namespace std;  
7. int main () {  
8.       
9.     map<int, int> mp;  
10.     char str[20];  
11.     int t, n, p;  
12.     int cn = 1;  
13.     while (cin >> t && t) {  
14.         mp.clear();   //清空操作
15.         cout << "Scenario #" << cn++ << endl;  
16.         for (int i = 0; i < t; ++i) {  
17.             cin >> n;  
18.             while (n--) {  
19.                 cin >> p;  
20.                 mp[p] = i;   //每一队的成员元素在map中具有相同的value，以便后期查找方便。
21.             }  
22.         }  
23.         queue<int> que[1005];  
24.         queue<int> ans;  
25.         while (cin >> str && str[0] != 'S') {  
26.             if (str[0] == 'E') {  
27.                 cin >> p;  
28.                 int id = mp[p];  
29.                 if (que[id].empty()) {  
30.                     ans.push(id);   //根据题意是哪一个队的元素先出现，哪一个队整体就先出队列。唉，看懂翻译真的很重要。
31.                 }  
32.                 que[id].push(p);   //因为输入时的数据是递增顺序，所以可以直接入队不需要排序。
33.             } else if (str[0] == 'D') {  
34.                 int id = ans.front(); //根据ans队列里的顺序决定那些队列先出队。 
35.                 cout << que[id].front() << endl;  
36.                 que[id].pop();  
37.                 if (que[id].empty())   // 在一个队的元素没有出完之前，不会出其他队列的元素。
38.                     ans.pop();  
39.             }  
40.         }  
41.         cout << endl;  
42.     }  
43. }  

第二篇了，感觉编程好难，别人怎么什么都会。弄得我都想转专业了。 希望有点用吧。