oj.uz

Submission #384812

# Submission time Handle Problem Language Result Execution time Memory
384812 2021-04-02T10:45:57 Z ritul_kr_singh Garage (IOI09_garage) C++17
100 / 100
 2 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, m, c, ans = 0; cin >> n >> m;
	int r[n]; for(int &i : r) cin >> i;
	int w[m]; for(int &i : w) cin >> i;
	int pos[m];

	set<int> s;
	queue<int> q;
	for(int i=0; i<n; ++i) s.insert(i);

	for(int i=0; i<m+m; ++i){
		cin >> c;
		if(c>0){
			--c;
			q.push(c);
		}else{
			s.insert(pos[-c-1]);
		}
		while(!s.empty() and !q.empty()){
			c = q.front(); q.pop();
			ans += r[pos[c] = *s.begin()] * w[c];
			s.erase(s.begin());
		} 
	}
	cout << ans;
}

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 2 ms 364 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 1 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 2 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct