제출 #680287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
680287		SriniV	Job Scheduling (CEOI12_jobs)	C++14	100 / 100	368 ms	17140 KiB

jobs

#include <bits/stdc++.h>

using namespace std;

int n , d , m;
vector<pair < int , int > > jobs;
bool valid(int machines){
	
	int day = 1;
	int count = 0;
	for(auto job : jobs){
		if(job.first>day){
			count = 0;
			day = job.first;	
		}
		if(count==machines){
			count = 0;
			day++;
		}
		if(day - job.first > d){
			return false;
		}
		count++;
	}
	return true;

}
int main(){
	cin >> n >> d >> m;
	jobs.resize(m);
	for(int i = 0;i<m;i++){
		cin >> jobs[i].first;
		jobs[i].second = i+1;
	}
	sort(jobs.begin() , jobs.end());
	int left = 1 , right = m;
	int answer = -1;
	while(left<=right){

		int middle = left + (right - left)/2;
		if(valid(middle)){
			answer = middle;
			right = middle - 1;
		} else {
			left = middle + 1;
		}
	}
	cout << answer<<"\n";
	int count = 0;
	for(int day = 1;day<=n;day++){
		for(int i = 0;i<answer;i++){
			if(jobs[count].first>day||count==m)break;
			cout << jobs[count++].second<<" ";
		}
		cout << 0 << "\n";
	}

}

• Subtask 1: 100 / 100