# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981537 | SmuggingSpun | Job Scheduling (CEOI12_jobs) | C++14 | 112 ms | 13652 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>
#define taskname "jobs"
using namespace std;
const int lim = 1e5 + 5;
vector<int>p[lim];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
int n, d, m;
cin >> n >> d >> m;
for(int i = 0; i < m; ){
int x;
cin >> x;
p[x].emplace_back(++i);
}
int low = 1, high = n, ans;
while(low <= high){
int mid = (low + high) >> 1;
deque<pair<int, int>>D;
for(int i = 1; i <= n; i++){
int current = mid;
if(!p[i].empty() > 0){
D.emplace_back(i, p[i].size());
}
if(!D.empty() && D.front().first + d < i){
break;
}
while(!D.empty()){
auto [x, y] = D.front();
D.pop_front();
if(current >= y){
current -= y;
}
else{
D.emplace_front(x, y - current);
break;
}
}
}
if(!D.empty()){
low = mid + 1;
}
else{
high = (ans = mid) - 1;
}
}
cout << ans << "\n";
queue<int>q;
for(int i = 1; i <= n; i++){
for(int& x : p[i]){
q.push(x);
}
for(int _ = 0; _ < ans && !q.empty(); _++, q.pop()){
cout << q.front() << " ";
}
cout << "0\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |