| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 593222 | Bench0310 | Garage (IOI09_garage) | C++17 | 1 ms | 340 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    vector<int> r(n+1,0);
    for(int i=1;i<=n;i++) cin >> r[i];
    vector<int> w(m+1,0);
    for(int i=1;i<=m;i++) cin >> w[i];
    vector<int> v(n+1,0);
    vector<int> pos(m+1,0);
    queue<int> q;
    int res=0;
    for(int i=1;i<=2*m;i++)
    {
        int a;
        cin >> a;
        if(a>0)
        {
            int p=1;
            while(p<=n&&v[p]==1) p++;
            if(p<=n)
            {
                res+=(r[p]*w[a]);
                v[p]=1;
                pos[a]=p;
            }
            else q.push(a);
        }
        else
        {
            a=-a;
            int p=pos[a];
            v[p]=0;
            if(!q.empty())
            {
                int b=q.front();
                q.pop();
                res+=(r[p]*w[b]);
                pos[b]=p;
                v[p]=1;
            }
        }
    }
    cout << res << "\n";
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
