| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 404237 | jadDebugs | Job Scheduling (CEOI12_jobs) | C++14 | 336 ms | 23228 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.
// Author : Jad Isaac
// ID: jadDebugs
// TASK: -----
// LANG: C++
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int, int>
int n, d, m;
bool works(int robots, vector<pii> jobs)
{
int endT[robots] = {0};
int maxD = 0;
for (int i = 0, cur = 0; i < m; i++, cur++) {
if (cur == robots)
cur = 0;
// if our end time for this job is > than our start time for this job
// there will be delay
if (endT[cur] + 1 > jobs[i].f) {
endT[cur]++;
maxD = max(maxD, endT[cur] - jobs[i].f);
}
else
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||