# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424778 | aris12345678 | Job Scheduling (CEOI12_jobs) | C++14 | 329 ms | 17244 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;
const int mxN = 100005;
const int mxM = 1000005;
pair<int, int> day[mxM];
bool check(int x, int m, int d, int n) {
int j = 0;
for(int i = 1; i <= n+1; i++) {
int md = x;
while(md-- && j < m && day[j].first <= i) {
if(i > d+day[j].first)
return false;
j++;
}
}
return true;
}
int main() {
int n, d, m;
scanf("%d %d %d", &n, &d, &m);
for(int i = 0; i < m; i++) {
scanf("%d", &day[i].first);
day[i].second = i+1;
}
sort(day, day+m);
int lb = 1, rb = m, md, ans = -1;
while(lb <= rb) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |