oj.uz

Submission #53445

# Submission time Handle Problem Language Result Execution time Memory
53445 2018-06-30T04:39:40 Z 윤교준(#1420) Garage (IOI09_garage) C++11
100 / 100
 4 ms 928 KB 
#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
int rd(int s, int e) { return rand()%(e-s+1) + s; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MAXN = 105;
const int MAXM = 2005;

queue<int> S;
set<int> PQ;

ll A[MAXN], B[MAXM];
int C[MAXM];
bool isd[MAXM];

ll Ans;
int N, M;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> M;
	for(int i = 1; i <= N; i++) cin >> A[i];
	for(int i = 1; i <= M; i++) cin >> B[i];

	for(int i = 1; i <= N; i++) PQ.insert(i);

	for(int qi = 0; qi < 2*M; qi++) {
		int c; cin >> c;

		if(0 < c) {
			S.push(c);
		} else {
			c = -c;
			isd[c] = true;
			if(C[c]) {
				PQ.insert(C[c]);
			}
		}

		for(; !S.empty() && !PQ.empty();) {
			int c = S.front(); S.pop();
			if(isd[c]) continue;
			auto it = PQ.begin();
			C[c] = *it;
			PQ.erase(it);
		}
	}

	for(int i = 1; i <= M; i++)
		Ans += A[C[i]] * B[i];
	cout << Ans << endl;
	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 4 ms 652 KB Output is correct
5 Correct 2 ms 652 KB Output is correct
6 Correct 2 ms 652 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 652 KB Output is correct
11 Correct 3 ms 784 KB Output is correct
12 Correct 3 ms 784 KB Output is correct
13 Correct 2 ms 784 KB Output is correct
14 Correct 3 ms 784 KB Output is correct
15 Correct 3 ms 784 KB Output is correct
16 Correct 3 ms 784 KB Output is correct
17 Correct 3 ms 836 KB Output is correct
18 Correct 3 ms 836 KB Output is correct
19 Correct 3 ms 928 KB Output is correct
20 Correct 4 ms 928 KB Output is correct