# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925525 | allw | Job Scheduling (CEOI12_jobs) | C++17 | 0 ms | 0 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>
bool run(std::vector<std::pair<int, int>>& a, int d, int x,
std::vector<std::vector<int>>& answer) {
int i = a.size() - 1;
for (int j = a.size() - 1; j >= 0; --j) {
if (a[i].first > j) return false;
int v = x;
while (i >= 0 && v > 0 && j - a[i].first <= d) {
answer[j].push_back(a[i].second);
--i;
--v;
}
}
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;