제출 #145187

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
145187	2019-08-19 08:37:16	ecnerwala	Job Scheduling (IOI19_job)	C++14	100 / 100	324 ms	18036 KiB

job

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "job.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll scheduling_cost(vector<int> P, vector<int> U_, vector<int> D_) {
  vector<ll> U(U_.begin(), U_.end());
  vector<ll> D(D_.begin(), D_.end());
  int N = int(P.size());
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    ans += U[i] * D[i];
  }
  // build things earlier with high U[i] / D[i]
  auto cmp = [](pair<pair<ll, ll>, int> i, pair<pair<ll, ll>, int> j) {
    // returns true if j comes first
    return j.first.second * i.first.first < i.first.second * j.first.first;
  };
  priority_queue<pair<pair<ll, ll>, int>, vector<pair<pair<ll, ll>, int>>, decltype(cmp)> pq(cmp);
  vector<char> dead(N);
  for (int i = 1; i < N; i++) {
    if (U[i] == 0 && D[i] == 0) {
      dead[i] = true;
    } else {
      pq.emplace(pair<ll, ll>(U[i], D[i]), i);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 37 / 37