# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
508730 |
2022-01-13T16:35:53 Z |
tabr |
Garage (IOI09_garage) |
C++17 |
|
2 ms |
444 KB |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> r(n);
for (int i = 0; i < n; i++) {
cin >> r[i];
}
vector<int> w(m);
for (int i = 0; i < m; i++) {
cin >> w[i];
}
queue<int> que;
vector<int> c(n, -1);
int ans = 0;
for (int i = 0; i < 2 * m; i++) {
int x;
cin >> x;
if (x > 0) {
x = x - 1;
que.emplace(x);
} else {
x = -x - 1;
for (int j = 0; j < n; j++) {
if (c[j] == x) {
c[j] = -1;
}
}
}
while (!que.empty() && *min_element(c.begin(), c.end()) == -1) {
x = que.front();
que.pop();
for (int j = 0; j < n; j++) {
if (c[j] == -1) {
c[j] = x;
ans += r[j] * w[x];
break;
}
}
}
}
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
288 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
292 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
288 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
296 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
444 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
348 KB |
Output is correct |
19 |
Correct |
2 ms |
332 KB |
Output is correct |
20 |
Correct |
2 ms |
332 KB |
Output is correct |