제출 #484437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484437		PoPularPlusPlus	Garage (IOI09_garage)	C++17	100 / 100	1 ms	332 KiB

garage

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	ll s1[n];
	for(int i = 0; i < n; i++){
		cin >> s1[i];
	}
	ll w[m];
	for(int i = 0; i < m; i++)cin >> w[i];
	queue<int> q;
	set<int> s;
	ll ans = 0;
	for(int i = 0; i < n; i++)s.insert(i);
	int cur[m];
	for(int i = 0; i < m + m; i++){
		int x;
		cin >> x;
		if(x < 0){
			x++;
			s.insert(cur[-x]);
		}
		else {
			x--;
			q.push(x);
		}
		if(q.size() && s.size()){
			int car = q.front();
			q.pop();
			int place = *s.begin();
			s.erase(s.begin());
			ans += w[car] * s1[place];
			cur[car] = place;
		}
	}
	cout << ans << '\n';	
}	

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

• Subtask 1: 100 / 100