# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706268 | ToroTN | Job Scheduling (CEOI12_jobs) | C++14 | 980 ms | 15240 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 X first
#define Y second
#define pb push_back
int n,d,m,job[100005],num,st,md,ed,type,flag;
priority_queue<int> pq;
priority_queue<pair<int,int> >pq2;
vector<int> v[100005];
int main()
{
scanf("%d%d%d",&n,&d,&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&num),++job[num];
v[num].pb(i);
}
st=1;
ed=1000000000;
while(ed>=st)
{
md=(st+ed)/2;
//printf("%d %d %d\n",st,md,ed);
type=0;
while(!pq.empty())pq.pop();
for(int i=1;i<=n;i++)
{
for(int j=0;j<job[i];j++)pq.push(-i);
if(pq.size()!=0)
{
if(i>=-pq.top()+d)
{
type=-1;
}
flag=min((int)pq.size(),md);
for(int j=1;j<=flag;j++)pq.pop();
}
}
if(pq.size()>0)type=-1;
if(type==0)
{
ed=md-1;
}else
{
st=md+1;
}
}
while(!pq.empty())
{
pq.pop();
}
printf("%d\n",st);
for(int i=1;i<=n;i++)
{
for(int j=0;j<v[i].size();j++)
{
pq2.push({-i,v[i][j]});
}
if(pq2.size()!=0)
{
flag=min((int)pq2.size(),st);
for(int j=1;j<=flag;j++)
{
printf("%d ",pq2.top().Y);
pq2.pop();
}
}
printf("0\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |