# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729678 | PanosPask | Job Scheduling (CEOI12_jobs) | C++14 | 153 ms | 17652 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;
vector<int> jobs;
vector<vector<int>> job_ids;
bool can_complete(int x)
{
int cur_day = 0;
vector<int> jobs_at = jobs;
for (int i = 0; i < n; i++) {
if (i - cur_day > d)
return false;
int avail = x;
while (avail > 0 && cur_day <= i) {
int rm = min(avail, jobs_at[cur_day]);
avail -= rm;
jobs_at[cur_day] -= rm;
while (cur_day <= i && jobs_at[cur_day] == 0)
cur_day++;
}
}
return true;
}
int main(void)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |