답안 #98204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98204	2019-02-21T13:52:47 Z	SuperJava	Garage (IOI09_garage)	C++17	100 / 100	5 ms	404 KB

garage

//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng);}
//endfold
#define  N  (105)
#define MOD (1000000000l + 7l)
#define OO (1050000000)
#define OOL (1100000000000000000)

int r[N];
int v[N];
int w[2005];

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	memset(v,-1,sizeof v);
	int n,m;
	cin >> n >> m;
	rep(i,0,n){
		cin >> r[i];
	}
	rep(i,0,m){
		cin >> w[i];
	}
	queue<int> q;
	ll ans = 0;
	rep(i,0,2*m){
		int num;
		cin >> num;
		if(num < 0){
			rep(j,0,n){
				if(v[j] == -num){
					v[j] = -1;
				}
			}
			if(q.size()){
				int x = q.front();
				q.pop();
				rep(j,0,n){
					if(v[j] == -1){
						v[j] = x;
						ans += r[j]*w[x-1];
						break;
					}
				}
			}
		}else{
			bool d = 0;
			rep(j,0,n){
				if(v[j] == -1){
					v[j] = num;
					ans += r[j]*w[num-1];
					d = 1;
					break;
				}
			}
			if(d) continue;
			else{
				q.push(num);
			}
		}
	}
	cout << ans;
	return 0;
}

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	404 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct