# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987491 | OAleksa | Job Scheduling (CEOI12_jobs) | C++14 | 1075 ms | 49296 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>
#define f first
#define s second
using namespace std;
const int N = 1e6 + 69;
signed int n, m, d, a[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> d >> m;
for (int i = 0;i < m;i++)
cin >> a[i];
sort(a, a + m);
int l = 1, r = m, ans = 0;
auto check = [&](int mid) {
int t = 0, s = 1;
for (int i = 0;i < m;i++) {
t += 1;
if (t > mid) {
s += 1;
t = 1;
}
if (s < a[i]) {
s = a[i];
t = 1;
}
if (a[i] + d < s)
return false;
}
return true;
};
while (l <= r) {
int mid = (l + r) / 2;
if (check(mid)) {
ans = mid;
r = mid - 1;
}
else
l = mid + 1;
}
cout << ans << '\n';
for (int i = 1;i <= n;i++) {
if (i > n - d) {
cout << 0 << '\n';
continue;
}
for (int j = 1;j <= ans + 1;j++)
cout << 0 << ' ';
cout << '\n';
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |