Submission #642968

#	Time	Username	Problem	Language	Result	Execution time	Memory
642968		thinhcute	Job Scheduling (CEOI12_jobs)	C++17	0 / 100	156 ms	2040 KiB

jobs

//  ___  ___  ___  _______   ___  ___          ________  ___  ___  _________  _______           ___  ___  ________  ________   ________         
// |\  \|\  \|\  \|\  ___ \ |\  \|\  \        |\   ____\|\  \|\  \|\___   ___\\  ___ \         |\  \|\  \|\   __  \|\   ___  \|\   ____\        
// \ \  \\\  \ \  \ \   __/|\ \  \\\  \       \ \  \___|\ \  \\\  \|___ \  \_\ \ \  \ \        \ \  \\\  \ \  \|\  \ \  \\ \  \ \  \___|        
//  \ \   __  \ \  \ \  \_|/_\ \  \\\  \       \ \  \    \ \  \\\  \   \ \  \ \ \  \ \ \   |/__       \ \   __  \ \  \\\  \ \  \\ \  \ \  \  ___      
//   \ \  \ \  \ \  \ \  \_|\ \ \  \\\  \       \ \  \____\ \  \\\  \   \ \  \ \ \  \ \ \       \ \  \ \  \ \  \\\  \ \  \\ \  \ \  \|\  \     
//    \ \__\ \__\ \__\ \_______\ \_______\       \ \_______\ \_______\   \ \__\ \ \_______\       \ \__\ \__\ \_______\ \__\\ \__\ \_______\    
//     \|__|\|__|\|__|\|_______|\|_______|        \|_______|\|_______|    \|__|  \|_______|        \|__|\|__|\|_______|\|__| \|__|\|_______|

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

#define fi first
#define se second

#define MAX 100100

int n, d, m;
pair<int, int> a[MAX];

bool f(int mid)
{
	int i = 1, day;
	queue<pair<int, int>> q;

	while (i <= m) {
		day = a[i].fi;
		while (a[i].fi == day && i <= m) {
			q.push(a[i]);
			i++;
		}
		while ((int) q.size() && day <= a[i - 1].fi) {
			for (int k = 1; k <= mid; k++) {
				if (q.empty()) goto SKIP;
				if (abs(q.front().fi - day) > d) return false;
				q.pop();
			}
			day++;
		}

		SKIP:;
	}

	return day <= n && q.empty(); 
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	cin >> n >> d >> m;
	for (int i = 1; i <= m; i++) {
		cin >> a[i].fi;
		a[i].se = i;
	}

	sort(a + 1, a + m + 1);

	int l = 1, r = n, res = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (f(mid)) {
			res = mid;
			r = mid - 1;
		} else l = mid + 1;
	}

	cout << res << endl;
	
	int i = 1, day;
	queue<pair<int, int>> q;

	while (i <= m) {
		day = a[i].fi;
		while (a[i].fi == day && i <= m) {
			q.push(a[i]);
			i++;
		}
		while ((int) q.size() && day <= a[i - 1].fi) {
			for (int k = 1; k <= res; k++) {
				if (q.empty()) goto SKIP;
				cout << q.front().se << " ";
				q.pop();
			}
			day++;
			cout << 0 << endl;
		}
		SKIP:;
	}

	// cout << q.size() << endl;
	for (int i = 1; i <= n - day + 1; i++) cout << 0 << endl;

	return 0;
}

Compilation message (stderr)

jobs.cpp:2:1: warning: multi-line comment [-Wcomment]
    2 | // |\  \|\  \|\  \|\  ___ \ |\  \|\  \        |\   ____\|\  \|\  \|\___   ___\\  ___ \         |\  \|\  \|\   __  \|\   ___  \|\   ____\
      | ^
jobs.cpp:5:1: warning: multi-line comment [-Wcomment]
    5 | //   \ \  \ \  \ \  \ \  \_|\ \ \  \\\  \       \ \  \____\ \  \\\  \   \ \  \ \ \  \ \ \       \ \  \ \  \ \  \\\  \ \  \\ \  \ \  \|\  \
      | ^
jobs.cpp: In function 'bool f(int)':
jobs.cpp:44:18: warning: 'day' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |  return day <= n && q.empty();
      |         ~~~~~~~~~^~~~~~~~~~~~
jobs.cpp: In function 'int main()':
jobs.cpp:93:25: warning: 'day' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |  for (int i = 1; i <= n - day + 1; i++) cout << 0 << endl;
      |                       ~~^~~~~

• Subtask 1: 0 / 100