# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744016 | riodsa | Job Scheduling (CEOI12_jobs) | C++17 | 287 ms | 28192 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 ll unsigned long long
const int N = 1e5+1;
ll n,d,m;
struct job
{
ll dline,give,idx;
bool operator <(const job &x)const{
if(give != x.give) give < x.give;
return dline < x.dline;
}
};
ll ans;
vector<job> vec;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> d >> m;
for(int i=1;i<=m;++i)
{
ll x;
cin >> x;
vec.push_back({x+d,x,i});
}
sort(vec.begin(),vec.end());
// while(!pq.empty())
// {
// cout << pq.top().dline << " " << pq.top().idx << '\n';
// pq.pop();
// }
ll l = 1,r = 1e9+7;
while(l<=r)
{
ll mid=(l+r)/2;
ll day=1,cb = 0;
bool can = true;
// cout << "mid = " << mid << '\n';
for(int i=0;i<m;++i)
{
ll num = day;
// cout << "day : " << num << " this job death line : " << vec[i].dline << '\n';
if(day > vec[i].dline)
{
can = false;
break;
}
++cb;
if(cb == mid)
{
++day;
cb = 0;
}
}
if(can)
{
ans = mid;
r = mid-1;
}
else l = mid+1;
// cout << "\n\n";
}
cout << ans << '\n';
ll cnt = 0;
for(int i=0;i<m;++i)
{
if(vec[i].dline != 0) cout << vec[i].idx << " ";
if((i+1)%ans == 0)
{
cout << "0\n";
++cnt;
}
}
while(cnt < n)
{
cout << "0\n";
cnt++;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |