oj.uz

답안 #758275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758275 2023-06-14T11:01:12 Z JANCARAPAN Garage (IOI09_garage) C++17
100 / 100
 2 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;  
#define ll long long
#define fi first
#define se second
#define sz(a) (long long) a.size()
#define endl '\n'

const long long INF = 1e18, MOD = 1e9+7; 

void test_case() {
  int n, m;
  cin >> n >> m;  
  set<pair<int,int>> r;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    r.insert({i, x});
  }
  vector<int> w(m);
  vector<pair<int,int>> cur(m);
  for (int i = 0; i < m; i++) cin >> w[i];
  ll ans = 0;
  queue<int> q;
  for (int i = 0; i < 2 * m; i++) {
    int p;
    cin >> p;
    if (p > 0) {
      q.push(p - 1);
    } 
    else {
      p++;
      r.insert(cur[-p]);
    }
    while (q.size() and r.size()) {
      auto p = q.front();
      q.pop();
      auto it = r.begin();
      cur[p] = *it;
      ans += (*it).se * w[p];
      r.erase(it);
    }
  }
  cout << ans << endl;
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
    test_case();
  }
  return 0;
}

Subtask #1
100.0 / 100.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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct