UVA 540 Team Queue(队列)

数据结构课上写过的题目

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;
typedef long long ll;



int main()
{
	int n,cot=0;
	while (cin >> n)
	{
		cot++;
		if (!n)break;
		cout << "Scenario #" << cot << "\n";
		
		map<int, int>ma;
		for (int i = 1; i <= n; i++)
		{
			int m;
			cin >> m;
			for (int j = 0; j < m; j++)
			{
				int temp;
				cin >> temp;
				ma[temp] = i;
			}
		}
		string str;
		queue<int>q, q2[1200];
		while (cin >> str)
		{
			if (str == "STOP")
				break;
			else if (str == "DEQUEUE")
			{
				int t = q.front();
				cout << q2[t].front() << endl;
				q2[t].pop(); 
				if (q2[t].empty())q.pop();
			}
			else
			{
				int x;
				cin >> x;
				int t = ma[x];
				if (q2[t].empty())q.push(t);
				q2[t].push(x);
			}
		}
		printf("\n");
	}
	return 0;
}