#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
using pii = pair<ll , ll> ;
using i3 = tuple<ll , ll , ll> ;
const int N = 1e6+5 ;
const int MOD = 1e9+7 ;
ll n , d , m ;
pii S[N] ;
bool solve(ll mid){
ll day = 1 , cnt = 0 ;
for(int i=1;i<=m;i++){
if(day < S[i].first){
day = S[i].first ;
cnt = 0 ;
}
if(day <= S[i].first + d){ // do job i-th
cnt++ ;
}
else {
return false ;
}
if(cnt == mid){
day++;
cnt = 0 ;
}
}
if(cnt == 0) day--;
return day <= n ;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> d >> m ;
for(int i=1, x;i<=m;i++){
cin >> x ;
S[i] = {x , i};
}
sort(S+1 , S+m+1) ;
ll l = 1 , r = m , ans = 0 ;
while(l <= r){
ll mid = (l+r)/2 ;
if(solve(mid)){
r = mid-1 ;
ans = mid ;
}
else {
l = mid+1 ;
}
}
cout << ans << "\n" ;
for(int i=1;i<=n;i++){
cout << "0\n" ;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1876 KB |
Output is correct |
2 |
Correct |
11 ms |
1892 KB |
Output is correct |
3 |
Correct |
10 ms |
1892 KB |
Output is correct |
4 |
Correct |
10 ms |
1876 KB |
Output is correct |
5 |
Correct |
10 ms |
1812 KB |
Output is correct |
6 |
Correct |
10 ms |
1896 KB |
Output is correct |
7 |
Correct |
10 ms |
1876 KB |
Output is correct |
8 |
Correct |
10 ms |
1876 KB |
Output is correct |
9 |
Correct |
22 ms |
2024 KB |
Output is correct |
10 |
Correct |
19 ms |
2004 KB |
Output is correct |
11 |
Correct |
17 ms |
1896 KB |
Output is correct |
12 |
Correct |
36 ms |
3428 KB |
Output is correct |
13 |
Correct |
54 ms |
4948 KB |
Output is correct |
14 |
Correct |
82 ms |
6568 KB |
Output is correct |
15 |
Correct |
108 ms |
8024 KB |
Output is correct |
16 |
Correct |
119 ms |
9724 KB |
Output is correct |
17 |
Correct |
135 ms |
11168 KB |
Output is correct |
18 |
Correct |
164 ms |
12840 KB |
Output is correct |
19 |
Correct |
178 ms |
14520 KB |
Output is correct |
20 |
Correct |
142 ms |
11220 KB |
Output is correct |