/
swea2477.cpp
146 lines (127 loc) · 3.27 KB
/
swea2477.cpp
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#include <deque>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef struct __ct {
int num, enter;
int rooma, roomb, starta, enda, startb, endb;
__ct() :
num(0), enter(0), rooma(0), roomb(0), starta(0), enda(0), startb(0), endb(0) {}
__ct(int num, int enter, int rooma, int roomb, int starta, int enda, int startb, int endb) :
num(num), enter(enter), rooma(rooma), roomb(roomb), starta(starta), enda(enda), startb(startb), endb(endb) {}
} CT;
typedef struct __rminfo {
int num, endtime;
__rminfo() : num(0), endtime(0) {}
__rminfo(int num, int endtime) : num(num), endtime(endtime) {}
} RMINFO;
bool cmpa(const CT& u, const CT& v) {
return u.num < v.num;
}
bool cmpb(const CT& u, const CT& v) {
if (u.enda == v.enda) {
return u.rooma < v.rooma;
}
return u.enda < v.enda;
}
int atime[10], btime[10];
RMINFO aendtime[10], bendtime[10];
bool exitcheck[1001];
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tc;
cin >> tc;
for (int test_case = 1; test_case <= tc; test_case++) {
memset(atime, 0, sizeof(atime));
memset(btime, 0, sizeof(btime));
memset(aendtime, 0, sizeof(aendtime));
memset(bendtime, 0, sizeof(bendtime));
memset(exitcheck, 0, sizeof(exitcheck));
int n, m, k, a, b;
cin >> n >> m >> k >> a >> b;
for (int i = 1; i <= n; i++) {
cin >> atime[i];
}
for (int i = 1; i <= m; i++) {
cin >> btime[i];
}
vector<CT> custom(k + 1);
for (int i = 1; i <= k; i++) {
custom[i].num = i;
cin >> custom[i].enter;
}
int idx = 1;
deque<CT> waita, waitb;
for (int t = 0; ; t++) {
bool ok = true;
for (int i = 1; i <= k; i++) {
if (!exitcheck[i]) {
ok = false;
break;
}
}
if (ok) {
break;
}
for (int i = 1; i <= m; i++) {
if (t > 0 && bendtime[i].endtime == t) {
exitcheck[bendtime[i].num] = true;
bendtime[i].num = 0;
bendtime[i].endtime = 0;
}
}
for (int i = 1; i <= n; i++) {
if (t > 0 && aendtime[i].endtime == t) {
waitb.push_back(custom[aendtime[i].num]);
aendtime[i].num = 0;
aendtime[i].endtime = 0;
}
}
for (int i = idx; i <= k; i++) {
if (custom[i].enter == t) {
waita.push_back(custom[i]);
idx = i + 1;
}
else {
break;
}
}
sort(waita.begin(), waita.end(), cmpa);
for (int i = 1; i <= n; i++) {
if (waita.empty()) break;
if (aendtime[i].endtime == 0) {
custom[waita.front().num].rooma = i;
custom[waita.front().num].starta = t;
custom[waita.front().num].enda = t + atime[i];
aendtime[i].num = waita.front().num;
aendtime[i].endtime = t + atime[i];
waita.pop_front();
}
}
sort(waitb.begin(), waitb.end(), cmpb);
for (int i = 1; i <= m; i++) {
if (waitb.empty()) break;
if (bendtime[i].endtime == 0) {
custom[waitb.front().num].roomb = i;
custom[waitb.front().num].startb = t;
custom[waitb.front().num].endb = t + btime[i];
bendtime[i].num = waitb.front().num;
bendtime[i].endtime = t + btime[i];
waitb.pop_front();
}
}
}
int ans = 0;
for (int i = 1; i <= k; i++) {
if (custom[i].rooma == a && custom[i].roomb == b) {
ans += i;
}
}
if (ans == 0) ans = -1;
cout << "#" << test_case << " " << ans << '\n';
}
return 0;
}