# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469639 | goatgm03 | Job Scheduling (CEOI12_jobs) | C++17 | 1100 ms | 3788 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 pb push_back
#define v vector
#define all(x) x.begin(),x.end()
int main(){
int n,d,m;
cin>>n>>d>>m;
v<int>t(m);
for(int i=0;i<m;i++)
cin>>t[i];
sort(all(t));
int lo=1,hi=n,sol=n;
while(lo<hi){
int mid=(hi-lo)/2,cnt=0;
int day=1,cur=0;
for(int i=0;i<m;i++){
if(t[i]<=day&&day<=t[i]+d){
cnt++;
cur++;
}
if(cur==mid){
cur=0;
day++;
}
}
if(cnt<n){
lo=mid;
}
else{
hi=mid-1;
sol=min(sol,mid);
}
}
int mid=(hi-lo)/2,cnt=0;
int day=1,cur=0;
v<v<int> >each_day(n+1);
v<int>cur_day;
for(int i=0;i<m;i++){
if(t[i]<=day&&day<=t[i]+d){
cnt++;
cur++;
each_day[day].pb(t[i]);
}
if(cur==sol){
cur=0;
day++;
}
}
cout<<sol<<endl;
for(int i=1;i<=n;i++){
if(!each_day[i].size()){
cout<<"0\n";
continue;
}
for(int j:each_day[i]){
cout<<j<<' ';
}
cout<<"0\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |