| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 650822 | borisAngelov | Job Scheduling (CEOI12_jobs) | C++11 | 445 ms | 26372 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
int n, m, d;
vector<pair<int, int>> jobs;
pair<bool, vector<vector<int>>> check(int machines) {
    vector<vector<int>> schedule;
    schedule.resize(n + 1);
    int currMachineIdx = 1;
    int currDay = 1;
    for (auto [day, idx] : jobs) {
        if (currDay > day + d || currDay > n) {
            return {false, schedule};
        }
        schedule[currDay].push_back(idx);
        currMachineIdx++;
        if (currMachineIdx == machines + 1) {
            currMachineIdx = 1;
            currDay++;
        }
    }
    return {true, schedule};
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> d >> m;
    for (int i = 1; i <= m; i++) {
        int day; cin >> day;
        jobs.push_back({day, i});
    }
    sort(jobs.begin(), jobs.end());
    int l = 1;
    int r = m;
    while (l <= r) {
        int mid = (l + r) / 2;
        if (check(mid).first) r = mid - 1;
        else l = mid + 1;
    }
    cout << l << endl;
    vector<vector<int>> schedule = check(l).second;
    for (int i = 1; i <= n; i++) schedule[i].push_back(0);
    for (int i = 1; i <= n; i++) {
        for (auto idx : schedule[i]) cout << idx << " "; cout << "\n";
    }
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
