Submission #726784

#	Time	Username	Problem	Language	Result	Execution time	Memory
726784		penguin133	Job Scheduling (CEOI12_jobs)	C++17	0 / 100	90 ms	15136 KiB

jobs

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

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, d, m;
pi A[1000005];

void solve(){
	cin >> n >> d >> m;
	for(int i=1;i<=m;i++)cin >> A[i].fi, A[i].se = i;
	sort(A+1, A+n+1);
	int lo = 0, hi = m, ans = m;
	while(lo <= hi){
		int mid = (lo + hi) >> 1;
		int in = 1;
		deque <int> dq;
		bool f = 1;
		for(int i=1;i<=n;i++){
			while(in <= m && A[in].fi == i)dq.push_back(A[in++].fi);
			for(int j=1;j<=mid;j++){
				if(dq.empty())break;
				dq.pop_front();
			}
			if(!dq.empty() && dq.front() + d >= i)f = 0;
		}
		if(f)ans = mid, hi = mid - 1;
		else lo = mid + 1;
	}
	cout << ans << '\n';
	int in = 1;
	deque <int> dq;
	for(int i=1;i<=n;i++){
		while(in <= m && A[in].fi == i)dq.push_back(A[in++].se);
		for(int j=1;j<=ans;j++){
			if(dq.empty())break;
			cout << dq.front() << ' ';
			dq.pop_front();
		}
		cout << "0\n";
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

jobs.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main(){
      | ^~~~

• Subtask 1: 0 / 100