oj.uz

Submission #333688

# Submission time Handle Problem Language Result Execution time Memory
333688 2020-12-07T13:47:31 Z Sho10 Garage (IOI09_garage) C++14
100 / 100
 6 ms 364 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[105],b[2005],m,d[2005];
map<ll,ll>viz;
int32_t main(){
CODE_START;
cin>>n>>m;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
}
for(ll i=1;i<=m;i++)
{
    cin>>b[i];
    d[i]=-1;
}
queue<ll>q;
ll ans=0;
for(ll i=1;i<=2*m;i++)
{
    ll x;
    cin>>x;
    if(x>0){
        q.push(x);
    }else {
    x=abs(x);
    viz[d[x]]--;
    d[x]=-1;
}
if(!q.empty()){
    ll nr=q.front();
    ll val=0;
    for(ll j=1;j<=n;j++)
    {
        if(viz[j]==0&&val==0){
            val++;
        ans+=a[j]*b[nr];
            viz[j]++;
            d[nr]=j;
        }
    }
    if(val!=0){
        q.pop();
    }
}
}
cout<<ans<<endl;
}

Subtask #1
100.0 / 100.0

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