acwing132. 小组队列

#include<bits/stdc++.h>
using namespace std;

int t,zz[1000005],bh,k=0;//zzÿһ¸ö±àºÅËùÊôµÄС×é
int js[1005][1005],head[1005],tail[1005];//ÒѾ­½ø¶ÓµÄ±àºÅÄڵĶÓÁÐ 
string now;
bool judge[1000005];


int main(){
	while(1){k++;queue<int>q;//´æµÄÊDZàºÅ 
		scanf("%d",&t);if(t==0)exit(0);
		memset(judge,false,sizeof(judge));
		memset(zz,0,sizeof(zz));
		memset(js,0,sizeof(js));
		for(int num=1;num<=t;num++){
			int a,p;cin>>a;
			for(int i=1;i<=a;i++){
				cin>>p;
				zz[p]=num;
			}
			head[num]=0,tail[num]=-1;	
		}
		cout<<"Scenario #"<<k<<endl;
		while(1){
			cin>>now;if(now=="STOP")break;
			if(now=="ENQUEUE"){
				cin>>bh; 
				if(judge[zz[bh]]==true){//Èç¹ûµ±Ç°±àºÅÔÚ¶ÓÁÐÀï 
					tail[zz[bh]]++;//¼ÓÒ»¸ö
					js[zz[bh]][tail[zz[bh]]]=bh;
				}
				else{
					judge[zz[bh]]=true;
					q.push(zz[bh]);
					tail[zz[bh]]++;//¼ÓÒ»¸ö
					js[zz[bh]][tail[zz[bh]]]=bh;
				}
			}
			else if(now=="DEQUEUE"){
				bh=q.front();
				cout<<js[bh][head[bh]]<<endl;
				head[bh]++;
				if(head[bh]>tail[bh]){
				judge[bh]=false;
				q.pop();	
				}
			}
		}
		cout<<endl;
	}
}