oj.uz

Submission #462981

# Submission time Handle Problem Language Result Execution time Memory
462981 2021-08-11T02:16:20 Z danielsuh Garage (IOI09_garage) C++17
100 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll

const int mxN = 2005;
int carSpot[mxN];

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N, M; cin >> N >> M;
    vector<int> prices(N + 1), cars(M + 1);
    for(int i = 1; i <= N; i++) cin >> prices[i];
    for(int i = 1; i <= M; i++) cin >> cars[i];
    set<int> free;
    for(int i = 1; i <= N; i++) {
        free.insert(i);
    }
    deque<int> line;
    int ans = 0;
    for(int i = 0; i < 2 * M; i++) {
        int step; cin >> step;
        if(step > 0) {
            if(free.empty()) {
                line.push_back(step);
            }else {
                int space = *free.begin();
                free.erase(*free.begin());
                ans += cars[step] * prices[space];
                carSpot[step] = space;
            }
        }else {
            free.insert(carSpot[-step]);
        }
        if(!free.empty() && !line.empty()) {
            int car = *line.begin();
            ans += cars[car] * prices[carSpot[-step]];
            carSpot[car] = carSpot[-step];
            free.erase(free.lower_bound(carSpot[-step]));
            line.pop_front();
        }
    }
    cout << ans << "\n";
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 244 KB Output is correct
20 Correct 1 ms 332 KB Output is correct