# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954028 | irmuun | Job Scheduling (CEOI12_jobs) | C++17 | 100 ms | 7472 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 ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,d,m;
cin>>n>>d>>m;
ll t[m+5];
for(ll i=1;i<=m;i++){
cin>>t[i];
}
sort(t+1,t+m+1);
ll l=1,r=m;
while(l<r){
ll mid=(l+r)/2;
bool ok=true;
ll j=1;
bool flag=true;
for(ll i=1;i<=n;i++){
ll cnt=mid;
while(j<=m){
if(cnt==0||t[j]>i){
break;
}
if(i<=t[j]+d){
cnt--;
j++;
}
else{
flag=false;
break;
}
}
}
if(j==m+1&&flag){
r=mid;
}
else{
l=mid+1;
}
}
cout<<l<<"\n";
for(ll i=1;i<=n;i++){
cout<<"0\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |