# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349603 | thecodingwizard | Job Scheduling (IOI19_job) | C++17 | 133 ms | 47192 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;
using ll = long long;
#define pb push_back
#define all(x) x.begin(), x.end()
#define ii pair<int, int>
#define f first
#define s second
#define mp make_pair
ll ans = 0;
vector<int> adj[200000];
vector<int> p, u, d;
vector<pair<int, pair<ll,ll>>> indices;
bool done[200000];
void dfs(int node, ll dist, ll sumU) {
//ans += d[node]*dist;
indices.pb(mp(node, mp(dist, sumU)));
for (int v : adj[node]) {
dfs(v, dist+d[v], sumU + u[v]);
}
}
long long scheduling_cost(std::vector<int> _p, std::vector<int> _u, std::vector<int> _d) {
p = _p, u = _u, d = _d;
# | 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... |