| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 429502 | joshualiu555 | Job Scheduling (CEOI12_jobs) | C++14 | 307 ms | 13756 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 <fstream>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <climits>
using namespace std;
using ll = long long;
const int INF = 2e5 + 5;
int n, d, m;
vector<pair<int, int>> a;
bool ok (int machines) {
int current_day = 1;
int num_machines = 0;
int current_job = 0;
while (current_job < m) {
if (a[current_job].first > current_day) {
current_day++;
num_machines = 0;
continue;
}
if (current_day - a[current_job].first > d) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||