# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
726782 | penguin133 | Job Scheduling (CEOI12_jobs) | C++17 | 79 ms | 4340 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
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, d, m;
int A[500005];
void solve(){
cin >> n >> d >> m;
for(int i=1;i<=m;i++)cin >> A[i];
sort(A+1, A+m+1);
int lo = 0, hi = m, ans = m;
while(lo <= hi){
int mid = (lo + hi) >> 1;
int in = 1;
deque <int> dq;
bool f = 1;
for(int i=1;i<=n;i++){
while(in <= m && A[in] == i)dq.push_back(A[in++]);
for(int j=1;j<=mid;j++){
if(dq.empty())break;
dq.pop_front();
}
if(!dq.empty() && dq.front() + d >= i)f = 0;
}
if(f)ans = mid, hi = mid - 1;
else lo = mid + 1;
}
cout << ans;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |