Submission #896274

#	Time	Username	Problem	Language	Result	Execution time	Memory
896274		akkshaysr	Job Scheduling (CEOI12_jobs)	C++17	100 / 100	191 ms	13904 KiB

jobs

#include <bits/stdc++.h>
#define fr first
#define se second
#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define repr(i,a,b) for(int i = a; i > (b); --i)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define IN(i,l,r) (l<i&&i<r)
#define pb push_back
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef long long ll;
const int U = 1e6+2;
int N,D,M;
pi job[U];

bool check(int m){
    int t=0;
    rep(day,1,N+1){
        rep(i,0,m){
            if(job[t].fr > day){
                break;
            }
            if(job[t].fr + D >= day){
                ++t;
            }else{
                return false;
            }
            if(t==M) return true;
        }
    }
    return false;
}

int main(){
    cin.tie(0)->sync_with_stdio(false);
    cin >> N >> D >> M;
    rep(i,0,M){
        cin >> job[i].fr;
        job[i].se = i+1;
    }
    sort(job,job+M);
    int lo=1,hi=M;
    vector<vi> s;
    while(lo < hi){
        ll m = (lo+hi)/2;
        if(check(m)) hi = m;
        else lo = m+1;
    }
    cout << hi << '\n';
    int t = 0;
    rep(day,1,N+1){
        rep(i,0,hi){
            if(job[t].fr > day or t==M){
                break;
            }
            if(job[t].fr + D >= day){
                cout << job[t].se << ' ';
                ++t;
            }
        }
        cout << "0\n";
    }
}

• Subtask 1: 100 / 100