oj.uz

답안 #707934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707934 2023-03-10T14:25:49 Z Dan4Life 구경하기 (JOI13_watching) C++17
100 / 100
 312 ms 16084 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)2e3+10;
const int LINF = (int)1e9;
int n, p, q;
vector<int> v;
int a[mxN], ip[mxN], iq[mxN], dp[mxN][mxN];

bool work(int w){
	v.clear(); v.pb(0);
	for(int i = 1, s=0; i <= n; i++){
		s+=a[i]-a[i-1]; v.pb(s); if(i==1) continue;
		for(int j = 1; j < sz(v); j++){
			if(s-v[j]+1 <=w){ ip[i]=j-1; break;	}
		}
		for(int j = 1; j < sz(v); j++){
			if(s-v[j]+1 <=2*w){ iq[i]=j-1; break;	}
		}
	}
	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= q; j++){
			dp[i][j] = LINF; 
			dp[i][j] = min(dp[i][j], dp[ip[i]][j]+1);
			if(j) dp[i][j] = min(dp[i][j], dp[iq[i]][j-1]);
		}
	}
	return dp[n][q]<=p;
}

int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> p >> q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a+1,a+n+1);
	if(p+q>=n){cout<<1;return 0;}
	int l = 1, r = (int)1e9;
	while(l<r){
		int mid = (l+r)/2;
		if(work(mid)) r=mid;
		else l=mid+1;
	}
	cout << l;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 8276 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 54 ms 8404 KB Output is correct
8 Correct 171 ms 14240 KB Output is correct
9 Correct 78 ms 9340 KB Output is correct
10 Correct 75 ms 9044 KB Output is correct
11 Correct 312 ms 16084 KB Output is correct
12 Correct 204 ms 15956 KB Output is correct
13 Correct 49 ms 8532 KB Output is correct
14 Correct 55 ms 8404 KB Output is correct
15 Correct 59 ms 8504 KB Output is correct