# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256316 | Molukhyyeh | Job Scheduling (CEOI12_jobs) | C++14 | 313 ms | 19576 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;
#define ll long long
#define all(x) x.begin(),x.end()
int const N = 200001, M = 1e6+1;
int n, d, m;
pair<int,int> v[M];
vector<int> pr[N];
bool ok(int md){
if(m / md > n)return false;
int av = md, day = 0, cur = 0;
for(int i = 0; i<m; ++i){
cur = day;
--av;
if(!av)av = md, ++day;
if(cur >= v[i].first+d)return false;
}
return true;
}
int main(){
scanf("%d%d%d", &n, &d, &m);
for(int i = 0; i<m; ++i){
scanf("%d", &v[i].first);
v[i].second = i+1;
}
sort(v, v+m);
int l = m/n+(m%n? 1: 0), r = M, md, an = m;
while(l <= r){
md = l + r >> 1;
if(ok(md))r = md-1, an = md;
else l = md+1;
}
printf("%d\n", an);
int day = 0, av = an, ls = 0;
for(int i = 0; i<m; ++i){
printf("%d ", v[i].second);
--av;
if(!av)av = md, printf("0\n"), ++day;
}
for(int i = 0; i<n-day; ++i)puts("0");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |