# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722262 | Hectorungo_18 | Job Scheduling (CEOI12_jobs) | C++14 | 177 ms | 10616 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 <algorithm>
#include <iostream>
#include <map>
#include<queue>
#include<set>
#include <vector>
using namespace std;
// #define int long long int
#define vvi vector<vector<int>>
#define vi vector<int>
#define s second
#define f first
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, d, me;
cin >> n >> d >> me;
vector<pair<int, int>> v(me);
for(int i = 0; i < me; i++){
cin >> v[i].f;
v[i].s = i+1;
}
int l = 0, r = me;
sort(v.begin(), v.end());
int ans = r;
while(l < r){
int m = (l+r+1)/2;
int cur = 1, sol = 0, aux = 0;
bool p = 1;
for(int i = 0; i < me; i++){
aux++;
if(v[i].f+d < cur) p = 0;
if(aux == m){
aux = 0;
cur++;
}
// cout << v[i].f << " " << d << " " << cur << endl;
if(!p) break;
}
if(p){
sol=m;
ans = m;
r = m-1;
}
else l = m;
// if(p) ans = min(ans, sol);
// cout << l << " " << m << endl;
cout << endl;
}
cout << ans << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |