# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1012072 |
2024-07-01T15:26:51 Z |
deera |
Garage (IOI09_garage) |
C++14 |
|
1 ms |
604 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("2009/garage.txt", "r", stdin);
ll n, m;
cin >> n >> m;
vector<ll> places(n);
for (int i = 0; i < n; i++)
cin >> places[i];
vector<ll> weights(m);
for (int i = 0; i < m; i++)
cin >> weights[i];
ll total = 0;
queue<ll> waiting;
priority_queue<pair<ll, ll>> avail;
map<ll, ll> booked;
for (int i = 0; i < n; i++) {
avail.push({-places[i], i});
}
for (int i = 0; i < m*2; i++) {
ll car;
cin >> car;
if (car < 0) {
car = -car;
car--;
ll place = booked[car];
avail.push({-places[place], place});
} else {
car--;
waiting.push(car);
}
while (avail.size() != 0 && waiting.size() != 0) {
ll next = waiting.front();
waiting.pop();
ll weight = weights[next];
pair<ll, ll> spot = avail.top();
avail.pop();
ll rate = -spot.first;
total += rate * weight;
}
}
cout << total;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
20 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |