[POJ2259]Team Queue (队列,模拟)

2559是栈，2259是队列，真的是巧啊

题意

模拟队列

思路

水题

代码

因为太水，不想打，发博客只是为了与2559照应，于是附上lyd的std

 

#include <queue>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1000000, T = 1006;
int t, f[N], id = 0;
char s[10];
queue<int> q[T];

void Team_Queue() {
    q[0] = queue<int>();
    for (int i = 1; i <= t; i++) {
        int n;
        scanf("%d", &n);
        while (n--) {
            int x;
            scanf("%d", &x);
            f[x] = i;
        }
        q[i] = queue<int>();
    }
    cout << "Scenario #" << ++id << endl;
    while (scanf("%s", s) && s[0] != 'S') {
        if (s[0] == 'E') {
            int x;
            scanf("%d", &x);
            if (q[f[x]].empty()) q[0].push(f[x]);
            q[f[x]].push(x);
        } else {
            int x = q[0].front();
            printf("%d\n", q[x].front());
            q[x].pop();
            if (q[x].empty()) q[0].pop();
        }
    }
    cout << endl;
}

int main() {
    while (cin >> t && t) Team_Queue();
    return 0;
}

 

转载于:https://www.cnblogs.com/lincold/p/10162432.html