Submission #453041

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
453041	2021-08-04T07:42:08 Z	Khizri	Job Scheduling (CEOI12_jobs)	C++17	10 / 100	150 ms	3924 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;
int t=1,n,d,m,arr[mxn];
bool check(int k){
	int x=1,say=0;
	for(int i=1;i<=m;i++){
		if(arr[i]>x){
			x=arr[i];
			say=1;
		}
		else{
			say++;
			if(x-arr[i]>k){
				return false;
			}
		}
		if(say==k){
			say=0;
			x++;
		}
	}
	return true;
}
void solve(){
	cin>>n>>d>>m;
	for(int i=1;i<=m;i++){
		cin>>arr[i];
	}
	sort(arr+1,arr+m+1);
	int l=1,r=n,ans=1;
	while(l<=r){
		int m=(l+r)/2;
		if(check(m)){
			r=m-1;
			ans=m;
		}
		else{
			l=m+1;
		}
	}
	cout<<ans<<endl;
	for(int i=1;i<=n;i++){
		cout<<0<<endl;
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1

10.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	11 ms	716 KB	Output isn't correct
2	Incorrect	11 ms	716 KB	Output isn't correct
3	Incorrect	11 ms	716 KB	Output isn't correct
4	Incorrect	13 ms	724 KB	Output isn't correct
5	Incorrect	11 ms	716 KB	Output isn't correct
6	Incorrect	11 ms	724 KB	Output isn't correct
7	Incorrect	12 ms	676 KB	Output isn't correct
8	Incorrect	12 ms	716 KB	Output isn't correct
9	Incorrect	21 ms	844 KB	Output isn't correct
10	Incorrect	21 ms	860 KB	Output isn't correct
11	Incorrect	16 ms	696 KB	Output isn't correct
12	Incorrect	31 ms	1092 KB	Output isn't correct
13	Incorrect	44 ms	1360 KB	Output isn't correct
14	Incorrect	70 ms	1868 KB	Output isn't correct
15	Incorrect	76 ms	2268 KB	Output isn't correct
16	Incorrect	112 ms	2668 KB	Output isn't correct
17	Correct	133 ms	3000 KB	Output is correct
18	Incorrect	121 ms	3396 KB	Output isn't correct
19	Incorrect	150 ms	3924 KB	Output isn't correct
20	Correct	124 ms	3016 KB	Output is correct