답안 #672437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672437 2022-12-16T07:23:45 Z sudheerays123 Garage (IOI09_garage) C++17
100 / 100
1 ms 340 KB
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;

void solve(){

	ll n,m;
	cin >> n >> m;

	vector<ll> a(n+5);
	for(ll i = 1; i <= n; i++) cin >> a[i];

	vector<ll> w(m+5);
	for(ll i = 1; i <= m; i++) cin >> w[i];

	set<ll> space;
	for(ll i = 1; i <= n; i++) space.insert(i);
	vector<ll> occupied(m+5);

	queue<ll> q;
	ll ans = 0;

	for(ll i = 1; i <= 2*m; i++){
		ll x;
		cin >> x;

		if(x > 0){
			if(!space.size()) q.push(x);
			else{
				auto it = space.begin();
				ll y = (*(it));
				ans += a[y]*w[x];
				space.erase(space.begin());
				occupied[x] = y;
			}
		}
		else{
			x *= -1;
			space.insert(occupied[x]);
			if(q.size()){
				ll y = q.front();
				q.pop();
				auto it = space.begin();
				ll z = (*(it));
				ans += a[z]*w[y];
				space.erase(space.begin());
				occupied[y] = z;
			}
		}
	}

	cout << ans;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct