# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925533 | allw | Job Scheduling (CEOI12_jobs) | C++17 | 332 ms | 23852 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 <iostream>
#include <vector>
#include <algorithm>
bool run(std::vector<std::pair<int, int>>& a, int d, int x,
std::vector<std::vector<int>>& answer) {
if (false) {
for (int i = 0; i < a.size(); ++i) {
std::cout << '(' << a[i].first << ", " << a[i].second << ") ";
}
std::cout << '\n';
}
int i = 0;
for (int j = 1; i < a.size() && j < answer.size(); ++j) {
//std::cout << i << ' ' << a[i].first << ' ' << j << '\n';
if (a[i].first + d < j) {
// std::cout << "======\n";
return false;
}
int v = x;
while (i < a.size() && v > 0 && j >= a[i].first && j <= a[i].first + d) {
answer[j].push_back(a[i].second);
++i;
--v;
}
}
// std::cout << "======\n";
return true;
}
int main() {
int n, d, m;
std::cin >> n >> d >> m;
std::vector<std::pair<int, int>> a(m, {0, 0});
for (int i = 0; i < m; ++i) {
std::cin >> a[i].first;
a[i].second = i + 1;
}
std::sort(a.begin(), a.end());
int l = 0;
int r = n;
std::vector<std::vector<int>> answer;
// (l, r]
while (l + 1 < r) {
answer = std::vector<std::vector<int>>(n + 1, std::vector<int>());
int m = (l + r) / 2;
//std::cout << m << ' ' << run(a, d, m, answer) << '\n';
if (run(a, d, m, answer)) {
r = m;
} else {
l = m;
}
}
answer = std::vector<std::vector<int>>(n + 1, std::vector<int>());
run(a, d, r, answer);
std::cout << r << '\n';
for (int i = 1; i <= n; ++i) {
for (size_t j = 0; j < answer[i].size(); ++j) {
std::cout << answer[i][j] << ' ';
}
std::cout << "0\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |