Coffee Break 二分

Coffee Break 二分

Time limit：1000 ms Memory limit：262144 kB Source: Codeforces Round #509 (Div. 2) Tags： binary search data structures greedy two pointers *1500 Editorial： Announcement #1 (en) Announcement #2 (ru) Tutorial #1 (en) Tutorial #2 (ru) Tutorial #3 (en) Tutorial #4 (ru)

描述

Recently Monocarp got a job. His working day lasts exactly m minutes. During work, Monocarp wants to drink coffee at certain moments: there are n minutes a1,a2,…,an, when he is able and willing to take a coffee break (for the sake of simplicity let’s consider that each coffee break lasts exactly one minute).

However, Monocarp’s boss doesn’t like when Monocarp takes his coffee breaks too often. So for the given coffee break that is going to be on minute ai, Monocarp must choose the day in which he will drink coffee during the said minute, so that every day at least d minutes pass between any two coffee breaks. Monocarp also wants to take these n coffee breaks in a minimum possible number of working days (he doesn’t count days when he is not at work, and he doesn’t take coffee breaks on such days). Take into account that more than d minutes pass between the end of any working day and the start of the following working day.

For each of the n given minutes determine the day, during which Monocarp should take a coffee break in this minute. You have to minimize the number of days spent.

输入

The first line contains three integers n, m, d (1≤n≤2⋅105,n≤m≤109,1≤d≤m) — the number of coffee breaks Monocarp wants to have, the length of each working day, and the minimum number of minutes between any two consecutive coffee breaks.

The second line contains n distinct integers a1,a2,…,an (1≤ai≤m), where ai is some minute when Monocarp wants to have a coffee break.

输出

In the first line, write the minimum number of days required to make a coffee break in each of the n given minutes.

In the second line, print n space separated integers. The i-th of integers should be the index of the day during which Monocarp should have a coffee break at minute ai. Days are numbered from 1. If there are multiple optimal solutions, you may print any of them.

Input

4 5 3
3 5 1 2

Output

3
3 1 1 2

Input

10 10 1
10 5 7 4 6 3 2 1 9 8

Output

2
2 1 1 2 2 1 2 1 1 2

提示

In the first example, Monocarp can take two coffee breaks during the first day (during minutes 1 and 5, 3 minutes will pass between these breaks). One break during the second day (at minute 2), and one break during the third day (at minute 3).

In the second example, Monocarp can determine the day of the break as follows: if the minute when he wants to take a break is odd, then this break is on the first day, if it is even, then this break is on the second day.

代码

#include 
using namespace std;

const int MAX_N = 200005;
int n, mm, d, x, cnt = 1;
map<int, int> m;
vector<int> a, b;
priority_queue<int, vector<int>, greater<int>> q;
int main() {
	scanf("%d%d%d", &n, &mm, &d);
	for (int i = 0; i < n; i++) {
		scanf("%d", &x);
		a.push_back(x);
		b.push_back(x);
	}
	sort(a.begin(), a.end());
	m[a[0]] = 1;
	q.push(0);
	for (int i = 1; i < n; i++) {
		int ii = q.top();
		if (a[i] - a[ii] > d) {
			m[a[i]] = m[a[ii]];
			q.pop();
		}
		else {
			cnt++;
			m[a[i]] = cnt;
		}
		q.push(i);
	}
	cout << cnt << endl;
	for (int i = 0; i < n; i++)
		printf("%d ", m[b[i]]);
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~