Submission #642591

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
6425912022-09-20 07:29:45accidentacJob Scheduling (CEOI12_jobs)C++17
100 / 100
375 ms23232 KiB
#include <bits/stdc++.h>
using namespace std;
int n, d, m;
vector<array<int, 2>> jobs;
// return true if can use count no. of machines to handle all jobs
bool ok(int count) {
queue<int> q;
for (int i = 1, j = 0; i <= n; i++) {
while (j < m && jobs[j][0] == i) {
q.push(j++);
}
if (q.size() && i - jobs[q.front()][0] > d) return false;
for (int rep = 0; rep < count && !q.empty(); rep++) {
q.pop();
}
}
return true;
}
vector<vector<int>> form(int count) {
vector<vector<int>> ans(n);
queue<int> q;
for (int i = 1, j = 0; i <= n; i++) {
vector<int> cur;
while (j < m && jobs[j][0] == i) {
q.push(j++);
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...