| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 635623 | nayhz | Job Scheduling (CEOI12_jobs) | C++17 | 0 ms | 0 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.
// CEOI 2012 Dau 1 Job Scheduling
#include <bits/stdc++.h>
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
using namespace std;
/*
>>>>>>>>>>>>>>>>>>>>>>>>>>END OF TEMPLATE HEADER<<<<<<<<<<<<<<<<<<<<<<<<
*/
void solve () {
int n, d, m; cin >> n >> d >> m;
vpii a(m);
for (int i = 0; i < m; i++) {cin >> a[i].fi; a[i].se = i + 1;}
sort(all(a));
vector<vi> ans(n);
int l = 1, r = m, mid, day, i, cnt;
vector<vi> ret(n);
function<pair<bool, vector<vi>> ()> check = [&] () {
ret.clear();
ret.resize(n);
cnt = 0;
for (day = 1; day <= n; day++) {
for (i = 0; i < mid; i++) {
if (a[cnt].fi > day) break;
if (a[cnt].fi + d >= day){
ret[day - 1].pb(a[cnt++].se);
}
else return mp(false, ret);
if (cnt == m) {
return mp(true, ret);
}
}
}
return mp(false, ret);
};
pair<bool, vector<vi>> ret;
while (l < r) {
mid = l + ((r - l) >> 1);
ret = check();
if (ret.fi) {
r = mid, ans = ret.se;
} else l = mid + 1;
}
cout << l << '\n';
for (i = 0; i < n; i++) {
for (int j = 0; j < (int)ans[i].size(); j++) cout << ans[i][j] << ' ';
cout << "0\n";
}
}
signed main () {
solve();
return 0;
}