# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172914 | Roman70 | Job Scheduling (CEOI12_jobs) | C++20 | 453 ms | 80624 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, d, m;
vector<int> submitDays[100000];
bool ok(int c) {
priority_queue<int, vector<int>, greater<int>> pq;
for (int day = 0; day < n; ++day) {
// Add all jobs submitted on this day to the priority queue
for (int job : submitDays[day]) {
int deadline = day + d;
pq.push(deadline);
}
// Process up to c jobs on this day
int processed = 0;
while (!pq.empty() && processed < c) {
int deadline = pq.top();
if (deadline < day) {
return false; // Can't process this job anymore
}
pq.pop();
processed++;
}
}
return pq.empty();
}
void printSchedule(int c) {
vector<queue<int>> dayJobs(n);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |