Submission #978367

#	Time	Username	Problem	Language	Result	Execution time	Memory
978367		batsukh2006	Job Scheduling (CEOI12_jobs)	C++17	35 / 100	186 ms	24264 KiB

jobs

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'		
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n,d,m; cin>>n>>d>>m;
    vector<pair<int,int> > a(m+1);
    for(int i=1; i<=m; i++) cin>>a[i].ff,a[i].ss=i;
    sort(a.begin(),a.end());
    int l=1,r=m;
    while(l<=r){
    	int mid=l+(r-l)/2;
    	bool ok=1;
    	for(int i=mid,j=1; i<=m; i+=min(mid,m-i),j++){
    		if(j>a[i].ff+d) ok=0;
    		if(i==m) break;
    	}
    	if(ok) r=mid-1;
    	else l=mid+1;
    }
    cout<<l<<endl;
    for(int i=1,j=1; i<=n; i++){
    	while(j<=m){
    		cout<<a[j].ss<<' ';
    		if(j++%l==0) break;
    	}
    	cout<<0<<endl;
    }
    return 0;
}

• Subtask 1: 35 / 100