UVA 540 Team Queue

这道题不会！看了作者的代码！uva的题，题目的内容好多啊！

#include <bits/stdc++.h>
using namespace std;
const int maxt = 1000 + 10;
int main()
{
 int t,cas=1;
 while(cin>>t&&t)
 {
  printf("Scenario #%d\n",cas++);
  map<int,int> team;
  int tmp1,tmp2;
  for(int i = 0;i < t; i++)
  {
    cin>>tmp1;
    for(int j = 0;j < tmp1; j++)
    {
      cin >> tmp2;
      team[tmp2]=i;
    }
  }
  queue<int> q,q2[maxt];
  string str;
  while(cin>>str&&str!="STOP")
  {
    int x;
    if(str[0]=='D')
    {
      int t = q.front();
      printf("%d\n",q2[t].front());
      q2[t].pop();
      if(q2[t].empty())
        q.pop();
    }
    else if(str[0] == 'E')
    {
      cin >> x;
      int t=team[x];
      if(q2[t].empty())
        q.push(t);
      q2[t].push(x);
    }
  }
  cout<<endl;
 }
 return 0;
}