# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550614 | epifor | Job Scheduling (CEOI12_jobs) | C++14 | 480 ms | 20840 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 ll long long
ll n,d,m;
ll maks = 0;
vector<pair<ll,ll>> v;
bool fjk(int k){
int dan = 1,cntr = 0;
for(int i = 0;i<m;i++){
if(cntr==k){
cntr=0;
dan++;
}
if(v[i].first>dan){
dan++;
i=i-1;
continue;
}
if(dan>v[i].first+d){
return false;
}
cntr++;
}
return true;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |