15A - Cottage Village - CodeForces Solution


implementation sortings *1200

Please click on ads to support us..

Python Code:

n,width=map(int,input().split())
a=[]
for i in range(n):
    pos,w=map(int,input().split())
    a.append(pos-w/2)
    a.append(pos+w/2)
a.sort()
s=2
for i in range(1,2*n-1,2):
    if a[i+1]-a[i]>width:
        s+=2
    elif a[i+1]-a[i]==width:
        s+=1
print(s)


Comments

Submit
0 Comments
More Questions

268C - Beautiful Sets of Points
1391C - Cyclic Permutations
11A - Increasing Sequence
1406A - Subset Mex
1365F - Swaps Again
50B - Choosing Symbol Pairs
1719A - Chip Game
454B - Little Pony and Sort by Shift
1152A - Neko Finds Grapes
1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation
1719E - Fibonacci Strings
1696C - Fishingprince Plays With Array
1085A - Right-Left Cipher
1508B - Almost Sorted
1690C - Restoring the Duration of Tasks
1055A - Metro
1036D - Vasya and Arrays
1139C - Edgy Trees
37A - Towers
353A - Domino
409H - A + B Strikes Back
1262A - Math Problem
158C - Cd and pwd commands
194A - Exams
1673B - A Perfectly Balanced String
1104B - Game with string
1169B - Pairs