제출 #498130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498130		LouayFarah	Job Scheduling (CEOI12_jobs)	C++14	70 / 100	602 ms	65536 KiB

jobs

#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const long long MOD = 1e9+7;
const long long INF = 1e18;

int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};

vector<ll> RES;
vector<ll> temp;
vector<pair<ll, ll>> arr;
queue<pair<ll, ll>> qq;

bool f(queue<pair<ll, ll>> &q, ll d, ll mid, ll n)
{
    temp.clear();
    qq = q;
    ll currd = 1;
    ll c = mid;
    while(!q.empty())
    {
        if(c==0)
        {
            currd++;
            c = mid;
        }

        ll task = q.front().fi;
        ll id = q.front().se;
        if(currd<task)
        {
            currd = task;
            c = mid;
        }

        if(currd>task+d)
        {
            q = qq;
            return false;
        }
        q.pop();
        c--;

        temp.pb(id);
    }

    RES = temp;
    q = qq;
    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    ll n, d, m;
    cin >> n >> d >> m;

    for(int i = 0; i<m; i++)
    {
        ll x;
        cin >> x;
        arr.pb(mp(x, i+1));
    }

    sort(arr.begin(), arr.end());

    //vector<ll> occ(n+1, 0);
    queue<pair<ll, ll>> q;
    for(int i = 0; i<m; i++)
    {
        //occ[arr[i].fi]++;
        q.push(arr[i]);
    }


    /*ll lim = 0;
    for(int i = 0; i<=n; i++)
    {
        lim = max(lim, occ[i]);
    }*/

    ll l = 0; //l is bad
    ll r = m+1; //r is good

    while(l+1<r)
    {
        ll mid = (l+r)/2;

        if(f(q, d, mid, n))
        {
            r = mid;
        }
        else
        {
            l = mid;
        }
    }

    cout << r << endl;

    ll curr = 0;
    for(int i = 0; i<n; i++)
    {
        ll li = 0;
        while(curr<m)
        {
            if(li==r)
                break;
            cout << RES[curr] << ' ';
            li++;
            curr++;
        }
        cout << 0 << endl;
    }
    return 0;
}

• Subtask 1: 70 / 100