# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012096 | ThommyDB | Job Scheduling (CEOI12_jobs) | C++17 | 639 ms | 33048 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<bits/stdc++.h>
using namespace std;
int n, d, m;
vector<int> requests;
map<int,vector<int>> days;
bool possible(int machines){
queue<int> q;
for(int i = 0; i < n; i++){
for(int job = 0; job < days[i].size(); job++){
q.push(d);
}
for(int j = 0; j < machines; j++){
if(q.empty())break;
if(q.front() < 0)return false;
q.pop();
}
}
if(q.empty()){
return true;
}
return false;
}
signed main(){
cin >> n >> d >> m;
requests.resize(m);
for(int i = 0; i < m; i++){
cin >> requests[i];
requests[i]--;
days[requests[i]].push_back(i+1);
}
int machines = 0;
int l = 1, r = 1e6;
while(l < r){
machines = r-(r-l)/2;
//cout << l << "&&" << r << "&&" << machines << "\n";
if(possible(machines)){
r=machines-1;
}
else{
l=machines;
}
}
l++;
cout << l << "\n";
queue<pair<int, int>> q;
for(int i = 0; i < n; i++){
for(int job = 0; job < days[i].size(); job++){
q.push({d, days[i][job]});
}
for(int j = 0; j < l; j++){
if(q.empty())break;
cout << q.front().second << " ";
q.pop();
}
cout << "0\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |