oj.uz

답안 #375278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375278 2021-03-09T06:03:45 Z YJU Job Scheduling (CEOI12_jobs) C++14
100 / 100
 670 ms 20988 KB 
#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,ans[N],lis[N];
ll que[N];

bool ck(ll k){
	ll nl=0,nr=0;
	for(int i=1,id=1;i<=n;i++){
		while(id<=m&&st[lis[id]]==i)que[nr++]=(lis[id]),++id;
		REP(j,k){
			if(nr-nl==0)break;
			ans[que[nl++]]=i;
		}
		if(nr-nl&&st[que[nl]]+d<=i)return 0;
	}
	return 1;
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>d>>m;
	REP1(i,m){
        cin>>st[i];
        lis[i]=i;
	}
	sort(lis+1,lis+m+1,[&](ll a,ll b){
		return (st[a]<st[b]);
	});
	//REP1(i,m)cout<<lis[i]<<st[lis[i]]<<"\n";
	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";
	ck(r);

	sort(lis+1,lis+m+1,[&](ll a,ll b){
        return (ans[a]<ans[b]);
	});

	//REP1(i,m)cout<<lis[i]<<" "<<ans[lis[i]]<<"\n";

	for(int i=1,id=1;i<=n;i++){
		while(id<=m&&ans[lis[id]]==i)cout<<lis[id]<<" ",++id;
		cout<<"0\n";
	}
	return 0;
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4


*/

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 2668 KB Output is correct
2 Correct 32 ms 2540 KB Output is correct
3 Correct 34 ms 2540 KB Output is correct
4 Correct 38 ms 2540 KB Output is correct
5 Correct 41 ms 2540 KB Output is correct
6 Correct 39 ms 2540 KB Output is correct
7 Correct 38 ms 2540 KB Output is correct
8 Correct 32 ms 2540 KB Output is correct
9 Correct 43 ms 2796 KB Output is correct
10 Correct 41 ms 2796 KB Output is correct
11 Correct 42 ms 2540 KB Output is correct
12 Correct 104 ms 4844 KB Output is correct
13 Correct 145 ms 7148 KB Output is correct
14 Correct 206 ms 9324 KB Output is correct
15 Correct 282 ms 11628 KB Output is correct
16 Correct 397 ms 13932 KB Output is correct
17 Correct 482 ms 16108 KB Output is correct
18 Correct 651 ms 18540 KB Output is correct
19 Correct 670 ms 20988 KB Output is correct
20 Correct 483 ms 16260 KB Output is correct