Submission #1868567

---

Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>			

#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = (int)1e6 + 123;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;

void megaRandom() {
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  srand(FOR);
}

int n, c, k;
int t[N];

int main() {
	megaRandom();
	cin >> n >> c >> k;
	for(int i = 1; i <= n; i++) {
		cin >> t[i];
	}
	sort(t + 1, t + n + 1);
	for(int i = 1; i <= n; i ++)
		cout << t[i] << ' ';
	cout << "\n";
	int cnt = 0;
	for(int i = 1; i <= n; i ++) {
		int l = i, r = n;
		while(r - l > 1) {
			int mid = (l + r) >> 1;
			if(t[mid] - t[i] <= k && mid - i + 1 <= c) {
				l = mid;
			} else r = mid;
		}
		if(t[r] - t[i] <= k && r - i + 1 <= c) 
			l = r;
		//cout << "i: " << i << " l: " << l << "\n";
		cnt ++, i = l;
	
	}
	//cout << cnt << "\n";
	int cnt_1 = 0;
	for(int i = n; i >= 1; i --) {
		int l = 1, r = i;
		while(r - l > 1) {
			int mid = (l + r) >> 1;
			if(t[i] - t[mid] <= k && i - mid + 1 <= c) {
				r = mid;
			} else l = mid;
		}
		if(t[i] - t[l] <= k && i - l + 1 <= c) 
			r = l;
		cnt_1 ++, i = r;			
	}
	cout << min(cnt, cnt_1);
	return 0;         
}

Submission Info

Judge Result