# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
913411 | kunzaZa183 | Job Scheduling (CEOI12_jobs) | C++17 | 220 ms | 13904 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 maxm = 1000000;
pair<int, int> arr[maxm];
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, d, m;
cin >> n >> d >> m;
for (int i = 0; i < m; i++)
{
cin >> arr[i].first;
arr[i].first--;
arr[i].second = i;
}
sort(arr, arr + m);
int l = 1, r = 2000000;
while (l < r)
{
int mid = (l + r) / 2;
int in = 0;
for (int i = 0; i < n; i++)
{
if (in != m)
if (arr[in].first < i - d)
goto A;
int ct = 0;
while (ct < mid && in < m)
{
if (arr[in].first <= i)
{
ct++;
in++;
}
else
break;
}
}
if (in == m)
{
r = mid;
continue;
}
A:;
l = mid + 1;
}
cout << l << "\n";
int in2 = 0;
for (int i = 0; i < n; i++)
{
int ct = 0;
while (ct < l && in2 < m)
{
if (arr[in2].first <= i)
{
cout << arr[in2].second + 1 << ' ';
ct++;
in2++;
}
else
break;
}
cout << "0\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |