oj.uz

Submission #116626

# Submission time Handle Problem Language Result Execution time Memory
116626 2019-06-13T09:07:38 Z roseanne_pcy Watching (JOI13_watching) C++14
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>= n || q>= n)
	{
		printf("1\n"); return 0;
	}
	int lo = 1, hi = 1e9;
	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 48 ms 16000 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 133 ms 16000 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 57 ms 16128 KB Output is correct
8 Correct 77 ms 16092 KB Output is correct
9 Correct 44 ms 16000 KB Output is correct
10 Correct 41 ms 16128 KB Output is correct
11 Correct 41 ms 16000 KB Output is correct
12 Correct 48 ms 16128 KB Output is correct
13 Correct 47 ms 16128 KB Output is correct
14 Correct 51 ms 16000 KB Output is correct
15 Correct 45 ms 16248 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16204 KB Output is correct
2 Correct 38 ms 16000 KB Output is correct
3 Correct 527 ms 16248 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 42 ms 16000 KB Output is correct
8 Correct 216 ms 16128 KB Output is correct
9 Correct 210 ms 16128 KB Output is correct
10 Correct 234 ms 16248 KB Output is correct
11 Correct 155 ms 16188 KB Output is correct
12 Execution timed out 1006 ms 16188 KB Time limit exceeded
13 Halted 0 ms 0 KB -