A. Cottage Village
来源:互联网 发布:淘宝联盟如何推广赚钱 编辑:程序博客网 时间:2024/06/05 18:30
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?
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 the amount of possible positions of the new house.
2 2
0 4
6 2
4
2 2
0 4
5 2
3
2 3
0 4
5 2
2
It is possible for the x-coordinate of the new house to have non-integer value.
/* ***********************************************
Author :
Created Time :2015/6/9 15:48:29
File Name :6.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
pair<double,double>p[maxn];
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
int n,t;
while(cin>>n>>t){
for(int i=0;i<n;i++){
cin>>p[i].first>>p[i].second;
}
sort(p,p+n);
int ans=2;
//1 1 1 1
for(int i=1;i<n;i++){
if(p[i].first-p[i].second*1.0/2-p[i-1].first-p[i-1].second*1.0/2==t)
ans++;
else if(p[i].first-p[i].second*1.0/2-p[i-1].first-p[i-1].second*1.0/2>t){
ans+=2;
}
}
cout<<ans<<endl;
}
return 0;
}
- A. Cottage Village
- codeforces 15A. Cottage Village
- CF 15A Cottage Village
- 【Pair】#15 A. Cottage Village
- cf 15a Cottage Village
- CodeForces 15A Cottage Village
- Cottage Village
- If the World Were a Village of 100 People
- If the world were a Village of 100 People
- Grapefruit, Cottage Cheese
- If the world were a Village of 100 People 如果世界是个一百人的村落
- lightoj 1250 - Village Postman
- 大学生村官 little village official
- UVA 10451 - Ancient Village Sports
- Lesson 35 Our village 我们的村庄
- Lesson Thirty-Five Our village. 我们的村庄.
- 刘昊威新作—东田造型三里屯VILLAGE概念店
- Village's 'goat pot' ultimate adventure in eating
- A. Power Consumption Calculation
- A. Increasing Sequence
- A. Super Agent
- A. Numbers
- A. Letter
- A. Cottage Village
- Mongoose使用操作
- A. Flag
- A. Noldbach problem
- A. Triangle
- A. World Football Cup
- A. BerOS file system
- A. Jabber ID
- A. Second Order Statistics