# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653657 | finn__ | Job Scheduling (CEOI12_jobs) | C++17 | 1084 ms | 26104 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;
int main()
{
size_t n, m, d;
cin >> n >> d >> m;
vector<pair<int64_t, size_t>> jobs(m);
for (size_t i = 0; i < m; i++)
{
cin >> jobs[i].first;
jobs[i].second = i + 1;
}
sort(jobs.begin(), jobs.end());
vector<int64_t> schedule;
int64_t a = 0, b = m;
while (a < b)
{
int64_t mid = (a + b) / 2;
priority_queue<pair<int64_t, size_t>, vector<pair<int64_t, size_t>>, greater<pair<int64_t, size_t>>> q;
bool possible = 1;
auto it = jobs.begin();
schedule.clear();
for (int64_t i = 1; i <= n && possible; i++)
{
while (it != jobs.end() && it->first == i)
{
q.push(*it);
it++;
}
for (size_t j = 0; j < mid && !q.empty(); j++)
{
if (i - q.top().first > d)
{
possible = 0;
break;
}
schedule.push_back(q.top().second);
q.pop();
}
schedule.push_back(0);
}
if (possible)
b = mid;
else
a = mid + 1;
}
cout << a << '\n';
for (int64_t x : schedule)
{
cout << x << ' ';
if (!x)
cout << '\n';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |