oj.uz

Submission #1047374

# Submission time Handle Problem Language Result Execution time Memory
1047374 2024-08-07T12:11:42 Z Minbaev Watching (JOI13_watching) C++17
100 / 100
 642 ms 7768 KB 
#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+1);
	for(int i = 1;i<=n;i++)cin >> v[i];
	
	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;
		
		bool flag = false;
		int dp[m+1][k+1]{};
		for(int i = 0;i<=m;i++){
			for(int j = 0;j<=k;j++){
				if(i >= 1){
					int h = v[dp[i-1][j] + 1] + mid - 1;
					int u = upper_bound(all(v), h) - v.begin() - 1;
					umax(dp[i][j], u);
				}
				if(j >= 1){
					int h = v[dp[i][j-1] + 1] + 2*mid - 1;
					int u = upper_bound(all(v), h) - v.begin() - 1;
					umax(dp[i][j], u);
				}
				if(dp[i][j] == n)flag = true;
			}
		}
		
		if(flag){
			r = mid - 1;
			ans = mid;
		}
		else l = mid + 1;
		
		
	}
	
	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
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 81 ms 1180 KB Output is correct
9 Correct 65 ms 1116 KB Output is correct
10 Correct 110 ms 1628 KB Output is correct
11 Correct 151 ms 1768 KB Output is correct
12 Correct 642 ms 7768 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct