# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898814 | hadi7 | Job Scheduling (CEOI12_jobs) | C++17 | 394 ms | 24660 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>
#define FAST ios::sync_with_stdio(0); cin.tie(0)
#define f first
#define s second
using namespace std ;
const int N = 2e6 ;
main()
{
int n , k , m ;
cin >> n >> k >> m ;
vector <pair <int , int>> p(m) ;
vector <int> mp(N) ;
for(int i = 0 ; i < m ; i++)
{
cin >> p[i].f ;
p[i].s = i + 1 ;
mp[p[i].f]++ ;
}
sort(p.begin() , p.end()) ;
int mx = *max_element(mp.begin() , mp.end()) ;
int l = 0 , r = 1e18 ;
while(l + 1 < r)
{
int h = l + (r - l) / 2 ;
if(ceil((double)mx / h) <= k && ceil((double)m / h) <= n)
r = h ;
else
l = h ;
}
cout << r << endl ;
int z = 0 ;
for(int i = 0 ; i < m ;)
{
for(int j = 0 ; j < r && i < m ; j++ , i++)
{
cout << p[i].s << " " ;
}
cout << 0 << endl ;
z++ ;
}
for(; z < n ; z++)
cout << 0 << endl ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |