# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260327 | georgerapeanu | Job Scheduling (CEOI12_jobs) | C++11 | 371 ms | 17360 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int m,n,d;
vector<pair<int,int>> request;
bool ok(int cnt,bool afis){
if(afis){
printf("%d\n",cnt);
}
int fst = 0;
for(int i = 1;i <= n;i++){
if(fst < (int)request.size() && i - request[fst].first > d){
return false;
}
int tmp = cnt;
while(fst < (int)request.size() && request[fst].first <= i && tmp > 0){
if(afis){
printf("%d ",request[fst].second);
}
tmp--;
fst++;
}
if(afis){
printf("0\n");
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |