oj.uz

답안 #116625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116625 2019-06-13T09:06:04 Z roseanne_pcy 구경하기 (JOI13_watching) C++14
50 / 100
 1000 ms 16376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 16128 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 48 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 46 ms 16128 KB Output is correct
8 Correct 102 ms 16248 KB Output is correct
9 Correct 56 ms 16000 KB Output is correct
10 Correct 92 ms 16128 KB Output is correct
11 Correct 80 ms 16248 KB Output is correct
12 Correct 94 ms 16128 KB Output is correct
13 Correct 80 ms 16172 KB Output is correct
14 Correct 93 ms 16128 KB Output is correct
15 Correct 84 ms 16096 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 16112 KB Output is correct
2 Correct 47 ms 16128 KB Output is correct
3 Correct 532 ms 16376 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 356 KB Output is correct
7 Correct 85 ms 16000 KB Output is correct
8 Correct 226 ms 16120 KB Output is correct
9 Correct 218 ms 16248 KB Output is correct
10 Correct 227 ms 16248 KB Output is correct
11 Correct 139 ms 16128 KB Output is correct
12 Execution timed out 1040 ms 16220 KB Time limit exceeded
13 Halted 0 ms 0 KB -