# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027939 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++17 | 1092 ms | 12840 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 <bits/stdc++.h>
using namespace std;
int n, d, m;
priority_queue<pair<int, int> > req;
vector<int> res[100000];
int main() {
cin>>n>>d>>m;
for(int i = 0; i < m; i++) {
int a;
cin>>a;
a--;
req.push({-a, i});
}
int l = 0, r = n - 1;
while(true) {
int mid = (l + r) / 2;
bool ok = true;
for(int i = 0; i < n; i++) {
res[i].clear();
for(int j = 0; j < mid; j++) {
int k = req.top().first;
int idx = req.top().second;
req.pop();
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |