# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373259 | MilosMilutinovic | Job Scheduling (IOI19_job) | C++14 | 239 ms | 56668 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;
#define ll long long
#define pb push_back
const int mxN=2e5;
int n;
vector<int> adj[mxN];
vector<ll> p(mxN), u(mxN), d(mxN);
bool was[mxN];
ll ans=0;
struct cmp{
bool operator()(int x, int y) {
return (ll)d[x]*(ll)u[y]>(ll)d[y]*(ll)u[x];
}
};
priority_queue<int, vector<int>, cmp> q[mxN];
void merge(int x, int y) {
d[x]+=d[y];
u[x]+=u[y];
}
void dfs(int x) {
assert(x>=0&&x<n);
for(int v:adj[x])
# | 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... |