HDU 1387（Team Queue）

#include <iostream>
#include <map>
#include <queue>
#include <cstring>
#include <string>
using namespace std;
const int MAXN = 1005;

map<int, int> id; //元素编号-队列编号
int vis[MAXN]; //分队列中是否有元素在主队列中

int main()
{
	int Case = 1; //测试用例数
	int n;
	while (cin >> n)
	{
		if (n == 0)
			break;

		queue<int> q[MAXN], mq; //分队列，主队列
		id.clear();
		memset(vis, 0, sizeof(vis));

		int m, num;
		for (int i = 0; i < n; i++)
		{
			cin >> m;
			while (m--)
			{
				cin >> num;
				id[num] = i;
			}
		}
		
		cout << "Scenario #" << Case++ << endl;
		string s;
		while (cin >> s)
		{
			if (s == "STOP")
				break;
			else if (s == "ENQUEUE")
			{
				cin >> num;
				q[id[num]].push(num);
				if (vis[id[num]] == 0)
				{
					vis[id[num]] = 1;
					mq.push(id[num]);
				}
			}
			else
			{
				cout << q[mq.front()].front() << endl;
				q[mq.front()].pop();
				if (q[mq.front()].size() == 0)
				{
					vis[mq.front()] = 0;
					mq.pop();
				}
			}
		}
		cout << endl;
	}
	return 0;
}