# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
678398 | Toxtaq | Job Scheduling (CEOI12_jobs) | C++17 | 166 ms | 4688 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;
int main()
{
int n, d, m;
cin >> n >> d >> m;
vector<int>v(m);
for(int i = 0;i < m;++i)cin >> v[i];
int l = 1, r = m, ans = m;
while(r >= l){
int mid = l + (r - l)/ 2;
if((m + mid - 1)/ mid <= n){r = mid - 1;ans = min(ans, mid);}
else l = mid + 1;
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |