# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831902 | Darren0724 | Job Scheduling (CEOI12_jobs) | C++17 | 242 ms | 12148 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;
#define int long long
#define x first
#define y second
const int mod=1e9+7;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,d,m;cin>>n>>d>>m;
vector<int> v[n+1];
for(int i=1;i<=m;i++){
int p;cin>>p;
v[p].push_back(i);
}
int l=0,r=m;
while(r-l>1){
queue<int> q;
int mi=(l+r)>>1;
bool flag=0;
for(int i=1;i<=n;i++){
for(int j=0;j<v[i].size();j++){
q.push(i);
}
for(int j=0;j<mi;j++){
if(q.size()==0){
break;
}
int p=q.front();
flag|=(i>p+d);
q.pop();
}
}
//cout<<mi<<(q.size()||flag)<<endl;
if(q.size()||flag){
l=mi;
}
else{
r=mi;
}
}
queue<int> q;
cout<<r<<endl;
for(int i=0;i<n;i++){
cout<<0<<endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |