# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260093 | tincamatei | Job Scheduling (CEOI12_jobs) | C++14 | 349 ms | 24184 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>
const int MAX_M = 1000000;
const int MAX_N = 100000;
struct Request {
int id, submit, assigned;
}requests[MAX_M];
bool cmp(Request a, Request b) {
return a.submit < b.submit;
}
bool check(int N, int D, int M, int K) {
int lastjob = 0;
for(int i = 1; i <= N; ++i) {
int used = 0;
while(lastjob < M && requests[lastjob].submit <= i && used < K) {
if(requests[lastjob].submit + D < i)
return false;
requests[lastjob].assigned = i;
++lastjob;
++used;
}
}
return true;
}
std::vector<int> jobs[1+MAX_N];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |