oj.uz

Submission #210950

# Submission time Handle Problem Language Result Execution time Memory
210950 2020-03-19T03:25:17 Z Kevin_Zhang_TW Job Scheduling (IOI19_job) C++17
5 / 100
 120 ms 28400 KB 
#include "job.h"
#include <bits/extc++.h>
#include <vector>
#define pb emplace_back
const int maxn = 200010;
using ll = long long;
using namespace std;
int deg[maxn], togo[maxn], tl, n;
ll res;
vector<int> edge[maxn], sorted[maxn];
ll p[maxn], u[maxn], d[maxn];
struct cmp {
	bool operator()(int a, int b) const {
		return d[a] * u[b] > d[b] * u[a];
	}
};
void sub_merge(int a, int b) {
	res -= (ll)d[b] * u[a];
	d[a] += d[b];
	u[a] += u[b];
}
//__gnu_pbds::priority_queue<int, cmp> pq[maxn];
void get_ans() {
	for (int i = 0;i < n;++i) {
		int now = togo[i];
		//cerr << "now " << now << '\n';
		assert(now || i == n-1);
		for (int u : edge[now]) {
			if (sorted[u].size() > sorted[now].size()) swap(sorted[u], sorted[now]);
			int a = sorted[now].size();
			sorted[now].insert(sorted[now].begin(), sorted[u].begin(), sorted[u].end());
			inplace_merge(sorted[now].begin(), sorted[now].begin()+a, sorted[now].end(), cmp());
		}
		while (sorted[now].size() && cmp()(now, sorted[now].back())) {
			sub_merge(now, sorted[now].back());
			sorted[now].pop_back();
		}
		sorted[now].pb(now);
	}
	auto &v = sorted[0];
	ll t = 0;
	auto dojob = [&](int a) {
		//cerr << "dojob " << a << ' ' << "d, u : " << d[a] << ' ' << u[a] << '\n';
		t += d[a];
		res += t * u[a];
	};
	while (v.size()) {
		dojob(v.back());
		v.pop_back();
	}
}
//
//void dfs(int now) {
//	for (int u : edge[i]) dfs(u);
//	sort(edge[now].begin(), edge[now].end(), cmp());
//	vector<int> down;
//	while (edge[now].size() && cmp(now, edge[now].back())) {
//		for (int u : merge(now, edge[now].back()))
//			down.pb(u);
//		edge[now].pop_back();
//	}
//	for (int u : down) edge[now].pb(u);
//}
//
			
long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {
	n = p.size();
	for (int i = 1;i < n;++i) edge[p[i]].pb(i);
	for (int i = 1;i < n;++i) ++deg[ p[i] ];
	for (int i = 0;i < n;++i) if (deg[i] == 0)
		togo[tl++] = i;
	for (int i = 0;i < n;++i) {
		int now = togo[i];
		if (now == 0) break;
		if ( --deg[ p[now] ] == 0) togo[tl++] = p[now];
	}
	for (int i = 0;i < n;++i) 
		::p[i] = p[i], ::u[i] = u[i], ::d[i] = d[i];
	get_ans();
	return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9856 KB Output is correct
5 Correct 38 ms 14328 KB Output is correct
6 Correct 63 ms 18680 KB Output is correct
7 Correct 93 ms 22908 KB Output is correct
8 Correct 114 ms 27256 KB Output is correct
9 Correct 119 ms 27256 KB Output is correct
10 Correct 115 ms 27220 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 116 ms 27256 KB Output is correct
13 Correct 114 ms 27256 KB Output is correct
14 Correct 115 ms 27256 KB Output is correct
15 Correct 118 ms 27256 KB Output is correct
16 Correct 120 ms 27256 KB Output is correct
17 Correct 116 ms 27128 KB Output is correct
18 Correct 117 ms 27256 KB Output is correct
19 Correct 120 ms 27216 KB Output is correct
20 Correct 119 ms 28400 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Incorrect 10 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 9728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 9728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Incorrect 11 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9856 KB Output is correct
5 Correct 38 ms 14328 KB Output is correct
6 Correct 63 ms 18680 KB Output is correct
7 Correct 93 ms 22908 KB Output is correct
8 Correct 114 ms 27256 KB Output is correct
9 Correct 119 ms 27256 KB Output is correct
10 Correct 115 ms 27220 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 116 ms 27256 KB Output is correct
13 Correct 114 ms 27256 KB Output is correct
14 Correct 115 ms 27256 KB Output is correct
15 Correct 118 ms 27256 KB Output is correct
16 Correct 120 ms 27256 KB Output is correct
17 Correct 116 ms 27128 KB Output is correct
18 Correct 117 ms 27256 KB Output is correct
19 Correct 120 ms 27216 KB Output is correct
20 Correct 119 ms 28400 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Incorrect 10 ms 9728 KB Output isn't correct
23 Halted 0 ms 0 KB -