oj.uz

Submission #48681

# Submission time Handle Problem Language Result Execution time Memory
48681 2018-05-17T20:42:57 Z Pajaraja Watching (JOI13_watching) C++17
100 / 100
 487 ms 15564 KB 
#include <bits/stdc++.h>
#define MAXN 2007
using namespace std;
int n,p,q,a[MAXN],dp[MAXN][MAXN];
int provera(int x)
{
	int t1=0,t2=0,t3=1;
	for(int i=1;i<=q;i++) dp[i][0]=1000000000;
	dp[0][0]=0;
	while(t3<=n)
	{
		while(t1<t3 && a[t3]-a[t1+1]>=2*x) t1++;
		while(t2<t3 && a[t3]-a[t2+1]>=x) t2++;
		for(int i=0;i<=q;i++) 
		{
			dp[i][t3]=1000000000;
			if(i>0) dp[i][t3]=min(dp[i-1][t1],dp[i][t3]);
			dp[i][t3]=min(dp[i][t2]+1,dp[i][t3]);
		}
		t3++;
	}
	for(int i=0;i<=q;i++) if(dp[i][n]<=p) return true;
	return false;
}
int binarna(int l,int r)
{
	if(l==r) return l;
	int s=(l+r)/2;
	if(provera(s)) return binarna(l,s);
	return binarna(s+1,r);
}
int main()
{
	scanf("%d%d%d",&n,&p,&q);
	if(p+q>=n) {printf("1"); return 0;}
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	a[0]=-1000000000;
	printf("%d",binarna(1,(a[n]-a[1])/(p+2*q)+1));
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:34: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:36:29: 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 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 2 ms 744 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 2 ms 892 KB Output is correct
12 Correct 2 ms 892 KB Output is correct
13 Correct 2 ms 892 KB Output is correct
14 Correct 2 ms 892 KB Output is correct
15 Correct 2 ms 892 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 892 KB Output is correct
2 Correct 2 ms 892 KB Output is correct
3 Correct 2 ms 892 KB Output is correct
4 Correct 2 ms 892 KB Output is correct
5 Correct 2 ms 892 KB Output is correct
6 Correct 2 ms 892 KB Output is correct
7 Correct 7 ms 892 KB Output is correct
8 Correct 161 ms 6652 KB Output is correct
9 Correct 17 ms 6652 KB Output is correct
10 Correct 13 ms 6652 KB Output is correct
11 Correct 487 ms 15564 KB Output is correct
12 Correct 143 ms 15564 KB Output is correct
13 Correct 4 ms 15564 KB Output is correct
14 Correct 4 ms 15564 KB Output is correct
15 Correct 4 ms 15564 KB Output is correct