oj.uz

Submission #12949

# Submission time Handle Problem Language Result Execution time Memory
12949 2015-01-21T12:24:00 Z gs13068 Watching (JOI13_watching) C++
100 / 100
 328 ms 16776 KB 
#include<cstdio>
#include<algorithm>

long long c[2002];
int x[2002];
int y[2002];
int d[2002][2002];

int main()
{
	int l,r,mid;
	int i,j,n,a,b;
	scanf("%d%d%d",&n,&a,&b);
	for(i=1;i<=n;i++)scanf("%lld",&c[i]);
	std::sort(c+1,c+n+1);
	l=1;
	r=1e9;
	while(l<r)
	{
		mid=(l+r)/2;
        for(i=1;i<=n;i++)
		{
			x[i]=std::lower_bound(c+i+1,c+n+1,c[i]+mid)-c;
			y[i]=std::lower_bound(c+i+1,c+n+1,c[i]+mid+mid)-c;
		}
		x[n+1]=y[n+1]=n+1;
		for(i=0;i<=n&&i<=a;i++)for(j=0;i+j<=n&&j<=b;j++)d[i][j]=1;
		for(i=0;i<n&&i<=a;i++)for(j=0;i+j<n&&j<=b;j++)
		{
			d[i+1][j]=std::max(d[i+1][j],x[d[i][j]]);
			d[i][j+1]=std::max(d[i][j+1],y[d[i][j]]);
		}
		for(i=0;i<=n&&i<=a;i++)
		{
			for(j=0;i+j<=n&&j<=b;j++)if(d[i][j]>n)break;
			if(i+j<=n&&j<=b)break;
		}
        if(i<=n&&i<=a)r=mid;
        else l=mid+1;
	}
	printf("%d",l);
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16776 KB Output is correct
2 Correct 0 ms 16776 KB Output is correct
3 Correct 0 ms 16776 KB Output is correct
4 Correct 0 ms 16776 KB Output is correct
5 Correct 0 ms 16776 KB Output is correct
6 Correct 0 ms 16776 KB Output is correct
7 Correct 0 ms 16776 KB Output is correct
8 Correct 0 ms 16776 KB Output is correct
9 Correct 0 ms 16776 KB Output is correct
10 Correct 0 ms 16776 KB Output is correct
11 Correct 0 ms 16776 KB Output is correct
12 Correct 0 ms 16776 KB Output is correct
13 Correct 0 ms 16776 KB Output is correct
14 Correct 0 ms 16776 KB Output is correct
15 Correct 0 ms 16776 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16776 KB Output is correct
2 Correct 0 ms 16776 KB Output is correct
3 Correct 292 ms 16776 KB Output is correct
4 Correct 36 ms 16776 KB Output is correct
5 Correct 28 ms 16776 KB Output is correct
6 Correct 328 ms 16776 KB Output is correct
7 Correct 4 ms 16776 KB Output is correct
8 Correct 20 ms 16776 KB Output is correct
9 Correct 20 ms 16776 KB Output is correct
10 Correct 40 ms 16776 KB Output is correct
11 Correct 28 ms 16776 KB Output is correct
12 Correct 176 ms 16776 KB Output is correct
13 Correct 4 ms 16776 KB Output is correct
14 Correct 4 ms 16776 KB Output is correct
15 Correct 0 ms 16776 KB Output is correct