# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251359 | cjoa | Job Scheduling (IOI19_job) | C++14 | 189 ms | 19812 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 <vector>
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long llong;
struct Temple {
int id;
llong days, cost;
bool operator<(const Temple& t) const {
return days * t.cost > t.days * cost;
}
};
long long scheduling_cost(vector<int> p, vector<int> u, vector<int> d) {
int N = p.size();
VVI tree(N);
for (int i = 1; i < N; ++i)
tree[ p[i] ].push_back(i);
llong T = 0;
llong res = 0;
# | 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... |