Submission #12954

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12954	2015-01-21 12:35:26	gs13068	Watching (JOI13_watching)	C++98	100 / 100	52 ms	16780 KiB

watching

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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,k,n,a,b;
  scanf("%d%d%d",&n,&a,&b);
  if(a+b>=n)
  {
    puts("1");
    return 0;
  }
  for(i=1;i<=n;i++)scanf("%lld",&c[i]);
  std::sort(c+1,c+n+1);
  l=1;
  r=(1e9+a+b+b-1)/(a+b+b);
  for(i=0;i<=n&&i<=a;i++)for(j=0;i+j<=n&&j<=b;j++)d[i][j]=1;
  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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50