Team Queue
Team Queue |
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.
Input
The input file will contain one or more test cases. Each test case begins with the number of teams t (![$1 \le t \le 1000$](http://uva.onlinejudge.org/external/5/540img1.gif)
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
For each test case, first print a line saying `` Scenario # k", where k is the number of the test case. Then, for each DEQUEUE command, print the element which is dequeued on a single line. Print a blank line after each test case, even after the last one.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
题意:
有n个队伍。 对于每个ENQUEUE x 命令。
如果x所在的队伍已经在队列中, 则x排在队列中它的队伍的末尾, 否则排在队列的末尾。
可以理解为队列中的队列的。
解析:
新建一个100000的数组用于保存每个队伍在哪排。
新建标记队列,用于保存哪排先入队列。
再新建N个队列,用于保存没排进入队列编号。
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 1000000;
int team[N];
const int MAX = 1010;
char com[30];
int main() {
int t;
int cas =1;
int m,n;
while( scanf("%d",&m) != EOF) {
if( m == 0) {
break;
}
memset(team,0,sizeof(team));
int tmp;
for(int i = 0; i < m; i++) {
scanf("%d",&n);
for(int j = 0; j < n; j++) {
scanf("%d",&tmp);
team[tmp] = i;
}
}
queue<int> Q[MAX],q;
int t;
int num;
printf("Scenario #%d\n",cas++);
while(1) {
scanf("%s",com);
if(!strcmp(com,"STOP"))
break;
else if(!strcmp(com,"ENQUEUE")) {
scanf("%d",&num);
t = team[num];
if(Q[t].empty())
q.push(t);
Q[t].push(num);
}
else if(!strcmp(com,"DEQUEUE")) {
t = q.front();
printf("%d\n",Q[t].front());
Q[t].pop();
if(Q[t].empty())
q.pop();
}
}
printf("\n");
}
return 0;
}