# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642974 | thinhcute | Job Scheduling (CEOI12_jobs) | C++17 | 147 ms | 1996 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;
#define fi first
#define se second
#define MAX 100100
int n, d, m;
pair<int, int> a[MAX];
bool f(int mid)
{
int i = 1, day;
queue<pair<int, int>> q;
while (i <= m) {
day = a[i].fi;
while (a[i].fi == day && i <= m) {
q.push(a[i]);
i++;
}
while ((int) q.size() && day <= a[i - 1].fi) {
for (int k = 1; k <= mid; k++) {
if (q.empty()) goto SKIP;
if (abs(q.front().fi - day) > d) return false;
q.pop();
}
day++;
}
SKIP:;
}
return day - 1 <= n && q.empty();
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> d >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i].fi;
a[i].se = i;
}
sort(a + 1, a + m + 1);
int l = 1, r = n, res = -1;
while (l <= r) {
int mid = (l + r) >> 1;
if (f(mid)) {
res = mid;
r = mid - 1;
} else l = mid + 1;
}
cout << res << endl;
int j = 1;
for (int i = 1; i <= n; i++) {
int cnt = 0;
// cout << i << " " << j << " " << a[j].fi << endl;
while (cnt < res && j <= m && abs(a[j].fi - i) <= d) {
cnt++;
cout << a[j].se << " ";
j++;
}
cout << 0 << endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |