uva 540 Team Queue

又是容器没有清除跪了很长时间。。。就是多级队列吧，在链表中维护该group的位置

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <list>
#define rep(i,n) for (int i=0;i<n;i++)
#define LL long long
using namespace std;
map<string,int>team;
int n;
queue<string>q[1005];
int inque[1005];
void init()
{
    team.clear();
    queue<string>tmp;
    for(int i=1;i<=n;++i)
    {
        q[i]=tmp;
        int num;
        cin>>num;
        rep(j,num)
        {
            string s; cin>>s;
            team[s]=i;
        }
    }
    memset(inque,0,sizeof(inque));
}

void solve()
{
    string cmd;
    list<int>que;
    int front=0,rear=0;
    list<int>::iterator it;
    while(cin>>cmd)
    {
        if(cmd=="STOP") break;
        if(cmd=="ENQUEUE")
        {
            string s; cin>>s;
            if(！inque[team[s]])   
              {
                  inque[team[s]]=1;  
                  que.push_back(team[s]);  
              }
                q[team[s]].push(s);    
        }
        else
        {
            it=que.begin();
            cout<<q[*it].front()<<endl;
            q[*it].pop();
            if(q[*it].size()==0)
             {
                 inque[*it]=0;
                 que.remove(*it);
             }
        }
    }
}
int main()
{
    int cas=1;
    while(cin>>n,n)
    {
        init();
        printf("Scenario #%d\n",cas++);
        solve();
        puts("");
    }
    return 0;
}