oj.uz

Submission #1089046

# Submission time Handle Problem Language Result Execution time Memory
1089046 2024-09-15T19:48:19 Z kokoue Garage (IOI09_garage) C++14
40 / 100
 2 ms 348 KB 
#include<bits/stdc++.h>
#define maxn 110
#define maxm 2010
#define ll long long
using namespace std;
ll n,m;
ll r[maxn],w[maxm],where[maxm];
bool is[maxn];
ll ans=0;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(ll i=0;i<n;i++)
    {
        cin>>r[i];
    }
    for(ll i=1;i<=m;i++)
    {
        cin>>w[i];
    }
    queue<ll> q;
    for(ll i=0;i<2*m;i++)
    {
        ll curr;
        cin>>curr;
        if(curr<0)
        {
            curr*=-1;
            is[where[curr]]=0;
            continue;
        }
        q.push(curr);
        for(ll i=0;i<n;i++)
        {
            if(q.size()==0) break;
            if(is[i]==0)
            {
                ans+=r[i]*w[curr];
                where[curr]=i;
                is[i]=1;
                q.pop();
            }
        }
    }
    cout<<ans<<"\n";
}

Subtask #1
40.0 / 100.0

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