CF 15A Cottage Village

这是一个大大的水题，写这一篇博文的目的是提醒自己即使是再水的题也不能掉以轻心~

 

 

A. Cottage Village

time limit per test 2 seconds

memory limit per test 64 megabytes

inputstandard input

outputstandard output

A new cottage village called «Flatville» is being built in Flatland. By now they have already built in «Flatville»n square houses with the centres on the Оx-axis. The houses' sides are parallel to the coordinate axes. It's known that no two houses overlap, but they can touch each other.

The architect bureau, where Peter works, was commissioned to build a new house in «Flatville». The customer wants his future house to be on theОx-axis, to be square in shape, have a sidet, and touch at least one of the already built houses. For sure, its sides should be parallel to the coordinate axes, its centre should be on theOx-axis and it shouldn't overlap any of the houses in the village.

Peter was given a list of all the houses in «Flatville». Would you help him find the amount of possible positions of the new house?

Input

The first line of the input data contains numbers n andt (1 ≤ n, t ≤ 1000). Then there follown lines, each of them contains two space-separated integer numbers:x_ia_i, wherex_i —x-coordinate of the centre of the i-th house, and a_i — length of its side ( - 1000 ≤ x_i ≤ 1000,1 ≤ a_i ≤ 1000).

Output

Output the amount of possible positions of the new house.

Sample test(s)

Input

2 2
0 4
6 2

Output

4

Input

2 2
0 4
5 2

Output

3

Input

2 3
0 4
5 2

Output

2

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;

struct node
{
  double node;double length;
}a[1100];
bool cmp(node a,node b)
{
    return a.node<b.node;
}
int main()
{

int m,sum;double n;

while(scanf("%d%lf",&m,&n)!=EOF)
{
    sum=2;
    memset(a,0,sizeof(a));
    int i;
    double length=0,left,right;
    for(i=0;i<m;i++)
        scanf("%lf%lf",&a[i].node,&a[i].length);
    sort(a,a+m,cmp);
    for(i=0;i<m-1;i++)
    {
        left=a[i].node+a[i].length/2;
        right=a[i+1].node-a[i+1].length/2;
        length=right-left;
        if(length>n)  sum+=2;
        else if(length==n) sum+=1;
    }

    printf("%d\n",sum);

}
    return 0;
}