oj.uz

Submission #143845

# Submission time Handle Problem Language Result Execution time Memory
143845 2019-08-15T10:27:09 Z SpeedOfMagic Job Scheduling (IOI19_job) C++17
0 / 100
 2 ms 376 KB 
#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<int, int>> cur;
	for (int i = 0; i < n; i++)
		if (out[i] == 0)
			cur.push({-u[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({-u[p[ind]], p[ind]});
	}
	
	return ans;
	
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB secret mismatch
2 Halted 0 ms 0 KB -