# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085652 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++17 | 191 ms | 31508 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;
long long n,d,m;
long long freq[100001];
vector<long long> v;
long long kec=1,nula=0;
bool moze(long long k)
{
long long rabota = nula;
for (long long i=0;i<=n;i++)
{
rabota += freq[i];
long long koga_gotovo = rabota/k;
if (rabota%k>0) koga_gotovo++;
if (koga_gotovo>d+1) return false;
if (rabota<k) rabota=nula;
else rabota-=k;
}
if (rabota>nula) return false;
return true;
}
long long bs(long long l,long long r)
{
if (l==r) return l;
long long mid = (l+r)/2;
if (moze(mid)) return bs(l,mid);
return bs(mid+1,r);
}
void pecati(long long k)
{
vector<pair<long long,long long> > t;
for (long long i=0;i<m;i++) t.push_back({v[i],i+1});
sort(t.begin(),t.end());
long long p=0;
for (long long i=1;i<=n;i++)
{
for (long long j=0;j<k;j++)
{
if (p==t.size() || t[p].first>i) break;
cout<<t[p].second<<" ";
p++;
}
cout<<0<<"\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>d>>m;
for (long long i=0;i<m;i++)
{
long long a;
cin>>a;
freq[a]++;
v.push_back(a);
}
long long odg = bs(kec,m);
cout<<odg<<"\n";
pecati(odg);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |