# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113329 | Kastanda | Job Scheduling (CEOI12_jobs) | C++11 | 257 ms | 20216 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 N = 100005;
int n, d, q, qu[N * 10];
vector < int > A[N];
inline bool Solve(int md, bool fnl = 0)
{
if (fnl)
printf("%d\n", md);
int l = 0, r = 0;
for (int i = 1; i <= n; i++)
{
if (r - l && qu[l] < i - d)
return 0;
for (int id : A[i])
qu[r ++] = id;
for (int j = 0; j < md && l < r; j++)
{
if (fnl)
printf("%d ", qu[l]);
l ++;
}
if (fnl)
printf("0\n");
}
return 1;
}
int main()
{
scanf("%d%d%d", &n, &d, &q);
for (int i = 1, a; i <= q; i++)
scanf("%d", &a), A[a].push_back(i);
int le = -1, ri = q, md;
while (ri - le > 1)
{
md = (le + ri) >> 1;
if (Solve(md))
ri = md;
else
le = md;
}
Solve(ri, 1);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |