# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97642 | dalgerok | Job Scheduling (CEOI12_jobs) | C++14 | 1072 ms | 17124 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;
const int N = 1e5 + 5;
int n, d, m, a[10 * N], ans[10 * N];
vector < int > q[N], s[N];
inline bool check(int x){
queue < int > e;
for(int i = 1; i <= n; i++){
for(auto it : q[i]){
e.push(it);
}
for(int j = 1; j <= x && !e.empty(); j++){
if(a[e.front()] + d < i){
return false;
}
ans[e.front()] = i;
e.pop();
}
}
return e.empty();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |