Submission #494019

#	Time	Username	Problem	Language	Result	Execution time	Memory
494019		js921	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	402 ms	13752 KiB

jobs

#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>

using namespace std;

int N, D, M;
vector<pair<int,int>> jobs;

bool check_val(int a) {
	int day_num = 1;
	int counter = 0;
	for(int i = 0; i < M; i++) {
		if(jobs[i].first + D < day_num) {
			return false;
		} else {
			counter++;
			if(counter == a) {
				counter = 0;
				day_num++;
			}
		}
	}
	if(day_num-1 <= N) {
		return true;
	}
	return false;
}

int first_true() {
	int lo = 0, hi = 20;
	while(lo < hi) {
		int mid = lo + (hi - lo)/2;
		if(check_val(mid) == true) {
			hi = mid;
		} else {
			lo = mid+1;
		}
	}
	return lo;
}

int main() {

	cin >> N >> D >> M;
	for(int i = 0; i < M; i++) {
		int x; cin >> x;
		jobs.push_back(make_pair(x, i));
		//cout << jobs[i].first << " " << jobs[i].second << endl;
	}
	sort(jobs.begin(), jobs.end());

	int y = first_true();
	cout << y << endl;

	int day_num = 1, counter = 0;
	for(int i = 0; i < M; i++) {
		cout << jobs[i].second+1 << " ";
		counter++;
		if(counter == y) {
			counter = 0;
			day_num++;
			cout << 0 << endl;
		}
	}

	/*for(int i = 0; i < M; i++) {
		cout << jobs[i].first << " " << jobs[i].second << endl;
	}*/

	return 0;
}

• Subtask 1: 0 / 100