oj.uz

답안 #443834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443834 2021-07-12T07:59:16 Z Khizri 구경하기 (JOI13_watching) C++17
0 / 100
 1000 ms 332 KB 
#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=2e5+5;
ll t=1,n,arr[mxn],a,b;
int check(int x,int y,ll dis,int ind,int pos){
	int nind=ind;
	if(pos==1){
		ll k=arr[ind]+dis-1;
		for(int i=ind;i<=n;i++){
			if(arr[i]<=k){
				nind++;
			}
		}
	}
	else if(pos==2){
		ll k=arr[ind]+2*dis-1;
		for(int i=ind;i<=n;i++){
			if(arr[i]<=k){
				nind++;
			}
		}
	}
	if(nind>n){
		return 1;
	}
	else{
		if(x>0&&y>0){
			return max(check(x-1,y,dis,nind,1),check(x,y-1,dis,nind,2));
		}
		else if(x>0){
			return check(x-1,y,dis,nind,1);
		}
		else if(y>0){
			return check(x,y-1,dis,nind,2);
		}
		else{
			return 0;
		}
	}
}
void solve(){
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	sort(arr+1,arr+n+1);
	ll l=0,r=1e9,k=0;
	while(l<=r){
		ll m=(l+r)/2;
		//cout<<m<<endl;
		if(check(a,b,m,1,0)==1){
			r=m-1;
			k=m;
		}
		else{
			l=m+1;
		}
	}
	cout<<k<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Execution timed out 1087 ms 204 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Execution timed out 1089 ms 332 KB Time limit exceeded
4 Halted 0 ms 0 KB -