oj.uz

Submission #51445

# Submission time Handle Problem Language Result Execution time Memory
51445 2018-06-18T02:33:53 Z Vinhspm Watching (JOI13_watching) C++14
50 / 100
 1000 ms 46636 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int, int>
#define fi first
#define se second
#define pb push_back
const int N = 2009;
const int oo = 1e9;
const int mod = 1e9 + 7;
int n, P, Q;
int a[N];
vector< vector<bool> > dp[N];
bool check(int x)	{
	// base
	for(int i = 0; i <= n; ++i)
		for(int j = 0; j <= P; ++j)
			for(int t = 0; t <= Q; ++t)
				dp[i][j][t] = false;
	dp[0][P][Q] = true;
	for(int i = 1; i <= n; ++i)
		for(int j = 0; j <= P; ++j)
			for(int t = 0; t <= Q ;++t)	{
					if(j < P) 	{
						int nexpos = a[i] - x + 1;
						int pos = lower_bound(a + 1, a + n + 1, nexpos) - a - 1;
						dp[i][j][t] = dp[pos][j + 1][t];
					}
					if(t < Q && dp[i][j][t] == false)	{
						int nexpos = a[i] - 2*x + 1;
						int pos = lower_bound(a + 1, a + n + 1, nexpos) - a - 1;
						dp[i][j][t] = dp[pos][j][t + 1];
					}
					if(i == n && dp[i][j][t] == true) return true;
				}
	return false;
}
signed main()
{
	//freopen("test.txt", "r", stdin);
	//ios_base::sync_with_stdio(false);
	//cin.tie(0); cout.tie(0);
	scanf("%d%d%d", &n, &P, &Q);
	for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	sort(a + 1, a + n + 1); a[0] = -oo;
	if(P + Q >= n) {
		printf("1");
		return 0;
	}
	for(int i = 0; i <= n + 1; ++i) {
		dp[i].resize(P + 10);
		for(int j = 0; j <= P + 1; ++j)	{
			for(int t = 0; t <= Q + 1; ++t)
				dp[i][j].pb(false);
		}
	}
	//cout << check(3) << '\n'; return 0;
	int l = 1, r = oo;
	while(r > l + 1)	{
		int mid = (l + r)/ 2;
		if(check(mid)) r = mid;
		else l = mid;
	}
	for(int i = l; i <= r; ++i)
		if(check(i))	{
			printf("%d", i); 
			return 0;
		}
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:43: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:44:35: 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", &a[i]);
                              ~~~~~^~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 10 ms 676 KB Output is correct
9 Correct 11 ms 752 KB Output is correct
10 Correct 104 ms 828 KB Output is correct
11 Correct 95 ms 1092 KB Output is correct
12 Correct 253 ms 1092 KB Output is correct
13 Correct 6 ms 1092 KB Output is correct
14 Correct 7 ms 1092 KB Output is correct
15 Correct 8 ms 1092 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1636 KB Output is correct
2 Correct 2 ms 1636 KB Output is correct
3 Correct 3 ms 1636 KB Output is correct
4 Correct 3 ms 1636 KB Output is correct
5 Correct 2 ms 1636 KB Output is correct
6 Correct 3 ms 1636 KB Output is correct
7 Correct 705 ms 3560 KB Output is correct
8 Execution timed out 1078 ms 46636 KB Time limit exceeded
9 Halted 0 ms 0 KB -