540 - Team Queue

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<algorithm>
using namespace std;

const int N = 1005;
int t;

int s[N][N];
char op[20];
int k = 0;
struct TEAM {

	int id;
	queue<int> q;

} team[N];

int cmp(const int &a, const int &b) {

	return (a > b) ? 0 : 1;
}

int find(int a) {

	int first, mid, last;
	for(int i = 0; i < t; i++) {

		first = 1;
		last = s[i][0];
		while(first <= last) {

			mid = (first + last) /2;
			if(s[i][mid] == a)
				return i;
			else if(s[i][mid] > a)
				last = mid - 1;
			else
				first = mid + 1;
		}
	}		
}

int main() {

	while(scanf("%d", &t) && t) {

		k++;
		memset(s, 0, sizeof(s));
		printf("Scenario #%dn", k);
		int i, j, n;
		for(i = 0; i < t; i++) {

			scanf("%d", &n);
			s[i][0] = n; 
			for(j = 1; j <= n; j++) {

				scanf("%d", &s[i][j]);
			}
		}
		scanf("%*c");
		for(i = 0; i < t; i++)  {

			sort(&s[i][1], &s[i][1]  + s[i][0], cmp);
		}
		for(i = 0; i < t; i++)
			team[i].id = -1;
	int f = 0, l = 0;
	while(scanf("%s", &op) ) {

		if(strncmp(op, "ENQUEUE", 7) == 0) {

			int num ;
			scanf("%d", &num);
			j = find(num);
			for(i = f; i != l ; i = (i + 1) % N) {

				if(team[i].id != -1 && team[i].id == j) {

					team[i].q.push(num);
					break;
				}
			}		
			if(i == l) {

					team[l].id = j;
					team[l].q.push(num);
					l = (l + 1) % N;
			}
		}
		else if(strncmp(op, "DEQUEUE", 7) == 0) {
				
				if(!team[f].q.empty()) {

					printf("%dn", team[f].q.front());
					team[f].q.pop();
					if(team[f].q.empty()) {

						team[f].id = -1;
						f = (f + 1 ) % N;
						
					}
				}
		}
		else  {

			for(i = f; i != l; i = (i + 1) % N)
				while(!team[i].q.empty()) {
					
					team[i].q.pop();
				}

			printf("n");
			break;
			
			}
		memset(op, 0, sizeof(op));
	
		}
	}
	
	return 0;
}