This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "job.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n;
vector<int> adj[N];
priority_queue<pair<double,int> > q;
long long now,ans;
long long scheduling_cost(vector<int> p,vector<int> u,vector<int> d)
{
n = p.size();
for(int i = 0;i < n;i++) if(i) adj[p[i]].push_back(i);
q.push({(double)u[0]/(double)d[0],0});
while(!q.empty())
{
int x = q.top().second;
q.pop();
now+=d[x];
ans+=now*u[x];
for(int v : adj[x]) q.push({(double)u[v]/(double)d[v],v});
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |