Submission #36677

#	Time	Username	Problem	Language	Result	Execution time	Memory
36677		RockyB	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	23 ms	9992 KiB

jobs

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e6 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, d, m;
int a[N];
int cnt[N];

bool check(int total) {
	memset(cnt, 0, sizeof(cnt));
	for (int i = 1; i <= n; i++) {
		bool ok = 0;
		for (int j = a[i]; j <= a[i] + d; j++) {
			if (cnt[j] < total) {
				cnt[j]++;
				ok = 1;
				break;
			}
		}
		if (!ok) return 0;
	}
	return 1;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> d >> m;
	if (m > 100000) assert(0);
	for (int i = 1; i <= m; i++) {
		cin >> a[i];
		assert(a[i] + d <= n);
	}
	sort (a + 1, a + 1 + m);
	int l = 1, r = m, res = m;
	while (l <= r) {
		int mid = l + r >> 1;
		if (check(mid)) res = mid, r = mid - 1;
		else l = mid + 1;
	}
	cout << res;
	ioi
}

Compilation message (stderr)

jobs.cpp: In function 'int main()':
jobs.cpp:67:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
               ^

• Subtask 1: 0 / 100