# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670408 | asdf334 | Job Scheduling (CEOI12_jobs) | C++17 | 226 ms | 18084 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 sz(x) (int)x.size()
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int N, D, M; cin >> N >> D >> M;
map<int, vector<int>> vals;
for (int i = 1; i <= M; ++i) {
int num; cin >> num;
vals[num].push_back(i);
}
int left = 1; int right = 1e6;
while (left < right) {
int mid = left + (right - left) / 2;
int curr = 0; int del = 0;
for (auto val : vals) {
curr += sz(val.second);
del = max(del, (int)ceil(curr / mid) - val.first);
}
if (del > D) {
left = mid + 1;
} else {
right = mid;
}
}
cout << left << '\n';
int ctr = 0; vector<vector<int>> ans(N);
for (auto val : vals) {
for (int num : val.second) {
if (sz(ans[ctr]) >= left) ++ctr;
ans[ctr].push_back(num);
}
}
for (vector<int> day : ans) {
for (int req : day) {
cout << req << " ";
}
cout << 0 << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |