Submission #1047222

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047222		Minbaev	Watching (JOI13_watching)	C++17	0 / 100	57 ms	348 KiB

watching

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
 
int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}
 
int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}
 
int n,m,k;
 
void solve(){
	
	cin >> n >> m >> k;
	
	vector<int>v(n);
	for(auto &to:v)cin >> to;
	
	sort(all(v));
	
	if(m+k >= n){
		cout << 1 << "\n";
		return;
	}
	
	//~ for(auto to:v)cout << to << " ";
	//~ cout << "\n";
	
	int l = 2, r = 1e9, ans = -1;
	while(l <= r){
		int mid = (l+r)/2;
		//~ mid = 8;
		
		vector<array<int,3>>a;
		for(int i = 0;i<n;i++){
			int cnt = 0;
			for(int j = i;j<n;j++){
				if(v[j] - v[i] + 1 <= mid*2){
					cnt += 1;
				}
				if(v[j] - v[i] + 1 > mid*2){
					a.pb({cnt, i, j-1});
					break;
				}
				else if(j == n - 1){
					a.pb({cnt, i, j});
				}
			}
		}
		
		vector<int>vis(n);
		sort(rall(a));
		
		//~ for(auto to:a)cout << to[0] << " " << to[1] << " " << to[2] << "\n";
		
		int o = m, b = k;
		while(b--){
			int i = 0;
			for(int j = a[i][1];j<=a[i][2];j++){
				vis[j] = 1;
			}
			a[i][0] = 0;
			for(int j = i + 1;j<n;j++){
				if(a[j][0] <= 0)continue;
				for(int u = a[j][1];u<=a[j][2];u++){
					if(vis[u])a[j][0] -= 1;
				}
			}
			sort(rall(a));
		}
		
		for(int i = 0;i<n && o > 0;i++){
			if(vis[i])continue;
			o -= 1;
			for(int j = i;j<n;j++){
				if(v[j] - v[i] + 1 <= mid)vis[j] = 1;
				else break;
			}
			
		}
		
		
		bool flag = true;
		for(int i = 0;i<n;i++){
			if(!vis[i])flag = false;
		}
		if(flag){
			r = mid - 1;
			ans = mid;
		}
		else l = mid + 1;
		
		//~ return;
	}
	
	cout << ans << "\n";
	
}
/*
 
*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	//~ ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}
 

• Subtask 1: 0 / 50
• Subtask 2: 0 / 50