# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732180 | LKR__enjoyer | Job Scheduling (CEOI12_jobs) | C++17 | 476 ms | 17576 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<vector>
#include <iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<bitset>
#include<set>
#include<cstdlib>
#define f first
#define sec second
#define pb push_back
typedef long long ll;
using namespace std;
int n,d,m;
vector<pair<int,int>> arr;
int zlicz[100001];
int zlicz2[100001];
bool spr(int x)
{ for(int i=1;i<=n-d;i++)zlicz2[i]=zlicz[i];
for(int i=1;i<=n-d;i++)
{
zlicz2[i]=max(0,zlicz2[i]-x);
zlicz2[i+1]+=zlicz2[i];
}
if(zlicz2[n-d])return 0; return 1;
}
int bin(int lo,int hi)
{
while(lo<hi)
{
int mid=lo+(hi-lo)/2;
if(spr(mid))hi=mid; else lo=mid+1;
}
return lo;
}
int main()
{
cin>>n>>d>>m;
for(int i=0;i<m;i++)
{int a; cin>>a; arr.pb({a,i+1}); zlicz[a]++;} sort(arr.begin(),arr.end());
int res=bin(1,m);
cout<<res<<endl;
int curr=0;
for(int i=1;i<=n-d;i++)
{int licz=0;
if(curr==m){cout<<'0'<<endl; continue;}
while(licz<res)
{licz++;
if(arr[curr].f<=i){cout<<arr[curr].sec<<' '; curr++;}
}
cout<<'0'<<endl;
}
for(int i=0;i<d;i++)cout<<'0'<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |