oj.uz

Submission #1036218

# Submission time Handle Problem Language Result Execution time Memory
1036218 2024-07-27T06:08:40 Z adrielcp Garage (IOI09_garage) C++17
100 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

#define info pair<int, int>
void solve() {
  int n,m;cin>>n>>m;
  priority_queue<info, vector<info>, greater<info>> pq;
  vector<int> rate(n);
  for (int i = 0; i < n; i++) {
    cin >> rate[i];
    pq.push({i, rate[i]});
  }

  vector<int> w(m+1);
  for (int i = 1; i <= m; i++) cin >> w[i];

  vector<int> pos(m+1, -1); // current space

  queue<int> q;
  int ans = 0;
  for (int i = 0; i < 2*m; i++) {
    int tmp;cin>>tmp;
    if (tmp > 0) {
      if (!pq.size()) q.push(tmp);
      else {
        auto [idx, rt] = pq.top();pq.pop();
        pos[tmp] = idx;
        ans += rt * w[tmp];
      }
    } else {
      tmp *= -1;
      int prevpos = pos[tmp];
      pq.push({prevpos, rate[prevpos]});

      if (q.size()) {
        auto [idx, rt] = pq.top();pq.pop();
        int nextcar = q.front();q.pop();
        // debug(nextcar);
        pos[nextcar] = idx;
        ans += rt * w[nextcar];
      }
    }
    // debug(ans);
  }

  cout << ans << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct