# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742992 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++17 | 1086 ms | 65536 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;
const int N = 1e5 + 1;
const int M = 1e6 + 1;
priority_queue<pair<int,int>> q[M];
int arr[N];
int n,d,m;
bool solve(int mid) {
for(int i=1;i<=m;i++) {
while (!q[i].empty()) q[i].pop();
}
for(int i=1;i<=n;i++) {
q[arr[i]].push({arr[i]+d, i});
}
for(int i=1;i<m;i++) {
while (q[i].size()>mid) {
auto [a,b] = q[i].top(); q[i].pop();
if (a<=i) return false;
q[i+1].push({a, b});
}
}
return q[m].size() <= mid;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> m >> d >> n;
for(int i=1;i<=n;i++) cin >> arr[i];
int l = 1 , r = N + 100;
while (l < r) {
int mid = (l + r) / 2;
if (solve(mid)) r = mid;
else l = mid + 1;
}
cout << l << '\n';
solve(l);
for(int i=1;i<=m;i++) {
while (!q[i].empty()) {
auto [a,b] = q[i].top(); q[i].pop();
cout << b << ' ';
}
cout << "0\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |