Cottage Village
Description
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 side t, 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 the Ox-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 and t (1 ≤ n, t ≤ 1000). Then there follow n lines, each of them contains two space-separated integer numbers: xi ai, where xi — x-coordinate of the centre of the i-th house, and ai — length of its side ( - 1000 ≤ xi ≤ 1000, 1 ≤ ai ≤ 1000).
Output
Output the amount of possible positions of the new house.
Sample Input
2 2 0 4 6 2
4
2 2 0 4 5 2
3
2 3 0 4 5 2
2
#include <cstdio>
#include <iostream>#include <algorithm>
using namespace std;
struct node
{
double x;
double a;
}A[1000];
bool cmp(node a,node b)
{
return a.x<b.x;
}
int main()
{
int n,sum;
double s1[1000],s2[1000],t;
while(scanf("%d%lf",&n,&t)==2)
{
for(int i=0;i<n;i++)
{
scanf("%lf%lf",&A[i].x,&A[i].a);
}
sum=2;
sort(A,A+n,cmp);
s1[0]=A[0].x-A[0].a/2;
s2[0]=A[0].x+A[0].a/2;
for(int i=1;i<n;i++)
{
s1[i]=A[i].x-A[i].a/2;
s2[i]=A[i].x+A[i].a/2;
if(s1[i]-s2[i-1]>t) sum+=2;
if(s1[i]-s2[i-1]==t) sum++;
}
printf("%d\n",sum);
}
return 0;
}