poj2259 Team Queue

吼哇，又是水题。

我本来准备开1010个queue的，但是STL容器里好像只有vector滋磁开组，于是只好数组模拟...

然后模拟过了......

#include <cstdio>
#include <map>
const int N = 1010;

int Q[N + 1][N + 1];
std::map<int, int> mp;

int main() {
    char c[20];
    int n, m, x, T = 0;
    while(scanf("%d", &n)) {
        if(n == 0) break;
        T++;
        printf("Scenario #%d\n", T);
        for(int i = 0; i <= N; i++) {
            Q[i][N] = Q[0][i] = 0;
            Q[i][0] = 1;
        }
        mp.clear();

        for(int i = 1; i <= n; i++) {
            scanf("%d", &m);
            for(int j = 1; j <= m; j++) {
                scanf("%d", &x);
                mp[x] = i;
            }
        }
        while(scanf("%s", c)) {
            if(c[0] == 'S') break;
            if(c[0] == 'E') { /// 进队
                scanf("%d", &x);
                int p = mp[x];/// 所在队
                if(Q[p][0] == Q[p][N] + 1) {
                    Q[0][N]++;
                    Q[0][Q[0][N]] = p;
                }
                Q[p][N]++;
                Q[p][Q[p][N]] = x;
            }
            else { /// 出队
                int p = Q[0][Q[0][0]];
                printf("%d\n", Q[p][Q[p][0]]);
                Q[p][0]++;
                if(Q[p][0] == Q[p][N] + 1) {
                    Q[0][0]++;
                }
            }
        }
    printf("\n");
    }
    return 0;
}