oj.uz

Submission #1089047

# Submission time Handle Problem Language Result Execution time Memory
1089047 2024-09-15T19:51:55 Z kokoue Garage (IOI09_garage) C++14
100 / 100
 1 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;
    while(!q.empty()) q.pop();
    for(ll j=0;j<2*m;j++)
    {
        ll curr;
        cin>>curr;
        if(curr<0)
        {
            curr*=-1;
            is[where[curr]]=0;
            for(ll i=0;i<n;i++)
            {
                if(q.size()==0) break;
                if(is[i]==0)
                {
                    curr=q.front();
                    ans+=r[i]*w[curr];
                    where[curr]=i;
                    is[i]=1;
                    q.pop();
                }
            }
            continue;
        }
        q.push(curr);
        for(ll i=0;i<n;i++)
        {
            if(q.size()==0) break;
            if(is[i]==0)
            {
                curr=q.front();
                ans+=r[i]*w[curr];
                where[curr]=i;
                is[i]=1;
                q.pop();
            }
        }
    }
    cout<<ans<<"\n";
}

Subtask #1
100.0 / 100.0

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