Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is a team queue, for example.
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.
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.
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.
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
Scenario #1 101 102 103 201 202 203 Scenario #2 259001 259002 259003 259004 259005 260001
#include <iostream> #include<cstdio> #include<queue> #include<cstring> using namespace std; const int maxn=1005; int c[1000000]; int main() { int t; int cc=1; while(~scanf("%d",&t)&&t) { printf("Scenario #%d\n",cc++); memset(c,0,sizeof(c)); queue<int>team[maxn],q; for(int i=1;i<=t;i++) { int n; scanf("%d",&n); while(n--) { int tmp; scanf("%d",&tmp); c[tmp]=i; //这样可以记录一个元素有没有出现且记录他在哪个队 } } char s[10]; scanf("%s",s); while(s[0]!='S') { if(s[0]=='E') { int tmp; scanf("%d",&tmp); int id=c[tmp]; //c[tmp]就是队的编号 if(team[id].empty())q.push(id); //如果队为空就在q--主队列后加入该元素 team[id].push(tmp); //把元素放在它的队的队尾 } else { int id=q.front(); // printf("%d\n",team[id].front()); team[id].pop(); if(team[id].empty()) q.pop(); } scanf("%s",s); } cout<<endl; } return 0; }