//#include "job.h"
#include <bits/stdc++.h>
using namespace std;
long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {
int n = p.size();
struct node {
long long u, d;
int id;
bool operator<(node p)const{
return u*p.d < d*p.u;
}
};
long long ans = 0;
vector<int> pa(n);
iota(pa.begin(), pa.end(), 0);
function<int(int)> anc = [&](int x){
return x==pa[x] ? x : pa[x]=anc(pa[x]);
};
auto add = [&](int a, int i) {
ans -= d[i] * u[a];
d[a] += d[i];
u[a] += u[i];
};
priority_queue<node> pq;
for(int i = 0; i < n; i++)
pq.push({u[i],d[i],i});
while(pq.size() > 1) {
node x;
do x=pq.top(), pq.pop(); while(pq.size() && (x.u!=u[x.id] || x.d!=d[x.id]));
//if(pq.empty()) break;
int i = x.id;
if(p[i] == -1) continue;
int a = anc(p[i]);
pa[i] = a;
add(a, i);
pq.push({u[a],d[a],a});
}
ans += pq.top().u * pq.top().d;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
238 ms |
12136 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |