# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102159 | thebes | Job Scheduling (CEOI12_jobs) | C++14 | 476 ms | 16760 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 MN = 1e5+5;
int N, D, M, i, x, lo, hi, src[10*MN];
vector<int> adj[MN];
queue<int> q;
bool check(int m){
while(q.size()) q.pop();
for(int i=1;i<=N;i++){
for(auto v : adj[i]) q.push(v);
int sz = min((int)q.size(), m);
while(sz--){
if(src[q.front()]+D<i) return 0;
q.pop();
}
}
return q.size()==0;
}
int main(){
for(scanf("%d%d%d",&N,&D,&M),i=1;i<=M;i++)
scanf("%d",&x), adj[x].push_back(i), src[i]=x;
lo = 1, hi = M;
while(lo<hi){
int m = lo+hi>>1;
if(check(m)) hi=m;
else lo=m+1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |