oj.uz

Submission #798074

# Submission time Handle Problem Language Result Execution time Memory
798074 2023-07-30T10:48:00 Z Mouad_ouj Garage (IOI09_garage) C++17
100 / 100
 2 ms 224 KB 
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int par[n+1],we[m+1],pos[m+1];
    for(int x=1;x<n+1;x++)
    cin>>par[x];
    for(int x=1;x<m+1;x++)
    cin>>we[x];
    queue<int> q;
    set<int> s;
    for(int x=0;x<n;x++)
    s.insert(x+1);
    int ans=0,cur;
    for(int x=0;x<2*m;x++)
    {
        cin>>cur;
        if(cur>0)
        {
            if(s.empty())
            q.push(cur);
            else
            {
            pos[cur]=*s.begin();    
            s.erase(*s.begin());
            ans+=we[cur]*par[pos[cur]];
            }
        }
        else
        {
            s.insert(pos[-cur]);
            if(!q.empty())
            {
                cur=q.front();
                q.pop();
                pos[cur]=*s.begin();    
                s.erase(*s.begin());
                ans+=we[cur]*par[pos[cur]];
            }
        }
    }
    cout<<ans;
}

Subtask #1
100.0 / 100.0

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