Submission #453172

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
453172	2021-08-04T08:29:52 Z	Khizri	Job Scheduling (CEOI12_jobs)	C++17	100 / 100	372 ms	23184 KB

jobs

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,n,d,m;
vector<pll>arr;
vector<ll>vt[100005];
bool check(ll k){
	ll x=1,say=0;
	for(int i=0;i<arr.size();i++){
		if(arr[i].F>x){
			x=arr[i].F;
			say=1;
		}
		else{
			say++;
			if(x-arr[i].F>d){
				return false;
			}
		}
		if(say>=k){
			say=0;
			x++;
		}
	}
	return true;
}
void f(int k){
	ll say=0,ind=0;
	for(ll x=1;x<=n;x++){
		say=0;
		while(ind<m&&arr[ind].F<=x&&say<k){
			cout<<arr[ind].S<<' ';
			ind++;
			say++;
		}
		cout<<0<<endl;
	}
}
void solve(){
	cin>>n>>d>>m;
	for(int i=1;i<=m;i++){
		int q;
		cin>>q;
		arr.pb({q,i});
	}
	sort(all(arr));
	ll l=0,r=1e7,ans=10000000;
	while(l<=r){
		ll mm=(l+r)/2;
		if(check(mm)){
			r=mm-1;
			ans=min(ans,mm);
		}
		else{
			l=mm+1;
		}
	}
	cout<<ans<<endl;
	f(ans);
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

jobs.cpp: In function 'bool check(long long int)':
jobs.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0;i<arr.size();i++){
      |              ~^~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	4928 KB	Output is correct
2	Correct	30 ms	4956 KB	Output is correct
3	Correct	29 ms	4876 KB	Output is correct
4	Correct	28 ms	4928 KB	Output is correct
5	Correct	28 ms	4960 KB	Output is correct
6	Correct	33 ms	4900 KB	Output is correct
7	Correct	28 ms	4904 KB	Output is correct
8	Correct	28 ms	4884 KB	Output is correct
9	Correct	42 ms	5048 KB	Output is correct
10	Correct	43 ms	5136 KB	Output is correct
11	Correct	35 ms	4868 KB	Output is correct
12	Correct	70 ms	7216 KB	Output is correct
13	Correct	108 ms	10972 KB	Output is correct
14	Correct	151 ms	11708 KB	Output is correct
15	Correct	172 ms	13952 KB	Output is correct
16	Correct	233 ms	19108 KB	Output is correct
17	Correct	255 ms	19144 KB	Output is correct
18	Correct	292 ms	20744 KB	Output is correct
19	Correct	372 ms	23184 KB	Output is correct
20	Correct	254 ms	19200 KB	Output is correct