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 int64 = long long;
int64 scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
int N = p.size();
vector<int> alive(N, 1);
int64 tim = 0, ans = 0;
for (int _round = 0; _round < N; ++_round) {
int id = -1;
for (int i = 0; i < N; ++i) {
if (alive[i] and (id == -1 or d[i] * u[id] < d[id] * u[i])) id = i;
}
if (p[id] == -1) {
tim += d[id];
ans += u[id] * tim;
}
else {
ans -= d[id] * u[p[id]];
d[p[id]] += d[id];
u[p[id]] += u[id];
}
alive[id] = 0;
for (int i = 0; i < N; ++i) {
if (p[i] == id) p[i] = p[id];
}
}
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... |