# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
675716 | aaggupta07 | Job Scheduling (CEOI12_jobs) | C++17 | 348 ms | 22216 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
#define MAX_C 1'000'001
#define pb push_back
#define pi pair<int, int>
#define f first
#define s second
int n, d, m;
vector<pi> requests;
bool check(int r) {
int days = 0, jobsDone = 0;
for(int i = 0; i < m; ++i) {
// process r requests per day
if(requests[i].f > days) {
days = requests[i].f;
++jobsDone;
continue;
}
if(jobsDone % r == 0) days += 1;
if(days - requests[i].f > d) return false;
++jobsDone;
}
return true;
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> d >> m;
requests.resize(m);
for(int i = 0; i < m; ++i) {
cin >> requests[i].f;
requests[i].s = i + 1;
}
sort(requests.begin(), requests.end());
int ans = MAX_C;
for(int b = MAX_C/2; b >= 1; b/=2) {
while(ans - b >= 1 && check(ans - b)) ans -= b;
}
cout << ans << '\n';
int days = 0, jobsDone = 0;
vector<vector<int>> schedule(n);
for(int i = 0; i < m; ++i) {
// process r requests per day
if(requests[i].f > days) days = requests[i].f;
else if(jobsDone % ans == 0) days += 1;
++jobsDone;
schedule[days-1].pb(requests[i].s);
}
for(auto& i: schedule) {
for(int j: i) cout << j << ' '; cout << 0 << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |