oj.uz

Submission #148068

# Submission time Handle Problem Language Result Execution time Memory
148068 2019-08-31T13:35:17 Z WhipppedCream Watching (JOI13_watching) C++17
50 / 100
 1000 ms 16248 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

int n;

const int maxn = 2005;

int arr[maxn];

int dp[maxn][maxn];

int w;

int solve(int p, int q)
{
	if(dp[p][q] != -1) return dp[p][q];
	int ans = 0;
	if(p> 0)
	{
		int lst = solve(p-1, q);
		if(lst == n)
		{
			return dp[p][q] = n;
		}
		int rng = arr[lst+1]+w-1;
		int val = upper_bound(arr+1, arr+n+1, rng)-arr-1;
		ans = max(ans, val);
	}
	if(q> 0)
	{
		int lst = solve(p, q-1);
		if(lst == n)
		{
			return dp[p][q] = n;
		}
		int rng = arr[lst+1]+2*w-1;
		int val = upper_bound(arr+1, arr+n+1, rng)-arr-1;
		ans = max(ans, val);
	}
	return dp[p][q] = ans;
}

int main()
{
	int p, q;
	scanf("%d %d %d", &n, &p, &q);
	for(int i = 1; i<= n; i++) scanf("%d", &arr[i]);
	sort(arr+1, arr+n+1);
	n = unique(arr+1, arr+n+1)-(arr+1);
	if(p+q>= n)
	{
		printf("1\n"); return 0;
	}
	int lo = 1, hi = arr[n]-arr[1]+1;
	while(lo< hi)
	{
		int mid = (lo+hi)/2;
		memset(dp, -1, sizeof dp);
		w = mid;
		if(solve(p, q) == n) hi = mid;
		else lo = mid+1;
	}
	printf("%d\n", lo);
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &p, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
watching.cpp:54:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i<= n; i++) scanf("%d", &arr[i]);
                             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 15984 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 39 ms 16056 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 40 ms 16120 KB Output is correct
8 Correct 44 ms 16200 KB Output is correct
9 Correct 42 ms 16092 KB Output is correct
10 Correct 41 ms 16036 KB Output is correct
11 Correct 42 ms 16120 KB Output is correct
12 Correct 44 ms 16120 KB Output is correct
13 Correct 29 ms 15992 KB Output is correct
14 Correct 31 ms 15992 KB Output is correct
15 Correct 39 ms 16096 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 16120 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 41 ms 16120 KB Output is correct
8 Correct 225 ms 16248 KB Output is correct
9 Correct 221 ms 16192 KB Output is correct
10 Correct 249 ms 16204 KB Output is correct
11 Correct 156 ms 16212 KB Output is correct
12 Execution timed out 1070 ms 16120 KB Time limit exceeded
13 Halted 0 ms 0 KB -