# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860648 | agawron | Job Scheduling (CEOI12_jobs) | C++14 | 195 ms | 19488 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<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int MAX_M = 1e6 + 5;
const int MAX_N = 1e5 + 5;
int n, d, m;
pair <int, int> a[MAX_M];
vector <int> ans[MAX_N];
bool check(int x){
int r = 1;
for(int i = 1; i <= n; i++){
int l = r;
while(a[r].first <= i && r - l < x){
if(a[r].first + d < i && r <= n){
// cout << "a r d i " << a[r] << ' ' << d << ' ' << i << '\n';
return 0;
}
else r++;
}
// cout << "---" << '\n';
// cout << "x r l " << x << ' ' << r << ' ' << l << '\n';
}
return r >= n;
}
int main(){
scanf("%d %d %d", &n, &d, &m);
for(int i = 1; i <= m; i++){
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a + m + 1);
// cout << "---" << '\n';
//
// for(int i = 1; i <= m; i++){
// printf("%d ", a[i].first);
// }
//
// cout << '\n' << "---" << '\n';
int lo = 1;
int hi = 5;
int mi;
while(lo < hi){
mi = (lo + hi)/2;
if(check(mi)) hi = mi;
else lo = mi + 1;
}
int r = 1;
for(int i = 1; i <= n; i++){
int l = r;
while(a[r].first <= i && r - l < lo && r <= m){
ans[i].push_back(a[r].second);
r++;
}
ans[i].push_back(0);
// cout << "---" << '\n';
// cout << "x r l " << x << ' ' << r << ' ' << l << '\n';
}
printf("%d\n", lo);
for(int i = 1; i <= n; i++){
for(int j = 0; j < ans[i].size(); j++){
printf("%d ", ans[i].at(j));
}
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |