Submission #36687

# Submission time Handle Problem Language Result Execution time Memory
36687 2017-12-13T08:19:03 Z RockyB Job Scheduling (CEOI12_jobs) C++11
0 / 100
673 ms 22588 KB
/// 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;
pair <int, int> a[N];
int cnt[(int)1e5 + 7];

bool check(int total) {
	memset(cnt, 0, sizeof(cnt));
	for (int i = 1; i <= m; i++) {
		bool ok = 0;
		for (int j = a[i].f; j <= a[i].f + 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
	scanf ("%d%d%d", &n, &d, &m);
	for (int i = 1; i <= m; i++) {
		scanf ("%d", &a[i].f);
		a[i].s = i;
	}
	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;
	}
	{
		memset(cnt, 0, sizeof(cnt));
		vector < pair <int, int> > ans;
		for (int i = 1; i <= m; i++) {
			for (int j = a[i].f; j <= a[i].f + d; j++) {
				if (cnt[j] < res) {
					cnt[j]++;
					ans.pb({j, a[i].s});
					break;
				}
			}
		}
		printf ("%d\n", res);
		/*sort(all(ans));
		int ptr = 0;
		for (int i = 1; i <= n; i++) {
			while (ptr < sz(ans) && ans[ptr].f < i) ptr++;
			while (ptr < sz(ans) && ans[ptr].f == i) {
				printf ("%d ", ans[ptr++].s);
			}
			printf ("0\n");
		}*/
	}
	ioi
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:57:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d%d%d", &n, &d, &m);
                              ^
jobs.cpp:59:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d", &a[i].f);
                        ^
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 11836 KB Unexpected end of file - int32 expected
2 Incorrect 23 ms 11836 KB Unexpected end of file - int32 expected
3 Incorrect 19 ms 11836 KB Unexpected end of file - int32 expected
4 Incorrect 33 ms 11836 KB Unexpected end of file - int32 expected
5 Incorrect 19 ms 11836 KB Unexpected end of file - int32 expected
6 Incorrect 16 ms 11836 KB Unexpected end of file - int32 expected
7 Incorrect 19 ms 11836 KB Unexpected end of file - int32 expected
8 Incorrect 16 ms 11836 KB Unexpected end of file - int32 expected
9 Incorrect 29 ms 11836 KB Unexpected end of file - int32 expected
10 Incorrect 33 ms 11836 KB Unexpected end of file - int32 expected
11 Incorrect 39 ms 11836 KB Unexpected end of file - int32 expected
12 Incorrect 106 ms 13372 KB Unexpected end of file - int32 expected
13 Incorrect 89 ms 16444 KB Unexpected end of file - int32 expected
14 Incorrect 673 ms 16444 KB Unexpected end of file - int32 expected
15 Incorrect 179 ms 16444 KB Unexpected end of file - int32 expected
16 Incorrect 213 ms 22588 KB Unexpected end of file - int32 expected
17 Incorrect 266 ms 22588 KB Unexpected end of file - int32 expected
18 Incorrect 276 ms 22588 KB Unexpected end of file - int32 expected
19 Incorrect 296 ms 22588 KB Unexpected end of file - int32 expected
20 Incorrect 289 ms 22588 KB Unexpected end of file - int32 expected