HDU

Team Queue

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1999    Accepted Submission(s): 688

Problem Description

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 will contain one or more test cases. Each test case begins with the number of teams t (1<=t<=1000). Then t team descriptions follow, each one consisting of the number of elements belonging to the team and the elements themselves. Elements are integers in the range 0 - 999999. A team may consist of up to 1000 elements. 

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. 

 

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

 

Source

University of Ulm Local Contest 1998

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:  1509 1381 1103 1341 1392 

 

思路： 我用了一个队列数组模拟了一下，利用队列数组储存不同的帮派。

#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <iostream>
#include <stack>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
//#include <bits/stdc++.h>
//#define LOACL
#define MAX 30
#define space " "
using namespace std;
//typedef long long LL;
//typedef __int64 Int;
typedef pair<int, int> paii;
const int INF = 0x3f3f3f3f;
const double ESP = 1e-5;
const double PI = acos(-1.0);
const int MAXN = 1000 + 10;
int Q[1000000];
int clc[MAXN];
char str[100];
int main() {
    int n, m, t;
    int Kcase = 0;
    while (scanf("%d", &n), n) {
        queue<int> que[MAXN];
        memset(clc, 0, sizeof(clc));
        for (int i = 0; i < n; i++) {
            scanf("%d", &m);
            for (int j = 0; j < m; j++) {
                scanf("%d", &t); Q[t] = i;
            }
         }
        printf("Scenario #%d
", ++Kcase);
        int top = 0, cnt = 0;
        while (scanf("%s", str) != EOF) {
            if (str[0] == 'S') break;
            else if (str[0] == 'E') {
                scanf("%d", &t);
                int temp = Q[t];
                if (que[temp].empty()) {
                    clc[cnt++] = temp;
                    //cout << cnt << space << temp << space << t << endl;;
                    if (cnt == n) cnt = 0;
                }
                que[temp].push(t);
            }
            else {
                int temp = clc[top];
                printf("%d
", que[temp].front());
                que[temp].pop();
                if (que[temp].empty()) {
                    top++;
                    if (top == n) top = 0;
                }
            }
        }
        printf("
");
    }
    return 0;
}