oj.uz

답안 #107687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107687 2019-04-25T12:59:26 Z maruii 구경하기 (JOI13_watching) C++14
100 / 100
 143 ms 8704 KB 
#include <bits/stdc++.h>
using namespace std;
int N, P, Q;
unsigned int A[2002], X[2002], Y[2002];
int dp[2001][2001];
int f(int w){
	for(int i=0; i<=N; ++i){
		X[i] = lower_bound(A+i+1, A+N+1, A[i+1]+w) - A - 1;
		Y[i] = lower_bound(A+i+1, A+N+1, A[i+1]+(w<<1)) - A - 1;
	}
	for(int i=0; i<=P; ++i){
		for(int j=0; j<=Q; ++j){
			if(i && j) dp[i][j] = max(X[dp[i-1][j]], Y[dp[i][j-1]]);
			else if(i) dp[i][j] = X[dp[i-1][j]];
			else if(j) dp[i][j] = Y[dp[i][j-1]];
		}
	}
	return dp[P][Q];
}
int main(){
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin>>N>>P>>Q;
	for(int i=1; i<=N; ++i) cin>>A[i];
	sort(A+1, A+N+1);
	A[N+1] = 2e9;
	Q = min(Q, N), P = min(P, N-Q);
	int l=1, r=1e9;
	while(l<r){
		int m = l+r>>1;
		if(f(m) == N) r = m;
		else l = m+1;
	}
	cout<<l;
	return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:29:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = l+r>>1;
           ~^~

Subtask #1
50.0 / 50.0

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

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 142 ms 4336 KB Output is correct
4 Correct 32 ms 8704 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 20 ms 1284 KB Output is correct
9 Correct 20 ms 3840 KB Output is correct
10 Correct 40 ms 8576 KB Output is correct
11 Correct 28 ms 1024 KB Output is correct
12 Correct 143 ms 8188 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 4 ms 512 KB Output is correct