# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063904 | kingjuno | Garage (IOI09_garage) | C++14 | 4 ms | 548 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
* king_juno
* 2024-08-18 10:57:15
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll,ll> mapi;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define fl(i, b) for (int i=0; i<(b); i++)
#define fr(i, a, b) for (int i=0; i<(b); i++)
#define el "\n"
#define sp " "
#define pb push_back
#define spre(x) fixed<<setprecision(x)
#define read(s) fl(i,s.size())cin>>s[i];
#define write(s) fl(i,s.size())cout<<s[i]<<sp;
#define sor(s) sort(s.begin(),s.end());
#define rsor(s) sort(s.rbegin(),s.rend());
#define inf INT_MAX
#define rev(a) reverse(a.begin(),a.end());
#define sumv(a) accumulate(a.begin(),a.end());
#define maxv(a) max_element(a.begin(),a.end());
#define minv(a) min_element(a.begin(),a.end());
#define cnt(a,x) count(a.begin(),a.end(),x);
bool sortsec(const pair<int,int> &a,const pair<int,int> &b)
{
return (a.second < b.second);
}
int main(){
ll n,m;
cin>>n>>m;
vl ratekg(n);
read(ratekg);
vl weight(m);
read(weight);
int ve;
map<int, int> occ, where;
queue<int> q;
ll cash=0;
fl(j, 2*m){
cin>>ve;
if(ve<0){
// cout<<q.size()<<el;
int pos = where[-ve];
occ[pos]=0;
if(q.size()){
occ[pos]=1;
int ve = q.front();
q.pop();
where[ve]=pos;
cash+=ratekg[pos-1]*weight[ve-1];
}
}
else{
for(int i=1;i<=n;i++){
if(occ[i]==0){
occ[i]=1;
where[ve]=i;
cash+=ratekg[i-1]*weight[ve-1];
goto endloop;
}
}
q.push(ve);
endloop:;
}
// cout<<cash<<el;
}
cout<<cash;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |