UVa 540 (团体队列) Team Queue

 1 #include <cstdio>
 2 #include <queue>
 3 #include <map>
 4 using namespace std;
 5 
 6 const int maxt = 1000 + 10;
 7 map<int, int> team;
 8 char cmd[10];
 9 
10 int main()
11 {
12     //freopen("in.txt", "r", stdin);
13 
14     int T, kase = 0;
15     while(scanf("%d", &T) == 1 && T)
16     {
17         printf("Scenario #%d\n", ++kase);
18 
19         for(int i = 0; i < T; i++)
20         {
21             int n, x;
22             scanf("%d", &n);
23             while(n--) { scanf("%d", &x); team[x] = i; }
24         }
25         queue<int> q, q2[maxt];   //团体队列 和 q2[i]表示团体i中成员的队列
26 
27         while(scanf("%s", cmd) == 1)
28         {
29             if(cmd[0] == ‘S‘) break;
30             if(cmd[0] == ‘E‘)
31             {
32                 int x, t;
33                 scanf("%d", &x);
34                 t = team[x];
35                 if(q2[t].empty()) q.push(t);
36                 q2[t].push(x);
37             }
38             else if(cmd[0] == ‘D‘)
39             {
40                 int t = q.front();
41                 printf("%d\n", q2[t].front());
42                 q2[t].pop();
43                 if(q2[t].empty()) q.pop();
44             }
45         }
46         puts("");
47     }
48 
49     return 0;
50 }