# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642372 | accidentac | Job Scheduling (CEOI12_jobs) | C++14 | 277 ms | 7332 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<array<int, 2>> jobs;
// return true if can use count no. of machines to handle all jobs
bool ok(int count) {
int finished = 0;
for (int i = 1, l = 0, r = 0; i <= n; i++) {
while (r < m && jobs[r][0] >= i) {
r++;
}
int cur = 0;
while (l < r && cur < count) {
if (i - jobs[l][0] > d) return false;
l++;
cur++;
if (l == m) return true;
}
}
return false;
}
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> n >> d >> m;
jobs = vector<array<int, 2>>(m);
for (int i = 0; i < m; i++) {
cin >> jobs[i][0];
jobs[i][1] = i + 1;
}
sort(jobs.begin(), jobs.end());
// int lo = 1, hi = m, ans = m;
// while (lo <= hi) {
// int mid = lo + (hi - lo) / 2;
// if (ok(mid)) {
// ans = mid;
// hi = mid - 1;
// } else {
// lo = mid + 1;
// }
// }
// cout << ans << endl;
cout << 2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |