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;
using lint = long long;
lint scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
int n = p.size();
lint ans = 0;
if (accumulate(begin(p), end(p), 0ll) == 0) {
sort(begin(u), end(u));
lint t = 0;
for (int i = 0; i < n; i++) {
ans += (t + d[i]) * u[i];
t += d[i];
}
} else {
lint t = 0;
for (int i = 0; i < n; i++) {
ans += (t + d[i]) * u[i];
t += d[i];
}
}
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... |