Submission #417648

#	Time	Username	Problem	Language	Result	Execution time	Memory
417648		Berted	Job Scheduling (IOI19_job)	C++14	19 / 100	114 ms	10472 KiB

job

#include "job.h"
#include <vector>
#include <cassert>
#include <algorithm>
#define vi vector<int>
#define ll long long
#define pii pair<ll, ll>
#define fst first
#define snd second

using namespace std;

int N;
pii A[200001];

inline bool comp(const pii &l, const pii &r)
{
	return l.fst * r.snd > r.fst * l.snd;
}

long long scheduling_cost(vi p, vi u, vi d) 
{
	N = p.size();
	ll t = d[0], res = d[0] * u[0];
	for (int i = 1; i < N; i++)
	{
		assert(p[i] == 0);
		A[i] = {u[i], d[i]};
	}
	sort(A + 1, A + N, comp);
	for (int i = 1; i < N; i++)
	{
		t += A[i].snd;
		res += A[i].fst * t;
	}
	return res;
}

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