oj.uz

Submission #380769

# Submission time Handle Problem Language Result Execution time Memory
380769 2021-03-23T01:48:51 Z mariowong Watching (JOI13_watching) C++14
50 / 100
 1000 ms 23916 KB 
#include <bits/stdc++.h>
using namespace std;

long long l,r,mid,n,p,q,a[2005],dp[2005][2005];
deque <int> dq; 
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> p >> q;
	for (int i=1;i<=n;i++){
		cin >> a[i];
	}
	sort(a+1,a+1+n);
	l=1; r=1e9;
	while (l < r){
		mid=(l+r)/2;
		for (int i=0;i<=min(n,q);i++){ //used how many large
			for (int j=1;j<=n;j++){
				dp[i][j]=1e18;
			}
		}
		for (int i=0;i<=min(n,q);i++){ //used how many large
			if (i > 0){
				dq.push_back(0);
				for (int j=1;j<=n;j++){
					while (!dq.empty() && a[j]-a[dq.front()+1]+1 > 2*mid) dq.pop_front();
					if (dq.empty())
					dp[i][j]=1e18;
					else
					dp[i][j]=dp[i-1][dq.front()];
					while (!dq.empty() && dp[i-1][j] <= dp[i-1][dq.back()]) dq.pop_back();
					dq.push_back(j);
				}
				while (!dq.empty()) dq.pop_back();
			}
			dq.push_back(0);
			for (int j=1;j<=n;j++){
				while (!dq.empty() && a[j]-a[dq.front()+1]+1 > mid) dq.pop_front();
				if (!dq.empty())
				dp[i][j]=min(dp[i][j],dp[i][dq.front()]+1);
				while (!dq.empty() && dp[i][j] <= dp[i][dq.back()]) dq.pop_back();
				dq.push_back(j);
			}
			while (!dq.empty()) dq.pop_back();
		}
	/*	cout << l << " " << r << "\n";
		for (int i=1;i<=min(n,q);i++){ //used how many large
			for (int j=1;j<=n;j++){
				cout << dp[i][j] << " ";
			}
			cout << "\n";
		}*/
		if (dp[min(n,q)][n] <= p)
		r=mid;
		else
		l=mid+1;
	}
	cout << l << "\n";
	return 0;
}

Subtask #1
50.0 / 50.0

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

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Execution timed out 1085 ms 23916 KB Time limit exceeded
4 Halted 0 ms 0 KB -