# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168322 | ffeyyae | Job Scheduling (CEOI12_jobs) | C++20 | 82 ms | 13380 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n, m, d;
vector<int> keep[N];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> d >> m;
for( int i=1;i<=m;i++ )
{
int a; cin >> a;
keep[a].push_back( i );
}
int l = 0, r = n-d;
while( l<r )
{
int mid = (l+r)/2;
int temp = 0, cnt = 1;
for( int i=1;i<=n-d;i++ )
{
for( auto x : keep[i] )
{
if( temp+1 > mid )
{
temp = 0;
cnt++;
}
temp++;
if( cnt > i+d )
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |