# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384255 | MalachiN | Job Scheduling (CEOI12_jobs) | C++14 | 621 ms | 17132 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 <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
int N, D, M;
int jobs[1000001];
vector<int> byngggumb[100001];
bool test(int x){
int tracker = 0;
for (int n = 1; n <= N; n++){
int itter = tracker;
for (int c = itter; c < itter+x; c++){
if (tracker < M){
if (jobs[tracker] <= n){
if (jobs[tracker]+D < n){
return false;
}
tracker++;
}
else {
break;
}
}
else {
return true;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |