oj.uz

Submission #292004

# Submission time Handle Problem Language Result Execution time Memory
292004 2020-09-06T07:32:01 Z NicolaAbusaad2014 Garage (IOI09_garage) C++14
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long n,m,x,ans=0;
    cin>>n>>m;
    long arr[n],weight[m],used[m]= {};
    bool N_A[n]= {};
    for(long i=0; i<n; i++)
    {
        cin>>arr[i];
    }
    for(long i=0; i<m; i++)
    {
        cin>>weight[i];
    }
    queue<long>q;
    for(long i=0; i<2*m; i++)
    {
        cin>>x;
        if(x>0)
        {
            q.push(x);
        }
        else
        {
            N_A[used[-x-1]]=false;
        }
        if(!q.empty())
        {
            for(long j=0; j<n; j++)
            {
                if(!N_A[j])
                {
                    N_A[j]=true;
                    x=q.front();
                    used[x-1]=j;
                    ans+=(weight[x-1]*arr[j]);
                    q.pop();
                    break;
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
100.0 / 100.0

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