| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 847337 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++11 | 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 <bits/stdc++.h>
using namespace std;
#define int long long
int n,d,m;
vector<int> a,index,tmp_v,ans_v;
bool is_ok(int machine)
{
// printf("machine=%d\n",machine);
tmp_v.clear();
bool x=false;
int i=0,cnt=1;
for(;cnt<=n;++cnt)
{
// printf("cnt=%d\n",cnt);
int _m=machine;
while(i<a.size()&&_m-->0) tmp_v.push_back(index[i++]);
if(i==a.size()) {x=true;break;}
tmp_v.push_back(0);
}
while(cnt++<=n) tmp_v.push_back(0);
return x;
}
main()
{
ios::sync_with_stdio(0),cin.tie(0);
cin>>n>>d>>m;
vector<pair<int,int>> tmp(m);
for(int i=0;i<m;++i) cin>>tmp[i].first,tmp[i].second=i+1;
sort(tmp.begin(),tmp.end());
for(auto it:tmp) a.push_back(it.first),index.push_back(it.second);
// for(auto it:a) cout<<it.num<<' '<<it.index<<'\n';
int l=0,r=m+1,ans=m+1;
while(l<=r)
{
int mid=(r-l)/2+l;
if(is_ok(mid)) ans_v=tmp_v,ans=mid,r=mid-1;
else l=mid+1;
}
cout<<ans<<'\n';
for(auto it:ans_v)
{
cout<<it<<' ';
if(it==0) cout<<'\n';
}
return 0;
}
/*
8 2 12
1 1 2 2 2 3 3 4 4 5 6 6
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
2
5 1 0
9 4 0
2 10 0
6 12 0
3 7 0
11 8 0
0
0
*/