| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 978422 |
2024-05-09T08:09:58 Z |
tamir1 |
Garage (IOI09_garage) |
C++17 |
|
1 ms |
452 KB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,i,ans,w[2005],p[105],loc[2005],idx,val;
queue<ll> q;
set<ll> s;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(i=1;i<=n;i++){
cin >> p[i];
s.insert(i);
}
for(i=1;i<=m;i++) cin >> w[i];
for(i=1;i<=2*m;i++){
cin >> val;
if(val<0){
val=-val;
s.insert(loc[val]);
}
else q.push(val);
while(!s.empty() && !q.empty()){
idx=*(s.begin());
s.erase(s.begin());
val=q.front();
q.pop();
loc[val]=idx;
ans+=w[val]*p[idx];
}
}
cout << ans;
}
| # |
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 |
452 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 |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 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 |
