Submission #417373

#TimeUsernameProblemLanguageResultExecution timeMemory
417373maximath_1Job Scheduling (IOI19_job)C++17
0 / 100
7 ms1188 KiB
#include "job.h"
#include <vector>
#include <set>
using namespace std;
#define ll long long

struct job{
	int u, d, id;
	bool operator < (const job &rhs) const{
		return d * 1ll * rhs.u < u * 1ll * rhs.d;
	}
};

long long scheduling_cost(vector<int> p, vector<int> u, vector<int> d){
	int n = p.size();
	set<job> s;
	for(int i = 1; i < n; i ++)
		s.insert({u[i], d[i], i});

	ll ans = 0ll, tim = 0ll;
	tim += d[0]; ans += tim * u[0];

	for(auto i : s){
		tim += d[i.id];
		ans += tim * u[i.id];
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...