제출 #143849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
143849		SpeedOfMagic	Job Scheduling (IOI19_job)	C++17	24 / 100	191 ms	14416 KiB

job

#include "job.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//24 3
long long scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
	int n = p.size();
	ll t = 0;
	for (int i : d)
		t += i;
	
	int out[n];
	memset(out, 0, sizeof out);
	for (int i = 0; i < n; i++)
		if (p[i] != -1)
			out[p[i]]++;
	
	ll ans = 0;
	priority_queue<pair<long double, int>> cur;
	for (int i = 0; i < n; i++)
		if (out[i] == 0)
			cur.push({-(long double) u[i] / (long double) d[i], i});
	
	while (!cur.empty()) {
		int ind = cur.top().second;
		//cout << ind << " " << t << endl;
		cur.pop();
		ans += u[ind] * t;
		t -= d[ind];
		out[p[ind]]--;
		if (out[p[ind]] == 0)
			cur.push({-(long double) u[p[ind]] / (long double) d[p[ind]], p[ind]});
	}
	
	return ans;
	
	return 0;
}

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