| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 494019 | js921 | Job Scheduling (CEOI12_jobs) | C++14 | 402 ms | 13752 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 <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
using namespace std;
int N, D, M;
vector<pair<int,int>> jobs;
bool check_val(int a) {
int day_num = 1;
int counter = 0;
for(int i = 0; i < M; i++) {
if(jobs[i].first + D < day_num) {
return false;
} else {
counter++;
if(counter == a) {
counter = 0;
day_num++;
}
}
}
if(day_num-1 <= N) {
return true;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||