#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#define debug(x) printf("%d***\n",x)
typedef long long ll;
using namespace std;
const int maxn=1010;
/*
整体 局部
*/
int main(){
int n;
int kase=0;
while(scanf("%d",&n)==1&&n){
map<int,int> qid;
queue<int> Q,q[maxn];
for(int i=0;i<n;i++){
int m;
scanf("%d",&m);
for(int j=0;j<m;j++){
int val;
scanf("%d",&val);
qid[val]=i;
}
}
printf("Scenario #%d\n",++kase);
char str[30];
while(scanf(" %s",str)==1){
if(str[0]=='S') break;
if(str[0]=='E'){
int val;
scanf("%d",&val);
int id=qid[val];
if(q[id].empty())
Q.push(id);
q[id].push(val);
//printf("idid:%d\n",id);
}
else{
//printf("****\n");
int id=Q.front();
printf("%d\n",q[id].front());
q[id].pop();
if(q[id].empty())
Q.pop();
}
}
printf("\n");
}
return 0;
}
Team Queue UVA - 540
最新推荐文章于 2023-03-27 21:05:57 发布