Submission #434450

#	Time	Username	Problem	Language	Result	Execution time	Memory
434450		egekabas	Job Scheduling (IOI19_job)	C++14	7 / 100	94 ms	14392 KiB

job

#include "job.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int n;
vector<int> g[200009];
int root;
ll ans = 0;
int sf(pii a, pii b){
	return a.ss*b.ff < a.ff*b.ss;
}
pii dfs(int v, int curt, vector<int> &c, vector<int> &t){
	curt += t[v];
	ans += c[v]*curt;
	//cout << v << ' ' << c[v] << ' ' << curt << '\n';
	vector<pii> vec;
	for(auto u : g[v])
		vec.pb(dfs(u, curt, c, t));
	sort(all(vec), sf);
	pii ret = {0, 0};
	for(auto u : vec){
		ans += u.ff*ret.ss;
		ret.ss += u.ss;
		ret.ff += u.ff;
	}
	ret.ss += t[v];
	ret.ff += c[v];
	return ret;
}
long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {
	n = p.size();
	for(int i = 0; i < n; ++i){
		if(p[i] == -1)
			root = i;
		else
			g[p[i]].pb(i);
	}
	ans = 0;
	dfs(root, 0, u, d);
	return ans;
}

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