제출 #1193797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193797		chaeryeong	Job Scheduling (IOI19_job)	C++20	5 / 100	3095 ms	17088 KiB

job

#include "job.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long ld;
const int MAXN = 2e5 + 25;
//sum * d[i] + (sum - u[i]) * d[j] < sum * d[j] + (sum - u[j]) * d[i]
//- u[i] * d[j] < -u[j] * d[i]
//u[i] * d[j] > u[j] * d[i]
//u[i] / d[i] > u[j] / d[j] when i is more optimal than j

ll scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
	vector <int> adj[(int)p.size()];
	for (int i = 0; i < (int)p.size(); i++) {
		if (p[i] != -1) {
			adj[p[i]].push_back(i);
		}
	}
	vector <int> ee;
	ee.push_back(0);
	vector <int> ans;
	while (!ee.empty()) {
		sort(ee.begin(), ee.end(), [&] (auto i, auto j) {
			return (ll)u[i] * (ll)d[j] > (ll)u[j] * (ll)d[i];
		});
		int k = ee[0];
		ee.erase(ee.begin());
		ans.push_back(k);
		for (auto i : adj[k]) {
			ee.push_back(i);
		}
	}
	ll sum = 0, ret = 0;
	for (auto i : ans) {
		sum += u[i];
	}
	for (auto i : ans) {
		ret += sum * (ll)d[i];
		sum -= u[i];
	}
	return ret;
}

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