oj.uz

답안 #346484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346484 2021-01-10T00:38:48 Z MilosMilutinovic Garage (IOI09_garage) C++14
100 / 100
 3 ms 492 KB 
/**
 *  author: milos
 *  created: 10.01.2021 01:24:34
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> b(m);
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  vector<int> que;     
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  vector<int> l(m);
  for (int i = 0; i < 2 * m; i++) {
    int x;
    cin >> x;
    if (x > 0) {
      --x;          
      if (!p.empty()) {
        sort(p.begin(), p.end());
        l[x] = p[0];
        p.erase(p.begin());
      } else {
        que.push_back(x);
      }
    } else {
      x = -x;
      --x;
      if (!que.empty()) {
        l[que[0]] = l[x];
        que.erase(que.begin());
      } else {
        p.push_back(l[x]);
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < m; i++) {
    ans += a[l[i]] * b[i];
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
100.0 / 100.0

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