| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 2471 | Accepted: 926 |
Description
In a team queue each element belongs to a team. If an element enters the queue, it first searches the queue from head to tail to check if some of its teammates (elements of the same team) are already in the queue. If yes, it enters the queue right behind them. If not, it enters the queue at the tail and becomes the new last element (bad luck). Dequeuing is done like in normal queues: elements are processed from head to tail in the order they appear in the team queue.
Your task is to write a program that simulates such a team queue.
Input
Finally, a list of commands follows. There are three different kinds of commands:
- ENQUEUE x - enter element x into the team queue
- DEQUEUE - process the first element and remove it from the queue
- STOP - end of test case
The input will be terminated by a value of 0 for t.
Warning: A test case may contain up to 200000 (two hundred thousand) commands, so the implementation of the team queue should be efficient: both enqueing and dequeuing of an element should only take constant time.
Output
Sample Input
2
3 101 102 103
3 201 202 203
ENQUEUE 101
ENQUEUE 201
ENQUEUE 102
ENQUEUE 202
ENQUEUE 103
ENQUEUE 203
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
5 259001 259002 259003 259004 259005
6 260001 260002 260003 260004 260005 260006
ENQUEUE 259001
ENQUEUE 260001
ENQUEUE 259002
ENQUEUE 259003
ENQUEUE 259004
ENQUEUE 259005
DEQUEUE
DEQUEUE
ENQUEUE 260002
ENQUEUE 260003
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0
Sample Output
Scenario #1
101
102
103
201
202
203 Scenario #2
259001
259002
259003
259004
259005
260001
#include"iostream"
#include"map"
#include"queue"
#include"cstring"
#include"string"
#include"cstdio"
using namespace std;
//map<int,int> m;
int m[];
queue<int> q;//队伍序号
queue<int> qq[];//入队
int flag[];
int ncase=;
int t,n,ele;
void inti();
void input();
void solve();
int main()
{
while(scanf("%d",&t)==&&t)
{
inti();
input();
solve();
}
return ;
}
void input()
{
for(int i=;i<t;i++)
{
//cin>>n;
scanf("%d",&n);
for(int j=;j<n;j++)
{
//cin>>ele;
scanf("%d",&ele);
m[ele]=i;
}
}
}
void inti()
{
for(int i=;i<t;i++)
{
flag[i]=;
while(!qq[i].empty())
qq[i].pop();
}
while(!q.empty())
q.pop();
}
void solve()
{
string com;
int a;
//cout<<"Scenario #"<<++ncase<<endl;
printf("Scenario #%d\n",++ncase);
while(cin>>com,com!="STOP")
{
if(com=="ENQUEUE")
{
//cin>>a;
scanf("%d",&a);
if(!flag[m[a]])
{
flag[m[a]]=;
q.push(m[a]);
}
qq[m[a]].push(a);
}
else if(com=="DEQUEUE")
{
int order=q.front();
cout<<qq[order].front()<<endl;
qq[order].pop();
if(qq[order].empty())
{
q.pop();
flag[order]=;
}
}
}
cout<<endl;
}