제출 #375268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375268		YJU	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	310 ms	65536 KiB

jobs

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef int ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=1e6+5;
const ll MOD=1e9+7;
const ld pi=acos(-1);
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,st[N],d,m;
vector<ll> done[N],upd[N];
queue<ll> que;

bool ck(ll k){
	while(SZ(que))que.pop();
	REP1(i,n){
		done[i].clear();
		for(ll j:upd[i])que.push(j);
		REP(j,k){
			if(!SZ(que))break;
			done[i].pb(que.front());
			que.pop();
		}
		if(SZ(que)&&st[que.front()]+d<=i)return 0;
	}
	return 1;
}

void out(ll id){
	for(auto i:done[id])cout<<i<<" ";
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>d>>m;
	REP1(i,m){
        cin>>st[i];
        upd[st[i]].pb(i);
	}
	ll r=m,l=-1;
	while(l<r-1){
		ll mid=(l+r)>>1;
		if(ck(mid)){
			r=mid;
		}else{
			l=mid;
		}
	}
	cout<<r<<"\n";
	REP1(i,n){
		for(auto j:done[i])cout<<j<<" ";
		cout<<"0\n";
	}
	return 0;
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4


*/

• Subtask 1: 0 / 100