poj2259 Team Queue

吼哇，又是水题。

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

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

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

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

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

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

AC代码