# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307998 | urd05 | Job Scheduling (IOI19_job) | C++14 | 116 ms | 11752 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;
typedef pair<long long,long long> P;
bool comp(P a,P b) {
return a.first*b.second<b.first*a.second;
}
long long scheduling_cost(vector<int> p,vector<int> u,vector<int> d) {
int n=p.size();
if (n>2&&p[2]!=0) {
long long ret=0;
long long t=0;
for(int i=0;i<n;i++) {
t+=d[i];
ret+=t*u[i];
}
return ret;
}
vector<P> v;
for(int i=1;i<n;i++) {
v.push_back(P(d[i],u[i]));
}
sort(v.begin(),v.end(),comp);
long long ret=u[0]*d[0];
long long t=d[0];
for(int i=0;i<v.size();i++) {
t+=v[i].first;
ret+=t*v[i].second;
}
return ret;
}
Compilation message (stderr)
# | 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... |