Submission #484523

#	Time	Username	Problem	Language	Result	Execution time	Memory
484523		1potato2potato	Job Scheduling (CEOI12_jobs)	C++17	100 / 100	397 ms	26352 KiB

jobs

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair


int n, d, m;

pair<bool, vector<vi>> feas(int k, const vector<pi> &jobs) {
	int jobnum = 0;
	vector<vi> ans(n);
	for (int i=1; i<=n; i++) {
		for (int j = 0; j < k; j++) {
			if (jobs[jobnum].f > i) break;

			if (jobs[jobnum].f + d >= i) {
				ans[i - 1].push_back(jobs[jobnum++].s);
			} else {
				// can't fit this job
				return mp(false, ans);
			}

			if (jobnum == m) {
				// finished all jobs
				return mp(true, ans);
			}
		}
	}
	return mp(false, ans);
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> d >> m;
	vector<pi> jobs(m);
	for (int i = 0; i < m; i++) {
		int day;
		cin >> day;
		jobs[i] = {day, i + 1};
	}
	sort(all(jobs));

	int lo = 1, hi = m;
	vector<vi> ret;
	while (lo < hi) {
		int mid = (lo + hi) / 2;
		pair<bool, vector<vi>> res = feas(mid, jobs);
		if(res.f) {
			hi = mid;
			ret = res.s;
		} else {
			lo = mid + 1;
		}
	}
	cout << lo << "\n";

	for (int i = 0; i < n; i++) {
		for (int &idx : ret[i]) {
			cout << idx << " ";
		}
		cout << 0 << "\n";
	}
}

• Subtask 1: 100 / 100