| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 476434 | horsefeedapples | Job Scheduling (CEOI12_jobs) | C++11 | 603 ms | 20268 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define f first
#define s second
const int MX = 1e5+5;
int n, d, m;
vector<pair<int,int>> v;
bool check(int machines){
int currDay = v[0].f;
vector<int> filled(MX, 0);
for(int i=0; i<m; i++){
currDay = max(currDay, v[i].f);
if(filled[currDay]>=machines) currDay++;
if(currDay-d>v[i].f) return false;
filled[currDay]++;
}
return true;
}
int firstTrue(int lo, int hi) {
hi++;
while (lo < hi) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||