제출 #573090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
573090		updown1	Job Scheduling (CEOI12_jobs)	C++17	55 / 100	364 ms	24292 KiB

jobs

#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
ll n,d,m; 
vector<pair<ll,ll>> v;
 
bool ok(ll dd){
    ll day = 1;
    bool works=true;
    ll w = v.size()-1;
    while(w>=0){
        if(day>n){
            works=false;
            break;
        }
        for(ll i = 0; i < dd; i++){
            if(w<0){
                break;
            }
            if(v[w].first+d<day){
                works=false;
                break;
            }
            w--;
        }  
        if(!works){
            break;
        }
        day++;
    }
    return works;
}
 
int main(){
    cin >> n >> d >> m;
    
    
    for(ll i = 0; i < m; i++){
        ll x; cin >> x;
        v.push_back({x,i});
    }
    
    sort(v.rbegin(), v.rend());
    
    ll l = 1,r=m;
    
    while(l<r){
        ll mid = (l+r)/2;
        if(ok(mid)){
            r=mid;
        }
        else{
            l=mid+1;
        }
    }
  
    ok(l);
    
    ll counter =0 ;
    cout << l << "\n";
    while(!v.empty()){
        counter++;
        for(ll i = 0; i < l; i++){
            cout << v.back().second+1 << " ";
            v.pop_back();
            if(v.empty()){
                break;
            }
        }
        cout << "0\n";
    }
    
    for(ll i = 0; i < n-counter; i++){
        cout << 0 << "\n";
    }
}

• Subtask 1: 55 / 100