Team Queue Page55 队列

Team Queue Page55 队列

队列的应用

简单来讲其实就是一个双层队列，第一层是队伍，第二层是队伍里的人

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=1e6+7;
const int INF=1e9;
const ll INFF=1e18;
queue<int> q[1001];
int t,x,m,team[maxn],K=0,tot;
char s[20];
int main()
{
    while(~scanf("%d",&t)&&t)
    {
        queue<int>Q;tot=0;
        printf("Scenario #%d\n",++K);
        rep(i,1,t)
        {
            while(!q[i].empty())q[i].pop();
            scanf("%d",&m);
            while(m--)
            {
                scanf("%d",&x);
                team[x]=i;
            }
        }
        while(1)
        {
            scanf("%s",s);
            if (s[0]=='E')
            {
                scanf("%d",&x);
                if (q[team[x]].size()==0)Q.push(team[x]);
                q[team[x]].push(x);
            }
            else if (s[0]=='D')
            {
                W(q[Q.front()].front());
                q[Q.front()].pop();
                if (q[Q.front()].size()==0)Q.pop();
            }
            else if (s[0]=='S')break;
        }
        puts("");
    }
    return 0;
}