#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
jobs.cpp: In function 'int main()':
jobs.cpp:24:14: warning: unused variable 'ok' [-Wunused-variable]
24 | bool ok=true;
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1116 KB |
Output is correct |
2 |
Correct |
7 ms |
1112 KB |
Output is correct |
3 |
Correct |
7 ms |
1112 KB |
Output is correct |
4 |
Correct |
7 ms |
1368 KB |
Output is correct |
5 |
Correct |
7 ms |
1116 KB |
Output is correct |
6 |
Correct |
7 ms |
1232 KB |
Output is correct |
7 |
Correct |
7 ms |
1112 KB |
Output is correct |
8 |
Correct |
7 ms |
1116 KB |
Output is correct |
9 |
Correct |
12 ms |
1624 KB |
Output is correct |
10 |
Correct |
12 ms |
1372 KB |
Output is correct |
11 |
Correct |
12 ms |
1368 KB |
Output is correct |
12 |
Correct |
22 ms |
1884 KB |
Output is correct |
13 |
Correct |
37 ms |
2792 KB |
Output is correct |
14 |
Correct |
52 ms |
3560 KB |
Output is correct |
15 |
Correct |
54 ms |
4188 KB |
Output is correct |
16 |
Correct |
76 ms |
5136 KB |
Output is correct |
17 |
Correct |
100 ms |
5912 KB |
Output is correct |
18 |
Correct |
88 ms |
6688 KB |
Output is correct |
19 |
Correct |
96 ms |
7472 KB |
Output is correct |
20 |
Correct |
93 ms |
5972 KB |
Output is correct |