oj.uz

답안 #519166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519166 2022-01-25T19:28:44 Z AdamGS Garage (IOI09_garage) C++17
100 / 100
 2 ms 460 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=107;
int T[LIM], W[20*LIM], P[20*LIM], ans;
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin >> n >> m;
	rep(i, n) cin >> T[i];
	rep(i, m) cin >> W[i];
	priority_queue<int>q;
	queue<int>kol;
	rep(i, n) q.push(-i);
	rep(i, 2*m) {
		int a;
		cin >> a;
		if(a<0) {
			a*=-1;
			q.push(-P[a-1]);
		} else {
			kol.push(a-1);
		}
		while(!kol.empty() && !q.empty()) {
			int p=-q.top(), x=kol.front(); 
			q.pop(); kol.pop();
			P[x]=p;
			ans+=W[x]*T[p];
		}
	}
	cout << ans << '\n';
}

Subtask #1
100.0 / 100.0

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