Submission #1013672

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013672		canadavid1	Garage (IOI09_garage)	C++17	5 / 100	2 ms	604 KiB

garage

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>


int main()
{
    int N,M;
    std::cin >> N >> M;
    std::vector<int> rate(N);
    for(auto& i : rate) std::cin >> i;
    std::vector<int> weight(M);
    for(auto& i : weight) std::cin >> i;
    weight.emplace(weight.begin()); // 1-indexing
    std::vector<int> spaces;
    for(int i = 0; i < N; i++) spaces.push_back(i);
    std::queue<int> q;
    std::vector<int> space(N+1);
    long long c = 0;
    for(int i = 0; i < 2*M; i++)
    {
        int op;
        std::cin >> op;
        if(op > 0)
            q.push(op);
        else
            spaces.push_back(space[-op]);
        while(q.size() && spaces.size())
        {
            auto car = q.front(); q.pop();
            auto p = std::min_element(spaces.begin(),spaces.end());
            auto sp = *p; spaces.erase(p);
            space[car] = sp;
            c += weight[car] * rate[sp];
        }
    }
    std::cout << c << "\n";
}

• Subtask 1: 5 / 100