oj.uz

Submission #717695

# Submission time Handle Problem Language Result Execution time Memory
717695 2023-04-02T10:54:14 Z AndrijaM Garage (IOI09_garage) C++14
40 / 100
 3 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int ans=0;
    int n,m;
    cin>>n>>m;
    int cpp[n];
    map<int,int>l;
    bool vis[n];
    for(int i=0;i<n;i++)
    {
        cin>>cpp[i];
        vis[i]=false;
    }
    int mass[m];
    for(int i=0;i<m;i++)
    {
        cin>>mass[i];
    }
    int idx;
    for(int i=0;i<2*m;i++)
    {
        cin>>idx;
        if(idx>0)
        {
            for(int pos=0;pos<n;pos++)
            {
                if(vis[pos]==false)
                {
                    ans+=cpp[pos]*mass[idx-1];
                    l[idx]=pos;
                    vis[pos]=true;
                    break;
                }
            }
        }
        else
        {
            vis[l[idx*(-1)]]=false;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Correct 1 ms 212 KB Output is correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Correct 1 ms 296 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 1 ms 312 KB Output isn't correct
15 Correct 2 ms 340 KB Output is correct
16 Incorrect 3 ms 340 KB Output isn't correct
17 Incorrect 3 ms 340 KB Output isn't correct
18 Incorrect 2 ms 336 KB Output isn't correct
19 Incorrect 3 ms 324 KB Output isn't correct
20 Incorrect 3 ms 308 KB Output isn't correct