# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293054 | Autoratch | Job Scheduling (IOI19_job) | C++14 | 177 ms | 15100 KiB |
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],rev;
bool visited[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++) q.push({-(double)d[i]/(double)u[i],i});
while(!q.empty())
{
int x = q.top().second;
q.pop();
rev.clear();
while(x!=-1 and !visited[x]) rev.push_back(x),x = p[x];
reverse(rev.begin(),rev.end());
for(int x : rev) now+=d[x],ans+=now*u[x],visited[x] = true;
}
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... |