제출 #1199449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199449		orgiloogii	Job Scheduling (CEOI12_jobs)	C++20	0 / 100	1096 ms	7232 KiB

jobs

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); 
	int n, d, m;
	cin >> n >> d >> m;
	vector <pair <int, int>> reg(m + 1);
	for (int i = 1;i <= m;i++) {
		cin >> reg[i].first;
		reg[i].second = i;
	}
	sort(reg.begin(), reg.end());
	int l = 1, r = m;
	while (l + 1 < r) {
		int mid = (l + r) / 2;
		bool pos = true;
		int day = 1;
		for (int i = 1;i <= m;) {
			int cnt = mid;
			while (cnt && i <= m) {
				if (reg[i].first > day) break;
				if (reg[i].first + d < day) {
					pos = false;
					break;
				}
				i++;
				cnt--;
			}
			day++;
		}
		if (pos) {
			r = mid;
		}
		else {
			l = mid;
		}
	}
	cout << r << endl;
	bool pos = true;
	int day = 1;
	int p = 1;
	for (int i = 1;i <= m;) {
		int cnt = r;
		while (cnt && i <= m) {
			if (reg[i].first > day) break;
			cout << reg[i].second << " ";
			i++;
			cnt--;
		}
		cout << 0 << endl;
		p++;
		day++;
	}
	for (;p <= n;p++) {
		cout << 0 << endl;
	}
	return 0;
}

• Subtask 1: 0 / 100