input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import deque
n = int(eval(input()))
list = [list(map(int,input().split())) for i in range(n)]
p = deque()
for i in list:
p.append([i[0] - i[1],i[0] + i[1]])
p = sorted(p,key = lambda x: x[1])
ex = []
ex.append(p.pop(0))
for i in range(len(p)):
if(ex[-1][1] <= p[0][0]):... | from collections import deque
n = int(eval(input()))
list = [list(map(int,input().split())) for i in range(n)]
p = []
for i in list:
p.append([i[0] - i[1],i[0] + i[1]])
p = sorted(p,key = lambda x: x[1])
p = deque(p)
ex = []
ex.append(p.popleft())
for i in range(len(p)):
if(ex[-1][1] <=... | p02796 |
import sys
from collections import deque, Counter, defaultdict
from itertools import permutations
import heapq
def resolve():
N = int(sys.stdin.readline().strip())
pq = []
for _ in range(N):
X, L = list(map(int, sys.stdin.readline().strip().split()))
heapq.heappush(pq, (X + L, X... | import sys
from collections import deque, Counter, defaultdict
from itertools import permutations
import heapq
def resolve():
N = int(sys.stdin.readline().strip())
pq = []
for _ in range(N):
X, L = list(map(int, sys.stdin.readline().strip().split()))
heapq.heappush(pq, (X + L, X... | p02796 |
N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
t = [(x + l, x - l) for x, l in XL]
t.sort()
max_r = -float('inf')
result = 0
for i in range(N):
r, l = t[i]
if max_r <= l:
result += 1
max_r = r
print(result) | from operator import itemgetter
def solve():
N = int(eval(input()))
X = []
for i in range(N):
xx, ll = list(map(int, input().split()))
X.append((xx-ll, xx+ll))
X.sort(key=itemgetter(1))
count = 0
cur = -float('inf')
for i in range(N):
c, d = X[i]
... | p02796 |
n = int(eval(input()))
l = []
for _ in range(n):
x,y = list(map(int, input().split()))
l.append([x+y,x-y])
l.sort()
temp = l[0][0]
count = n
i = 1
for i in range(1,n):
if temp <= l[i][1]:
temp = l[i][0]
else:
temp = min(temp,l[i][0])
count -= 1
print(count) | n = int(eval(input()))
l = []
for _ in range(n):
x,y = list(map(int, input().split()))
l.append([x+y,x-y])
l=sorted(l)
tmp = l[0][0]
count = n
for p in l[1:]:
if tmp <= p[1]:
tmp = p[0]
else:
tmp = min(tmp,p[0])
count -= 1
print(count) | p02796 |
def main():
N = int(eval(input()))
L = []
for i in range(N):
xi, li = list(map(int, input().split()))
s = xi - li
f = xi + li
L.append((s, f))
L.sort(key=lambda x: x[1])
ans = 0
while L:
e = L[0]
L = [i for i in L if i[0] >= e[1... | def main():
N = int(eval(input()))
L = []
for i in range(N):
xi, li = list(map(int, input().split()))
s = xi - li
f = xi + li
L.append((f, s))
L.sort()
ans = 0
finish = -float("inf")
for i in L:
if finish <= i[1]:
ans +... | p02796 |
N = int(eval(input()))
L = []
R = []
for i in range(N):
x,l = list(map(int,input().split()))
L.append( x-l )
R.append( x+l )
R,L = list(zip(*sorted(zip(R,L))))
cnt = 1
maxR = R[0]
for i in range(1,N):
if maxR <= L[i]:
cnt += 1
if maxR < R[i]:
maxR = R[i]
... | N = int(eval(input()))
L = []
R = []
for i in range(N):
x,l = list(map(int,input().split()))
L.append( x-l )
R.append( x+l )
R,L = list(zip(*sorted(zip(R,L))))
cnt = 1
maxR = R[0]
for i in range(1,N):
if maxR <= L[i]:
cnt += 1
maxR = R[i]
print(cnt) | p02796 |
n = int(eval(input()))
ll = [[0]*i for i in range(n)]
for i in range(n):
x, l =list(map(int, input().split()))
ll[i] = [x-l, x+l]
ll = sorted(ll)
l = ll[0]
ans = n
for i in range(n-1):
li = ll[i+1]
if l[1] > li[0]:
ans -= 1
else:
l = li
print(ans) | n = int(eval(input()))
ll = []
for i in range(n):
x, l = list(map(int, input().split()))
ll.append([x-l, x+l])
ll = sorted(ll)
ans = n
r = ll.pop()[0]
while ll:
while ll and ll[-1][1] > r:
ans -= 1
ll.pop()
if ll:
r = ll.pop()[0]
print(ans) | p02796 |
n = int(eval(input()))
ll = []
for i in range(n):
x, l = list(map(int, input().split()))
ll.append([x-l, x+l])
ll.sort(key=lambda x:x[1])
ans = 0
tmp = -10**9
for l in ll:
if l[0] >= tmp:
ans += 1
tmp = l[1]
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
ll = []
for i in range(n):
x, l = list(map(int, input().split()))
ll.append([x-l, x+l])
ll.sort(key=lambda x:x[1])
ans = 0
tmp = -10**9
for l in ll:
if l[0] >= tmp:
ans += 1
tmp = l[1]
print(ans) | p02796 |
n = int(eval(input()))
L = []
for _ in range(n):
x, l = list(map(int, input().split()))
L.append([x - l, x + l])
L = sorted(L, key=lambda x: x[1])
ans = 0
r = -float('inf')
for i in range(n):
if L[i][0] >= r:
ans += 1
r = L[i][1]
print(ans)
| n = int(eval(input()))
L = []
for _ in range(n):
x, l = list(map(int, input().split()))
left = x - l
right = x + l
L.append((left, right))
L = sorted(L, key=lambda x: x[1])
ans = 0
prev = -float('inf')
for r in L:
if r[0] >= prev:
ans += 1
prev = r[1]
print(ans)
| p02796 |
from operator import itemgetter
N= int(eval(input()))
ans = 1
a = []
for i in range(N):
tmpa, tmpb = list(map(int,input().split()))
if tmpa-tmpb in a:
a[tmpa-tmpb].append(tmpa+tmpb)
else:
a.append([tmpa-tmpb,tmpa+tmpb])
b = sorted(a, key=itemgetter(1))
tmp = b[0][1]
for i in ... | from operator import itemgetter
N= int(eval(input()))
ans = 1
a = []
for i in range(N):
tmpa, tmpb = list(map(int,input().split()))
a.append([tmpa+tmpb, tmpa-tmpb])
a.sort()
tmp = a[0][0]
for i in range(1, N):
if a[i][1] >= tmp:
ans += 1
tmp = a[i][0]
print(ans)
| p02796 |
import heapq
n = int(eval(input()))
XL = [tuple(map(int, input().split())) for _ in range(n)]
blocked = [0] * n
total = 0
for i in range(n):
ax, al = XL[i]
for j in range(i + 1, n):
bx, bl = XL[j]
if ax - al < bx - bl < ax + al or ax - al < bx + bl < ax + al:
blocked[i]... | n = int(eval(input()))
LR = [None] * n
for i in range(n):
x, l = list(map(int, input().split()))
LR[i] = (x - l, x + l)
LR.sort(key=lambda lr: lr[1])
count = 1
cur = LR[0][1]
for l, r in LR[1:]:
if cur <= l:
count += 1
cur = r
print(count)
| p02796 |
n = int(eval(input()))
X = []
L = []
for _ in range(n):
x, l = list(map(int, input().split()))
X.append(x)
L.append(l)
X = sorted(set(X), key=X.index)
areas = [(x - l, x + l)for x, l in zip(X, L)]
for i, (m0, M0) in enumerate(areas):
for m, M in (areas[:i] + areas[i+1:]):
if (m0 <= ... | # https://atcoder.jp/contests/keyence2020/tasks/keyence2020_b
n = int(eval(input()))
X = []
L = []
for _ in range(n):
x, l = list(map(int, input().split()))
X.append(x)
L.append(l)
areas = [(x - l, x + l) for x, l in zip(X, L)]
areas = sorted(areas, key=lambda x:x[-1])
# print(areas)
ok =... | p02796 |
from operator import itemgetter
N = int(eval(input()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
s = [a-b, a+b]
l.append(s)
l.sort(key = itemgetter(1))
cnt = 0
for i in range(1, N):
for j in range(i, -N, -1):
if l[j-1][0] == - 10 ** 9:
continue
if l[i][0] ... | from operator import itemgetter
N = int(eval(input()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
s = [a-b, a+b]
l.append(s)
l.sort(key = itemgetter(1))
cnt = 0
s = - 10 ** 10
for i in range(N):
if l[i][0] >= s:
s = l[i][1]
else:
cnt += 1
print((N-cnt)) | p02796 |
N = int(eval(input()))
ST = []
for _ in range(N):
x, l = list(map(int, input().split()))
ST.append((x-l, x+l))
ST.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
s, t = ST[i]
if cur <= s:
ans += 1
cur = t
print(ans)
| import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
XL = []
for _ in range(N):
x, l = list(map(int, input().split()))
XL.append((x-l, x+l))
XL.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
if cur <= XL[i][0]:
ans += 1
... | p02796 |
import bisect
N=int(eval(input()))
rllist=[]
for _ in range(N):
X,L=list(map(int,input().split()))
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
dp=[0]*N
for i in range(N):
r,l=rllist[i]
pos=bisect.bisect(rllist,(l,float("inf")))
#print(i,pos)
dp[i]=max(dp[i-1],dp[pos-1]+1)
... | N=int(eval(input()))
rllist=[]
for _ in range(N):
X,L=list(map(int,input().split()))
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
answer=0
max_r=-float("inf")
for r,l in rllist:
#print(max_r,l)
if max_r<=l:
answer+=1
max_r=max(max_r,r)
print(answer) | p02796 |
N=int(eval(input()))
rllist=[]
for _ in range(N):
X,L=list(map(int,input().split()))
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
answer=0
max_r=-float("inf")
for r,l in rllist:
#print(max_r,l)
if max_r<=l:
answer+=1
max_r=max(max_r,r)
print(answer) | N=int(eval(input()))
rllist=[]
for _ in range(N):
X,L=list(map(int,input().split()))
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
answer=0
max_r=-float("inf")
for r,l in rllist:
#print(max_r,l)
if max_r<=l:
answer+=1
max_r=r
print(answer) | p02796 |
n = int(eval(input()))
lst = []
for i in range(n):
x,l = list(map(int,input().split()))
if x-l < 0:
# [右端の位置,左端の位置]
lst.append([x+l,0])
else:
lst.append([x+l,x-l])
lst.sort()
# [[6, 0], [7, 1], [12, 6], [105, 95]]
# 最初のロボットの選択
now = lst[0][0]
cnt = 1
idx = 1
... | n = int(eval(input()))
lst = []
for i in range(n):
x,l = list(map(int,input().split()))
if x-l < 0:
# [右端の位置,左端の位置]
lst.append([x+l,0])
else:
lst.append([x+l,x-l])
lst.sort()
# 最初のロボットの選択
now = lst[0][0]
cnt = 1
for i in range(1,n):
if now <= lst[i][1]:
... | p02796 |
n = int(eval(input()))
s = [list(map(int,input().split())) for i in range(n)]
s.sort()
stop = s[0][0] + s[0][1]
ans = 1
for i in range(1,n):
num = s[i][0]
l = s[i][1]
if num - l >= stop:
ans += 1
stop = num + l
if num + l < stop:
stop = num + l
print(ans)... | n = int(eval(input()))
a = []
for i in range(n):
x,l = list(map(int,input().split()))
s = x-l
g = x+l
a.append((s,g))
a = sorted(a, reverse=False, key=lambda x: x[1])
tmp = a[0][1]
ans = 1
for i in range(1,len(a)):
if tmp <= a[i][0]:
tmp = a[i][1]
ans += 1
print(a... | p02796 |
a = int(eval(input()))
fanwei = []
for i in range(a):
one = input().split()
one = [int(i) for i in one]
two = [one[0] - one[1], one[0] + one[1]]
fanwei.append(two)
fanwei = sorted(fanwei, key=lambda student: student[0] + 100000000000000000000 * student[1])
maxer = 0
for i in range(len(fan... | a = int(eval(input()))
fanwei = []
for i in range(a):
one = input().split()
one = [int(i) for i in one]
two = [one[0] - one[1], one[0] + one[1]]
fanwei.append(two)
fanwei = sorted(fanwei, key=lambda student: student[0] + 100000000000000000000 * student[1])
now = -100000000000000000000
ans... | p02796 |
from collections import defaultdict
n = int(eval(input()))
r = []
for i in range(n):
x, l = list(map(int, input().split()))
r.append((x - l + 1, x + l - 1))
r.sort()
am = [[] for _ in range(n)]
for i in range(n):
for j in range(i + 1, n):
if r[i][1] >= r[j][0]:
am[i].append(j)... | n = int(eval(input()))
r = []
for i in range(n):
x, l = list(map(int, input().split()))
r.append((x - l, x + l))
r.sort(key=lambda _x: _x[1])
cnt = 1
limit = r[0][1]
for ri in r[1:]:
if ri[0] >= limit:
cnt += 1
limit = ri[1]
print(cnt) | p02796 |
N = int(eval(input()))
# X = []
# L = []
# for _ in range(N):
# x, l = map(int, input().split()))
# X.append(x)
# L.append(l)
# XL = [list(map(int, input().split()))) for _ in range(N)]
A = []
B = []
for _ in range(N):
x, l = list(map(int, input().split()))
A.append(x - l)
B.append(x + l ... | N = int(eval(input()))
robot = []
for _ in range(N):
r = []
x, l = list(map(int, input().split()))
a = x + l - 1
b = x - l
r += [a, b]
robot.append(r)
Robot = sorted(robot)
robot_count = [Robot[0]]
for i in range(1, N):
if Robot[i][1] > robot_count[-1][0]:
robot_count.append(Robot[i])
... | p02796 |
n = int(eval(input()))
robot = []
for _ in range(n):
x, l = list(map(int, input().split()))
arm_left = x - l
arm_right = x + l
robot.append([arm_left, arm_right])
robot.sort(key=lambda x: x[1])
count = 0
while True:
if len(robot) == 0:
break
count += 1
current_right = ... | n = int(eval(input()))
robot = []
for _ in range(n):
x, l = list(map(int, input().split()))
arm_left = x - l
arm_right = x + l
robot.append([arm_left, arm_right])
robot.sort(key=lambda x: x[1])
count = 0
current_right = -1000000000
for i in range(n):
if robot[i][0] >= current_right:
... | p02796 |
N = int(eval(input()))
s = [tuple(map(int, input().split())) for i in range(N)]
s.sort(key=lambda x: x[1])
t = list([(j[0]-j[1]+1, j[0]+j[1]-1) for j in s])
NN = len(t)
dobon = []
for k in range(NN):
for l in range(k+1, NN):
if l not in dobon:
if int(t[k][1]) <= int(t[l][1]):
if (t[l... | N = int(eval(input()))
S = [tuple(map(int, input().split())) for i in range(N)]
T = list([(j[0]-j[1], j[0]+j[1]) for j in S])
T.sort(key=lambda x: x[1])
for i, t in enumerate(T):
if i>0:
if end <= t[0]:
res += 1
start = t[0]
end = t[1]
else:
start = t[0]
end = t[1]
... | p02796 |
n = int(eval(input()))
robot = []
for _ in range(n):
x, l = list(map(int, input().split()))
robot.append([x - l, x + l])
# startが被らないendが小さいもの
ans = 0
robot.sort(key=lambda x: x[1])
last = - float('inf')
for start, end in robot:
if start >= last:
ans += 1
last = end
print(... | import sys
input = sys.stdin.readline
n = int(eval(input()))
robot = []
for _ in range(n):
x, l = list(map(int, input().split()))
robot.append([x - l, x + l])
# startが被らないendが小さいもの
ans = 0
robot.sort(key=lambda x: x[1])
last = - float('inf')
for start, end in robot:
if start >= last:
... | p02796 |
N = int(eval(input()))
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l, x+l
if s >= right:
right = t
ans += 1
print(ans)
| N = int(eval(input()))
table = []
for i in range(N):
X,L = list(map(int,input().split()))
table.append((X-L,X+L))
table = sorted(table, key=lambda x:x[1])
cur = 0
l_cur, r_cur = table[0]
ans = N
for i in range(1,N):
l,r = table[i]
if r_cur > l:
ans -= 1
else:
l_cur, r... | p02796 |
import copy
n = int(eval(input()))
xl = []
for i in range(n):
xl.append([int(i) for i in input().split()])
xl[i].append(xl[i][0] - xl[i][1])
xl[i].append(xl[i][0] + xl[i][1])
xl.sort(key=lambda x: x[3])
ng = []
ans = 0
for i in range(n):
tmp = list(range(xl[i][2] + 1, xl[i][3]))
a = copy... | n = int(eval(input()))
robot = []
for i in range(n):
x, l = list(map(int,input().split()))
robot.append([x + l, x - l]) #left, right
robot.sort()
preright = robot[0][1]
ans = 0
for i in range(n):
left = robot[i][1]
#print(preright, left)
if preright <= left:
ans += 1
pre... | p02796 |
# coding: utf-8
import math
import collections
def main():
n = int(eval(input()))
inputs = [input().split() for i in range(n)]
inputs_list = []
for tmp in inputs:
if int(tmp[0]) - int(tmp[1]) < 0:
for i in range(0, int(tmp[0]) + int(tmp[1])):
inputs_list... | # coding: utf-8
def main():
n = int(eval(input()))
inputs = [input().split() for i in range(n)]
inputs_list = []
for i in inputs:
if int(i[0]) - int(i[1]) < 0:
inputs_list.append([0, int(i[0]) + int(i[1])])
else:
inputs_list.append([int(i[0]) - int(i[1]),... | p02796 |
n = int(eval(input()))
a = []
for _ in range(n):
c0, c1 = list(map(int, input().split()))
a.append([c0-c1, c0+c1])
a.sort(key=lambda x: x[1])
ans = 1
b = [a[0]]
for i in a[1:]:
for j, k in enumerate(b):
if not (k[1] <= i[0]):
break
if j == len(b)-1:
ans... | n = int(eval(input()))
a = []
for _ in range(n):
c0, c1 = list(map(int, input().split()))
a.append([c0-c1, c0+c1])
a.sort(key=lambda x: x[1])
ans, b = 1, a[0][1]
for i in a[1:]:
if b <= i[0]:
b = i[1]
ans += 1
print(ans)
| p02796 |
import sys
n = int(eval(input()))
xl = []
for _ in range(n):
x, l = list(map(int, input().split()))
xl.append((x, l))
xl.sort(key=lambda x:x[0])
i = 0
if n==1:
print((1))
sys.exit(0)
while i<len(xl)-1:
if xl[i][0]+xl[i][1] <= xl[i+1][0]-xl[i+1][1]:
i += 1
else:
if ... | import sys
n = int(eval(input()))
xl = []
for _ in range(n):
x, l = list(map(int, input().split()))
xl.append((x, l))
xl.sort(key=lambda x:x[0])
if n==1:
print((1))
sys.exit(0)
i=0
j=1
ans=n
while j<len(xl):
if xl[i][0]+xl[i][1] <= xl[j][0]-xl[j][1]:
i = j
j = i+1
... | p02796 |
n=int(eval(input()))
Y=[list(map(int,input().split())) for i in range(n)]
range=[]
ans,end=0,-1*(10**9+1)
for X in Y:
range.append([X[0]-X[1],X[0]+X[1]])
range.sort(key=lambda X: X[1])
for R in range:
if end <= R[0]:
ans += 1
end=R[1]
else:
continue
print(ans) | n=int(eval(input()))
Range=[]
ans,end=0,-1*(10**9+1)
for i in range(n):
x,y=list(map(int,input().split()))
Range.append([x-y,x+y])
Range.sort(key=lambda X: X[1])
for R in Range:
if end <= R[0]:
ans += 1
end=R[1]
else:
continue
print(ans) | p02796 |
def main():
n = int(eval(input()))
x = []
xl = {}
tmp = []
tmp2 = []
maxtmp = 0
for i in range(n):
xx, ll = list(map(int,input().split()))
if maxtmp < xx:
maxtmp = xx
low = max(xx-ll+1,0)
high = xx+ll-1
lmh = [low,xx,high]
... | def main():
n = int(eval(input()))
x = []
xl = {}
tmp = []
ans = 0
maxtmp = 0
for i in range(n):
xx, ll = list(map(int,input().split()))
if maxtmp < xx:
maxtmp = xx
low = xx-ll
high = xx+ll
lmh = [high,xx,low]
tmp.appe... | p02796 |
N = int(eval(input()))
r = [list(map(int, input().split())) for _ in range(N)]
a = []
for i in r:
a.append((i[0]+i[1],i[0]-i[1]))
a.sort()
ans = 0
cur = -float('inf')
for i in a:
if i[1] < cur:
continue
ans += 1
cur = i[0]
print(ans) | N = int(eval(input()))
r = [list(map(int, input().split())) for _ in range(N)]
a = []
for i in r:
a.append((i[0]-i[1],i[0]+i[1]))
a.sort(key=lambda x:x[1])
ans = 0
cur = -float('inf')
for i in a:
if i[0] < cur:
continue
ans += 1
cur = i[1]
print(ans) | p02796 |
n = int(eval(input()))
Robo = []
for i in range(n):
x, leng = list(map(int, input().split()))
Robo.append([x - leng + 1, x + leng - 1])
Robo.sort(key=lambda x: x[1])
#print(Robo)
Robo_r = []
for robo_cand in Robo:
l, r = robo_cand
for robo_r in Robo_r:
if l <= robo_r[1]:
break
else:
... | n = int(eval(input()))
Robo = []
for i in range(n):
x, l = list(map(int, input().split()))
Robo.append([x-l, x+l])
Robo.sort(key=lambda x: x[1])
#print(Robo)
biggest_right = 2 * -10**9 - 1
counter = 0
for left, right in Robo:
if biggest_right <= left:
counter += 1
biggest_rig... | p02796 |
import sys
from bisect import bisect
from operator import itemgetter
n = int(eval(input()))
robots = []
for line in sys.stdin:
X, L = list(map(int, line.split()))
l, r = X - L, X + L
robots.append((l, r))
robots.sort(key=itemgetter(1))
dp = [-(10 ** 18)]
for l, r in robots:
i = bisect(dp... | import sys
from operator import itemgetter
n = int(eval(input()))
robots = []
for line in sys.stdin:
X, L = list(map(int, line.split()))
l, r = X - L, X + L
robots.append((l, r))
robots.sort(key=itemgetter(1))
curr = -(10 ** 10)
ans = 0
for l, r in robots:
if curr > l:
continue
... | p02796 |
N = int(eval(input()))
r = [list(map(int, input().split())) for _ in range(N)]
r.sort()
l = [r[0]]
r = r[1:]
while len(r) > 0:
x1, l1 = l[-1]
x2, l2 = r[0]
if (x1+l1) > (x2-l2):
if (x1+l1) > (x2+l2):
l.pop()
l.append(r[0])
r.pop(0)
else:
... | N = int(eval(input()))
r = [list(map(int, input().split())) for _ in range(N)]
r.sort()
l = r[0]
ri = 1
ans = N
while ri < N:
x1, l1 = l
x2, l2 = r[ri]
if (x1+l1) > (x2-l2):
if (x1+l1) > (x2+l2):
l = r[ri]
ri += 1
else:
ri += 1
ans... | p02796 |
n = int(eval(input()))
robo = [0] * n
for i in range(n):
x, l = list(map(int, input().split()))
robo[i] = (x - l, x + l)
robo.sort(key=lambda x: x[1])
max_r, cnt = -float('inf'), 0
for l, r in robo:
if max_r <= l:
cnt += 1
max_r = max(max_r, r)
print(cnt) | n = int(eval(input()))
robo = [0] * n
for i in range(n):
x, l = list(map(int, input().split()))
robo[i] = (x - l, x + l)
robo.sort(key=lambda x: x[1])
max_r, cnt = -float('inf'), 0
for l, r in robo:
if max_r <= l:
cnt += 1
max_r = r
print(cnt) | p02796 |
#!python3
iim = lambda: list(map(int, input().rstrip().split()))
from bisect import bisect_left
def resolve():
N = int(eval(input()))
#S = [list(iim()) for i in range(N)]
MX = 10**9
S = []
for i in range(N):
x, l = iim()
i = x - l
if i < 0:
i = 0... | #!python3
iim = lambda: list(map(int, input().rstrip().split()))
from bisect import bisect_left
def resolve():
N = int(eval(input()))
#S = [list(iim()) for i in range(N)]
MX = 10**9
S = []
for i in range(N):
x, l = iim()
i = x - l
if i < 0:
i = 0... | p02796 |
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from functools import lru_cache
def resolve():
global N, grid
# S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
N = [int(x) fo... | import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from functools import lru_cache
def resolve():
global N, grid
# S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
N = [int(x) fo... | p02796 |
def main():
n = int(eval(input()))
s = []
e = []
tls = []
buff = {}
for i in range(n):
tmp = list(map(int, input().split()))
s.append(tmp[0] - tmp[1])
e.append(tmp[0] + tmp[1])
for i in range(n):
buff[s[i]] = e[i]
maxcount = 0
sort... | def main():
n = int(eval(input()))
x = []
l = []
for i in range(n):
tmp = list(map(int, input().split()))
x.append(tmp[0] - tmp[1])
l.append(tmp[0] + tmp[1])
x, l = list(zip(*sorted(zip(x, l))))
maxcount = 0
preve = 0
idx = 0
while idx < n:
... | p02796 |
import itertools
N = int(eval(input()))
alllist = []
remain = 0
for i in range(N):
X, L = list(map(int,input().split()))
alllist.append([i for i in range(X-L,X+L)])
d = 0
l = alllist
for i in range(N):
kumiawase = N-i
c_list = list(itertools.combinations(l, kumiawase))
for j in range(len... | import itertools
N = int(eval(input()))
alllist = []
remain = 0
for i in range(N):
X, L = list(map(int,input().split()))
alllist.append([X-L,X+L])
d = 0
l = alllist
for i in range(N):
kumiawase = N-i
c_list = list(itertools.combinations(l, kumiawase))
for j in range(len(c_list)):
... | p02796 |
# https://atcoder.jp/contests/keyence2020/tasks/keyence2020_b
'''
区間スケジューリング問題：終点でソートして貪欲法
'''
import sys
input = sys.stdin.readline
N = int(eval(input()))
schedule = []
for i in range(N):
x, l = list(map(int, input().split()))
schedule.append((x - l, l + x)) # schedule = (始点、終... | def Schedule(schedule):
"""
:return: 複数の区間が与えられた時の重複の無い区間の選び方の最大数
"""
schedule = sorted(schedule, key=lambda x: x[1])
N = len(schedule)
res = 0
end = -float("inf")
for i in range(N):
if end <= schedule[i][0]: # 重複がダメならば等号を消す
end = schedule[i][1] # 終点でソート... | p02796 |
n = int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
left = []
for i in range(n):
left.append((l[i][0]-l[i][1],l[i][0]+l[i][1]))
left.sort()
count = 1
right = 10**10
for i in range(n):
right = min(right,left[i][1])
while True:
right2 = 10**10
for i in rang... | n = int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
left = []
for i in range(n):
left.append((l[i][0]+l[i][1],l[i][0]-l[i][1]))
left.sort()
count = 1
right = 10**10
right = left[0][0]
c = 0
while True:
for i in range(c,n+1):
if i == n:
... | p02796 |
#!/usr/bin/env python3
INF = float("inf")
n, *d = list(map(int, open(0).read().split()))
p = sorted(zip(*[iter(d)]*2), key=sum)
M, a = -INF, 0
for X, L in p:
l, r = X-L, X+L
if M <= l:
a += 1
M = r
print(a) | M,a =-float("inf"),0
for X,L in sorted(zip(*[iter(map(int,open(0).read().split()[1:]))]*2),key=sum):
l,r=X-L,X+L
if M<=l:a+=1;M=r
print(a) | p02796 |
n = int(eval(input()))
a = [list(map(int,input().split())) for i in range(n)]
d = list(range(0))
for i in range(n):
b = a[i][0] - a[i][1]
c = a[i][0] + a[i][1]
d.append([b,c])
def aaa():
#print(d)
e = list(range(0))
mcnt = 0
f = 0
for i in range(len(d)):
cnt = 0
#print(i... | n = int(eval(input()))
robots = []
for i in range(n):
x, l = [int(item) for item in input().split()]
robots.append((x+l, x-l))
robots.sort()
#print(robots)
cnt = 0
node = -float("inf")
for end, start in robots:
if start >= node:
node = end
cnt += 1
print(cnt) | p02796 |
N=int(eval(input()))
xl=[list(map(int,input().split()))for _ in range(N)]
arms={}
for x,l in xl:
arms[x-l]=0
arms[x+l]=0
for x,l in xl:
arms[x-l]+=1
arms[x+l]-=1
point={}
for x,l in xl:
point[x-l]=[]
point[x+l]=[]
for x,l in xl:
point[x-l].append(x+l)
ans=N
K=sorted(arms.ke... | N=int(eval(input()))
xl=[list(map(int,input().split()))for _ in range(N)]
rl=[[x+l,x-l]for x,l in xl]
rl.sort()
now=-10**9
ans=0
for r,l in rl:
if l>=now:
ans+=1
now=r
print(ans) | p02796 |
N=int(eval(input()))
T=[]
for i in range(N):
X,L=list(map(int,list(input().split(" "))))
T.append([X+L,X-L])
T.sort()
sum=1
def check(T,v,w):
if T[v][0]<=T[w][1] or T[v][1]>=T[w][0]:
return True
else:
return False
checks=[0]
for i in range(1,N):
count=0
for j in... | N=int(eval(input()))
X=[]
for i in range(N):
a,b=list(map(int,list(input().split(" "))))
X.append([a+b,a-b])
X.sort()
D={}
D[0]=1
exe=[0]
for i in range(1,N):
k=X[i][0]
if X[i][1]<X[exe[-1]][0]:
D[i]=D[exe[-1]]
else:
D[i]=D[exe[-1]]+1
exe.append(i)
print((len(... | p02796 |
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
from operator import mul
INF = 1 << 60
MOD... | INF = 1 << 60
n = int(eval(input()))
x = [0 for i in range(n)]
l = [0 for i in range(n)]
for i in range(n):
x[i], l[i] = list(map(int, input().split()))
itv = [[x[i] - l[i], x[i] + l[i]] for i in range(n)]
itv.sort(key=lambda x:x[1])
# print("itv =", itv)
ans = 0
t = -INF
for i in range(n):
if... | p02796 |
N = int(eval(input()))
move = []
for i in range(N):
X,L = list(map(int,input().split()))
move.append([X-L,X+L])
move = sorted(move, key=lambda x:(x[0],x[1]))
if N == 1:
print((1))
else:
i = 1
while(len(move) > i):
if move[i-1][0] == move[i][0]:
del move[i-1]
... | N = int(eval(input()))
K = []
for i in range(N):
X,L = list(map(int,input().split()))
K.append([X-L,X+L])
T = sorted(K,key=lambda x:x[1])
a = T[0][1]
c = 1
for i in range(1,N):
if T[i][0] >= a:
c += 1
a = T[i][1]
print(c) | p02796 |
from operator import itemgetter
N = int(eval(input()))
X=[]
ans=0
for i in range(N):
H = list(map(int, input().split()))
O=[]
O.append(H[0]-H[1])
O.append(H[0]+H[1])
X.append(O)
#print(X)
X=sorted(X, key=itemgetter(1))
while(len(X)>0):
#print(X)
ans+=1
S=X[0][1]
X.r... | from operator import itemgetter
N = int(eval(input()))
X=[]
ans=0
for i in range(N):
H = list(map(int, input().split()))
O=[]
O.append(H[0]-H[1])
O.append(H[0]+H[1])
X.append(O)
#print(X)
X=sorted(X, key=itemgetter(1))
S=X[0][1]
ans+=1
for i in range(len(X)):
if(X[i][0]>=S):
... | p02796 |
N = int(eval(input()))
xl = []
for i in range(N):
xl.append(list(map(int,input().split())))
itv = []
for i in range(N):
right = xl[i][0] + xl[i][1] - 0.01 ##right
left = xl[i][0] - xl[i][1] + 0.01 ##left
itv.append([right,left])
itv.sort()
ass = 0
tt = -1e10
for i in range(N):
... | N = int(eval(input()))
xl = []
for i in range(N):
xl.append(list(map(int,input().split())))
itv = []
for i in range(N):
right = xl[i][0] + xl[i][1] ##right
left = xl[i][0] - xl[i][1] ##left
itv.append([right,left])
itv.sort()
ass = 0
tt = -1e10
for i in range(N):
if tt <=... | p02796 |
n = int(eval(input()))
m_list = []
for i in range(n):
X, L = list(map(int, input().split()))
m_list.append([X-L,X+L])
m_list = sorted(m_list, key=lambda x:x[1])
def MachineArrangementCheck():
length = len(m_list)
# 配列の上限エラー対策
for i in range(length):
if i != length - 1:
# m1の上... | n = int(eval(input()))
m_list = []
for i in range(n):
x,l = list(map(int, input().split()))
m_list.append([x-l, x+l])
m_list = sorted(m_list,key= lambda x:x[1])
result = 0
cur_pos = -1000000000
for min,max in m_list:
if cur_pos <= min:
result += 1
cur_pos = max
print(result... | p02796 |
# https://atcoder.jp/contests/keyence2020/tasks/keyence2020_b
N = int(eval(input()))
X, L = [], []
for i in range(N):
x, l = list(map(int, input().split()))
X.append([x, l])
X.sort(key=lambda x: x[0], reverse=False)
L = [x[1] for x in X]
X = [x[0] for x in X]
ans = 0
cur = -float('inf')
f... | import sys
N = int(eval(input()))
a = sorted([(x + l, x - l) for x, l in (list(map(int, l.split())) for l in sys.stdin)])
last = a[0][0]
ans = 1
for r, l in a[1:]:
if last <= l:
ans += 1
last = r
print(ans) | p02796 |
N = int(eval(input()))
XL = [tuple(map(int, input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0])
hold = [XL[0]]
ans = 1
for i in range(1, N):
if hold[-1][0] + hold[-1][1] > XL[i][0] - XL[i][1]:
if hold[-1][0] + hold[-1][1] < XL[i][0] + XL[i][1]:
continue
else:
... | N = int(eval(input()))
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0] + x[1])
right = -float('inf')
ans = 0
for x, l in XL:
s, t = x-l, x+l
if s >= right:
right = t
ans += 1
print(ans) | p02796 |
import math , sys
N = int( eval(input()) )
X = []
for i in range(N):
A , B = list(map(int, input().split()))
X.append([i , A-B , A , A+B])
X.sort(key=lambda x: x[3])
Y = X.pop(0)
Ri = Y[-1]
ans = 1
j=0
while len(X)>0:
Y = X.pop(0)
if Y[1]>=Ri:
ans+=1
Ri = Y[-1]... | import math , sys
N = int( eval(input()) )
X = []
for i in range(N):
A , B = list(map(int, input().split()))
X.append([i , A-B , A , A+B])
X.sort(key=lambda x: x[3])
Y = X[0]
Ri = Y[-1]
ans = 1
j=0
for i in range(1,N):
Y = X[i]
if Y[1] >= Ri:
ans+=1
Ri = Y[-1]
... | p02796 |
N = int(eval(input()))
LR = [[int(i) for i in input().split()] for _ in range(N)]
# 区間を右端の小さい順にソート
LR = sorted([(x-l, x+l) for x,l in LR],key=lambda x: x[1])
ans = 0
# 現在選んでいる区間の内、最も右にある区間の右端
cur_R = -float("inf")
for i in range(N):
# 区間が被るとき
if cur_R > LR[i][0]:
continue
ans += 1
... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
LR = [[int(i) for i in input().split()] for _ in range(N)]
# 区間を右端の小さい順にソート
LR = sorted([(x-l, x+l) for x,l in LR],key=lambda x: x[1])
ans = 0
# 現在選んでいる区間の内、最も右にある区間の右端
cur_R = -float("inf")
for i ... | p02796 |
def trush(XL):
pt,output = 1,len(XL)
while pt < len(XL)-1:
if XL[pt-1][2] > XL[pt][1] and XL[pt][2] > XL[pt+1][1]:
XL = XL[:pt] + XL[pt+1:]
output -= 1
else:
pt += 1
pt = 0
while pt < len(XL)-1:
if XL[pt][2] > XL[pt+1][1]:
... | def cal(XL):
N = len(XL)
XL.sort(key = lambda x:x[0])
for i in range(N):
XL[i] = [XL[i][0],XL[i][0]-XL[i][1],XL[i][0]+XL[i][1]]
OP = [XL[0]]
for i in range(1,N):
if OP[len(OP)-1][2] > XL[i][1]:
if OP[len(OP)-1][2] < XL[i][2]:
#右方向により腕が伸びている方がより邪... | p02796 |
n=int(eval(input()))
L=[]
for i in range(n):
x,l=list(map(int,input().split()))
L.append([x-l,x+l])
L.sort(key=lambda x:x[1])
ans=1
border=L[0][1]
for i,j in enumerate(L[1:]):
if border<=j[0]:
ans+=1
border=j[1]
print(ans)
| n=int(eval(input()))
L=[]
for i in range(n):
x,l=list(map(int,input().split()))
L.append([x-l,x+l])
L.sort(key=lambda x:x[1])
ans=1
bef=L[0][1]
for i in range(1,n):
if bef<=L[i][0]:
bef=L[i][1]
ans+=1
print(ans) | p02796 |
n=int(eval(input()))
robotLEFT=[]
robotRIGHT={}
for _ in range(n):
x,l=list(map(int,input().split()))
if x-l not in robotLEFT:
robotLEFT.extend([x-l])
robotRIGHT[x-l]=x+l
else:
robotRIGHT[x-l]=min(robotRIGHT[x-l],x+l)
robotLEFT.sort()
#print(robotRIGHT)
#print(robot... | n=int(eval(input()))
robot=[]
for _ in range(n):
x,l=list(map(int,input().split()))
robot.append([x-l,x+l])
robot.sort()
RR=robot[0][0]-1
cnt=0
for item in robot:
if RR<=item[0]:
cnt+=1
RR=item[1]
elif RR>=item[1]:
RR=item[1]
print(cnt)
| p02796 |
n = int(eval(input()))
a = []
for _ in range(n):
a.append(list(map(int,input().split())))
d = [[a[i][0]-a[i][1],a[i][0]+a[i][1]] for i in range(n)]
d = sorted(d, key = lambda x: x[1])
#print(d)
b = [-100000000000000000]
c = [0]
for i in range(n):
for j in range(len(b)):
if d[i][0] >... | n = int(eval(input()))
a = []
for _ in range(n):
a.append(list(map(int,input().split())))
d = [[a[i][0]-a[i][1],a[i][0]+a[i][1]] for i in range(n)]
d = sorted(d, key = lambda x: x[1])
#print(d)
b = [-100000000000000000]
c = [0]
for i in range(n):
for j in range(len(b)):
if d[i][0] >... | p02796 |
N=int(eval(input()))
XL=sorted([list(map(int,input().split())) for i in range(N)],key=sum)
count=0
left=-10**9
for x,l in XL:
if left<=x-l:
count+=1
left=x+l
print(count) | N=int(eval(input()))
XL=sorted([list(map(int,input().split())) for i in range(N)],key=lambda x:x[0]+x[1])
count=0
left=-10**9
for x,l in XL:
if left<=x-l:
count+=1
left=x+l
print(count) | p02796 |
n = int(eval(input()))
ls = []
for i in range(n):
x,l = list(map(int,input().split()))
ls.append([x-l,l+x])
r = n
ls = sorted(ls, key=lambda item: item[1])
for i in range(1,n):
if ls[i][0] < ls[i-1][1]:
ls[i][1] = ls[i-1][1]
r -=1
print(r) | n = int(eval(input()))
ls = []
for i in range(n):
x,l = list(map(int,input().split()))
ls.append([x-l,l+x])
ls = sorted(ls, key=lambda item: item[1])
ans = n
for i in range(1,n):
if ls[i][0] < ls[i-1][1]:
ls[i][1] = ls[i-1][1]
ans -=1
print(ans) | p02796 |
n = int(eval(input()))
ls = []
for i in range(n):
x,l = list(map(int,input().split()))
ls.append([x-l,l+x])
ls = sorted(ls, key=lambda item: item[1])
ans = n
for i in range(1,n):
if ls[i][0] < ls[i-1][1]:
ls[i][1] = ls[i-1][1]
ans -=1
print(ans) | n = int(eval(input()))
ls = []
for i in range(n):
x,l = list(map(int,input().split()))
ls.append([x-l,l+x])
ls = sorted(ls, key=lambda x: x[1])
ans = n
for i in range(1,n):
if ls[i][0] < ls[i-1][1]:
ls[i][1] = ls[i-1][1]
ans -=1
print(ans) | p02796 |
from functools import reduce
N = int(eval(input()))
XL = [list(map(int,input().split())) for _ in range(N)]
area = sorted([[x-l,x+l] for x,l in XL], key=lambda x: x[1])
area_ = [area[0]]
for i in range(1,N):
if reduce(lambda x,y: x and (area[i][0]>=y[1]), area_, True):
area_.append(area[i])
print((len(are... | N = int(eval(input()))
XL = sorted([list(map(int,input().split())) for _ in range(N)], key=lambda x: x[0]+x[1])
n = 1
S_,T_ = XL[0][0]-XL[0][1], XL[0][0]+XL[0][1]
for i in range(1,N):
S,T = XL[i][0]-XL[i][1], XL[i][0]+XL[i][1]
if not (S < T_):
n += 1
S_,T_ = S,T
print(n) | p02796 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | p02796 |
N, *XL = list(map(int, open(0).read().split()))
A = sorted(((x + l, x - l) for x, l in zip(*[iter(XL)] * 2)), key=lambda x: x[0])
ans = 0
cur = -10 ** 9
for t, s in A:
if cur <= s:
cur = t
ans += 1
print(ans) | INF = float("inf")
def interval_scheduling(A):
A.sort(key=lambda x: x[1])
res = []
cur = -INF
for s, t in A:
if cur <= s:
cur = t
res.append((s, t))
return res
N, *XL = list(map(int, open(0).read().split()))
A = [(x - l, x + l) for x, l in zip(*[i... | p02796 |
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
B = sorted([[A[i][0]-A[i][1],A[i][0]+A[i][1]] for i in range(N)],key=lambda x:x[1])
cur = 1
C = [B[0]]
while cur<N:
if B[cur][0]>=C[-1][1]:
C.append(B[cur])
cur += 1
print((len(C))) | N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
B = sorted([(A[i][0]-A[i][1],A[i][0]+A[i][1]) for i in range(N)],key=lambda x:x[0],reverse=True)
B = sorted(B,key=lambda x:x[1])
cnt = 1
cur = B[0][1]
for i in range(1,N):
if B[i][0]>=cur:
cnt += 1
cur = B[i][1]
... | p02796 |
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
B = sorted([(A[i][0]-A[i][1],A[i][0]+A[i][1]) for i in range(N)],key=lambda x:x[0],reverse=True)
B = sorted(B,key=lambda x:x[1])
cnt = 1
cur = B[0][1]
for i in range(1,N):
if B[i][0]>=cur:
cnt += 1
cur = B[i][1]
... | N = int(eval(input()))
X = [list(map(int,input().split())) for _ in range(N)]
A = []
for i in range(N):
x,l = X[i]
A.append((x-l,x+l))
B1 = sorted(A,key=lambda x:x[1])
B1 = [(B1[i][0],B1[i][1],i) for i in range(N)]
B2 = sorted(B1,key=lambda x:x[0])
hist = [0 for _ in range(N)]
cnt = 0
i = 0
for k in... | p02796 |
N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
XL = sorted(XL, key=lambda x: x[0]+x[1])
ans = [0]
for i in range(1, N):
can_put = True
for j in ans:
# ぶつかった場合
if XL[i][0] - XL[i][1] < XL[j][0] + XL[j][1] and XL[j][0] - XL[j][1] < XL[i][0] + XL[i][1]:
... | N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
XL = sorted(XL, key=lambda x: x[0]+x[1])
ans = 1
right = XL[0][0] + XL[0][1]
for i in range(1, N):
if right <= XL[i][0] - XL[i][1]:
right = XL[i][0] + XL[i][1]
ans += 1
print(ans) | p02796 |
n = int(eval(input()))
lis = []
for i in range(n):
a,b =list(map(int,input().split()))
lis.append([a-b,a+b])
lis.sort(key = lambda x:x[1])
dp = {(-2 * 10 ** 9,0)}
for aa,bb in lis:
now = set()
for nowa,ans in dp:
if nowa <= aa:
now.add((bb,ans+1))
now.add((nowa,an... | n = int(eval(input()))
lis = []
for i in range(n):
a,b =list(map(int,input().split()))
lis.append([a-b,a+b])
lis.sort(key = lambda x:x[1])
ans = 0
now = -10 ** 10
for a,b in lis:
if now <= a:
ans += 1
now = b
print(ans) | p02796 |
n = int(eval(input()))
ra = []
for i in range(n):
x,l = list(map(int,input().split()))
ra.append([x-l,x+l])
ra.sort(key = lambda x:x[0])
ans = 1
t = ra[0][1]
for i in range(n):
if ra[i][0] >= t:
ans += 1
t = ra[i][1]
else:
t = min(t,ra[i][1])
print(ans) | n = int(eval(input()))
ra = []
for i in range(n):
x,l = list(map(int,input().split()))
ra.append([x-l,x+l])
ra.sort(key=lambda x:x[1])
t = ra[0][1]
ans = 1
for i in range(1,n):
if ra[i][0] >= t:
ans += 1
t = ra[i][1]
print(ans) | p02796 |
import sys
import math
import copy
from functools import lru_cache
sys.setrecursionlimit(1000000000)
def solve(robots):
total = len(robots)
local_robots = copy.deepcopy(robots)
for i, current in enumerate(robots):
if count_collisions(current, local_robots) > 0:
local_robots.... | import sys
import math
sys.setrecursionlimit(1000000000)
def solve(robots):
total = len(robots)
prev = None
for current in robots:
if prev and prev[0] + prev[1] > current[0] - current[1]:
total -= 1
else:
prev = current
return total
... | p02796 |
import copy
n = int(eval(input()))
x = sorted([list(map(int, input().split())) for i in range(n)])
y = copy.deepcopy(x)
j = 0
while j < len(x)-1:
if x[j][0]+x[j][1] > x[j+1][0]-x[j+1][1]:
y.pop(j+1)
j += 2
continue
j += 1
print((len(y))) | N = int(eval(input()))
XL = [list(map(int, input().split())) for i in range(N)]
LR = [[x - l, x + l] for x, l in XL]
LR.sort(key=lambda x: x[1])
ans = 0
prev = -float("INF")
for l, r in LR:
if prev <= l:
ans += 1
prev = r
print(ans) | p02796 |
N = int(eval(input()))
robot_list = []
for i in range(N):
robot_list.append(list(map(int, input().split())))
def choose_coordinate(now_edge):
global robot_list
global res
next_edge = pow(10, 10)
for i in range(N):
robot_right_edge = robot_list[i][0] + robot_list[i][1]
robot_left_edge = r... | N = int(eval(input()))
robot_list = []
for i in range(N):
X, L = list(map(int, input().split()))
left_edge = X - L
right_edge = X + L
robot_list.append([left_edge, right_edge])
robot_list.sort(key=lambda x: x[1])
res = 0
index = - pow(10, 10)
for i in range(N):
if robot_list[i][0] >= index:
... | p02796 |
N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
length = []
for i in range(N):
s = XL[i][0] - XL[i][1]
f = XL[i][0] + XL[i][1]
length.append([s, f])
length = sorted(length, key=lambda x:x[1])
ans = 0
f = - (10**9+7)
for i in range(N):
if f <= length[i][0]:
... | N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
XL.sort(key=lambda x: sum(x))
f = -99999999999
ans = 0
for x, l in XL:
if x - l >= f:
ans += 1
f = x + l
print(ans) | p02796 |
n = int(eval(input()))
xl_lis = [list(map(int,input().split())) for i in range(n)]
tempx = -(10**10)
ans = 0
xl_lis.sort()
# print(xl_lis)
for i in xl_lis:
if tempx > i[0] - i[1] and tempx < i[0] + i[1]:
ans += 1
elif tempx > i[0] - i[1] and tempx >= i[0] + i[1]:
ans += 1
... | n = int(eval(input()))
xl_lis = [list(map(int,input().split())) for i in range(n)]
tempx = -(10**10)
ans = 0
xl_lis.sort()
# print(xl_lis)
for i in xl_lis:
a = i[0]
b = i[1]
if tempx > a - b and tempx < a + b:
ans += 1
elif tempx > a - b and tempx >= a + b:
ans += 1
... | p02796 |
n = int(eval(input()))
xl = []
lr = []
for _ in range(n):
x, l = list(map(int, input().split()))
xl.append([x, l])
lr.append([x-l, x+l])
lr.sort(key=lambda x: x[1])
ans = 0
r = -float("inf")
for i in range(n):
if r <= lr[i][0]:
ans += 1
r = lr[i][1]
print(ans)
| n = int(eval(input()))
d = []
for _ in range(n):
x, l = list(map(int, input().split()))
d.append([x-l, x+l])
d.sort(key=lambda x: x[1])
c = -float("inf")
ans = 0
for i in range(n):
if c <= d[i][0]:
c = d[i][1]
ans += 1
print(ans)
| p02796 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = []
b = []
b2 = []
c = []
count = 0
for i in range(n):
x,y = list(map(int,input().split()))
a.append([x,y,x+y])
a.sort(key=lambda x: x[2])
for i in a:
c = b.copy()
if len(b) > 0:
if i[0]-i[1] <= max(b):
b.extend... | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = []
b = []
b2 = []
c = []
count = 0
for i in range(n):
x,y = list(map(int,input().split()))
a.append([x,y,x+y])
a.sort(key=lambda x: x[2])
for i in a:
c = b.copy()
if len(b) > 0:
if i[0]-i[1] <= max(b):
#b.exten... | p02796 |
n = int(eval(input()))
res = n
num_list = []
max_list = []
for i in range(n):
a,b = list(map(int,input().split(" ")))
if i == 0:
for i in range(a-b,a+b+1):
num_list.append(i)
elif (a or b) in num_list:
res -= 1
else:
for i in range(a-b,a+b+1):
... | n = int(eval(input()))
min_list = []
max_list = []
middle_list = []
for i in range(n):
a,b = list(map(int,input().split(" ")))
min_list.append(a - b)
max_list.append(a + b)
middle_list.append(a)
count = 0
count_b = 0
for j,k in enumerate(middle_list):
if j == 0:
for i in range... | p02796 |
import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
robots = dict()
x_list = []
duplicates = dict()
for i in range(N):
x, l = list(map(int, input().split()))
x_list.append(x)
robots[x] = l
duplicates[x] = 0
x_list.sor... | import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
robots = list()
for i in range(N):
x, arm = list(map(int, input().split()))
right = x+arm
robots.append([x, right])
robots.sort(key=lambda x: x[1])
count = 0
last_r = -10**10... | p02796 |
n = int(eval(input()))
robot_arms = []
for _ in range(n):
x, l = list(map(int, input().split()))
robot_arms.append([x-l, x+l])
robot_arms = sorted(robot_arms, key=lambda x: x[1])
l, r = 0, 1
cnt = 1
while r < n:
if robot_arms[l][1] <= robot_arms[r][0]:
l = r
r += 1
cn... | n = int(eval(input()))
robots = []
for _ in range(n):
x, l = list(map(int, input().split()))
robots.append([x-l, x+l])
robots = sorted(robots, key=lambda x: x[1])
cnt = 1
current_end = robots[0][1]
for i in range(1, n):
if current_end <= robots[i][0]:
cnt += 1
current_end = ro... | p02796 |
n = int(eval(input()))
robots = []
for i in range(n):
x_tmp, l_tmp = (int(i) for i in input().split())
robots.append({'x': x_tmp, 'l': l_tmp})
robots_sorted = sorted(robots, key=lambda x: x['x'])
ans = n
i = 0
while(i < n-1):
if((robots_sorted[i]['x'] + robots_sorted[i]['l']) > (robots_sorted[i+1... | n = int(eval(input()))
robots = []
for i in range(n):
x_tmp, l_tmp = (int(i) for i in input().split())
robots.append([x_tmp - l_tmp, x_tmp + l_tmp])
robots.sort()
ans = n
right = robots[0][1]
for i in range(n-1):
if(robots[i+1][0] < right):
ans -= 1
right = min(right, robots[i+1... | p02796 |
N = int(eval(input()))
R = sorted([list(map(int, input().split())) for i in range(N)])
T = []
for i in range(N):
T.append([R[i][0] + R[i][1], R[i][0] - R[i][1]])
T.sort(reverse=True)
while len(T) - 1 > 0:
t = T.pop()
i = 1
while len(T) and t[0] > T[-1][1]:
N -= 1
i += 1
... | N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
A = []
for x, l in XL:
A.append([x + l, x - l])
A.sort()
B = []
i = 0
while True:
B.append(A[i])
if i == N - 1:
break
j = 1
while True:
if A[i][0] > A[i + j][1]:
j += 1
... | p02796 |
n = int(eval(input()))
xs = []
ls = []
for _ in range(n):
x, l = list(map(int, input().split()))
xs.append(x)
ls.append(l)
ok = [True for _ in range(n)]
def f(i):
rs = []
for j in range(n):
if i == j or not ok[j]:
continue
if xs[i] - ls[i] < xs[j] + ls[j]... | n = int(eval(input()))
robots = []
for _ in range(n):
x, l = list(map(int, input().split()))
robots.append((x + l, x - l))
robots.sort()
cur = -float('inf')
ans = 0
for i in range(n):
t, s = robots[i]
if cur <= s:
ans += 1
cur = t
print(ans) | p02796 |
from operator import itemgetter
from itertools import permutations
N = int(eval(input()))
XL = [tuple(map(int, input().split())) for _ in range(N)]
XL = sorted(XL, key=itemgetter(0))
for i in range(N):
for remove in permutations(XL, i):
remained = [i for i in XL if i not in remove]
edg... | n = int(eval(input()))
xl = [list(map(int, input().split())) for _ in range(n)]
le = [[p[0]-p[1], p[0]+p[1]] for p in xl]
le.sort(key = lambda x : x[1])
ans = 0
right = -(10 ** 9) - 1
for i in range(n):
if right <= le[i][0]:
ans += 1
right = le[i][1]
print(ans) | p02796 |
n = int(eval(input()))
xl = [list(map(int, input().split())) for _ in range(n)]
le = [[p[0]-p[1], p[0]+p[1]] for p in xl]
le.sort(key = lambda x : x[1])
ans = 0
right = -(10 ** 9) - 1
for i in range(n):
if right <= le[i][0]:
ans += 1
right = le[i][1]
print(ans) | n = int(eval(input()))
ls = []
for _ in range(n):
x, l = list(map(int, input().split()))
ls.append([x-l, x+l])
ls.sort(key=lambda x: x[1])
ans = n
for i in range(1, n):
if ls[i][0] < ls[i-1][1]:
ls[i][1] = ls[i-1][1]
ans -= 1
print(ans)
| p02796 |
N = int(eval(input()))
robots, count = [], 0
for x in range(N):
X, L = list(map(int, input().split()))
robots.append((X+L, X-L))
robots.sort()
node = -10**12
for end, start in robots:
if start >= node:
node = end
count += 1
print(count) | import sys
input = sys.stdin.readline
n = int(eval(input()))
robots = []
for i in range(n):
x, l = [int(item) for item in input().split()]
robots.append((x+l, x-l))
robots.sort()
cnt = 0
node = -10**12
for end, start in robots:
if start >= node:
node = end
cnt += 1
pri... | p02796 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
robots = []
for i in range(n):
x, l = [int(item) for item in input().split()]
robots.append((x+l, x-l))
robots.sort()
cnt = 0
node = -10**12
for end, start in robots:
if start >= node:
node = end
cnt += 1
pri... | import sys
input = sys.stdin.readline
N = int(eval(input()))
robots, count = [], 0
for x in range(N):
X, L = list(map(int, input().split()))
robots.append((X+L, X-L))
robots.sort()
node = -10**12
for end, start in robots:
if start >= node:
node = end
count += 1
print(count)
| p02796 |
n = int(eval(input()))
xl = [list(map(int, input().split())) for _ in range(n)]
lr = []
for i in range(n):
l = max(xl[i][0] - xl[i][1], 0)
r = max(xl[i][0] + xl[i][1], 0)
lr.append([r, l])
lr = sorted(lr)
keep = [False] * n
# print(lr)
cur = 0
for i in range(n):
if cur <= lr[i][1]:
... | n = int(eval(input()))
xl = [list(map(int, input().split())) for _ in range(n)]
lr = []
for i in range(n):
l = max(xl[i][0] - xl[i][1], 0)
r = max(xl[i][0] + xl[i][1], 0)
lr.append([l, r])
lr.sort(key=lambda x: x[1])
keep = [False] * n
cur = 0
for i in range(n):
if cur <= lr[i][0]:
... | p02796 |
N = int(eval(input()))
XL = [tuple(map(int, input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -10**9
removed = 0
for x, l in XL:
if x-l < right:
removed += 1
else:
right = x+l
print((N-removed))
| N = int(eval(input()))
XL = [tuple(map(int, input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0] + x[1])
ans = 0
prev = - 10**9
for x, l in XL:
if prev <= x - l:
ans += 1
prev = x + l
print(ans)
| p02796 |
from collections import defaultdict
n = int(eval(input()))
rob = defaultdict(list)
for i in range(n):
x,l = list(map(int,input().split()))
rob[x] = [l,x-l,x+l]
rob = sorted(list(rob.items()), key=lambda x:x[1])
tmp = []
for idx in range(0,len(rob)-1):
i,[l,left,right] = rob[idx]
for idx2 in r... | n = int(eval(input()))
rob = []
for i in range(n):
x,l = list(map(int,input().split()))
rob.append([x-l,x+l])
rob.sort()
ans = n
right = rob[0][1]
for i,[l,r] in enumerate(rob):
if i == 0:
continue
if l < right:
ans -= 1
right = min(right,r)
else:
righ... | p02796 |
def main():
N, *XL = list(map(int, open(0).read().split()))
# print(N, XL)
robots = [0]*N
for i in range(N):
X, L = XL[2 * i + 0], XL[2 * i + 1]
robots[i] = (i, X - L, X + L)
robots.sort(key=lambda x: x[2])
# print(robots)
remains = []
for robot in robots:
... | def main():
N, *XL = list(map(int, open(0).read().split()))
# print(N, XL)
robots = [0]*N
for i in range(N):
X, L = XL[2 * i + 0], XL[2 * i + 1]
robots[i] = (X - L, X + L)
robots.sort(key=lambda x: x[1])
# print(robots)
ans = 0
last = robots[0][0] - 1
for r... | p02796 |
n = int(eval(input()))
ar = []
z = 0
for i in range(n):
a,b = list(map(int,input().split(" ")))
count = 0
br = []
for i in range(a-(b-1),a+b):
if i in ar:
count += 1
break
br.append(i)
if count == 0:
z += 1
for r in br:
... | n = int(eval(input()))
ar = []
mi = 0
mx = 0
count = 1
for i in range(n):
a,b = list(map(int,input().split(" ")))
br = [a+b,a-b]
ar.append(br)
ar.sort()
for i,r in enumerate(ar):
if i == 0:
mx = r[0]
else:
if mx <= r[1]:
count += 1
mx = r[0]
p... | p02796 |
N = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(N)]
cnt = 0
for i in l:
x = 0 if i[0]-i[1] < 0 else i[0]-i[1]
i[1] = i[0]+i[1]
i[0] = x
l.sort(key=lambda x:x[1])
while l:
cnt+=1
x = l.pop(0)
delete = []
for i in range(len(l)):
if x[1] ... | N = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(N)]
ans = N
for i in l:
x = 0 if i[0]-i[1] < 0 else i[0]-i[1]
i[1] = i[0]+i[1]
i[0] = x
l.sort(key=lambda x:x[1])
right = 0
for i in range(N):
if right > l[i][0]:
ans-=1
else:
right = l[i... | p02796 |
N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
def compare(item):
return item[1]
newXL = sorted([[x-l, x+l] for x, l in XL], key=compare)
memo = [0]
for i in range(N):
flag = True
for j in memo:
if newXL[i][0] < newXL[j][1]:
flag = False
if flag:
... | N = int(eval(input()))
XL = [list(map(int, input().split())) for _ in range(N)]
newXL = sorted([[x-l, x+l] for x, l in XL], key=lambda x:x[1])
previous = 0
total = 1
for i in range(1, N):
if newXL[i][0] < newXL[previous][1]:
pass
else:
previous = i
total += 1
print(total) | p02796 |
(N,), *XL = [list(map(int, s.split())) for s in open(0)]
XL.sort(key=lambda x: x[0] + x[1])
curr = -float("inf")
ans = 0
for x, l in XL:
if x - l >= curr:
curr = x + l
ans += 1
print(ans)
| N, *XL = list(map(int, open(0).read().split()))
XL = sorted((x + l, x - l) for x, l in zip(*[iter(XL)] * 2))
curr = -float("inf")
ans = 0
for right, left in XL:
if left >= curr:
curr = right
ans += 1
print(ans)
| p02796 |
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
XL = []
for i in range(N):
x, l = list(map(int, input().split()))
XL.append((x, l))
XL.sort(key=lambda p: p[0] - p[1])
inf = 10**10
dp = [[inf] * (N+1) for _ in range(N+1)]
dp[0][0... | def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
XL = []
for i in range(N):
x, l = list(map(int, input().split()))
XL.append((x, l))
XL.sort(key=lambda p: p[1] + p[0])
ans = 0
prev = -10**10
for i in range(N):
x, l = XL[... | p02796 |
N = int(eval(input()))
R = [tuple(map(int, input().split())) for _ in range(N)]
# 左端でソート
R.sort(key=lambda x: x[0]-x[1])
prev_L_arm = R[0][0] - R[0][1]
prev_R_arm = R[0][0] + R[0][1]
ans = N
for i in range(1, N):
L_arm = R[i][0] - R[i][1]
R_arm = R[i][0] + R[i][1]
if L_arm < prev_R_arm:
p... | # 解き直し https://atcoder.jp/contests/keyence2020/tasks/keyence2020_b
N = int(eval(input()))
R = [None] * N
for i in range(N):
X, L = list(map(int, input().split()))
R[i] = (X-L, X+L)
# 右端でソート
R.sort(key=lambda x: x[1])
ans = N
max_R = R[0][1]
for i in range(1, N):
if R[i][0] < max_R:
ans -... | p02796 |
N = int(eval(input()))
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l, x+l-1
if s > right:
right = t
ans += 1
print(ans)
| N = int(eval(input()))
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l, x+l
if s >= right:
right = t
ans += 1
print(ans)
| p02796 |
n = int(eval(input()))
r = []
for _ in range(n):
r.append(list(map(int,input().split())))
r.sort()
i = 0
while i <= len(r)-2:
if r[i][0] + r[i][1] > r[i+1][0] - r[i+1][1]:
r = r[:i+1] + r[i+2:]
else:
i += 1
print((len(r)))
| n = int(eval(input()))
r = []
for _ in range(n):
x,l = list(map(int,input().split()))
r.append([x+l, x-l])
r.sort()
tmp = r[0]
cnt = 0
for i in range(1, n):
if r[i][1] < tmp[0]:
cnt += 1
else:
tmp = r[i]
print((n-cnt)) | p02796 |
n=int(eval(input()))
B=[]
for i in range(n):
x,l=list(map(int,input().split()))
B.append([x+l,x-l])
B.sort()
Left=[]
for b in B:
l=b[1];r=b[0]
flag=1
for c in Left:
if (c[0]<l and c[1]>l) or (c[0]<r and c[1]>r):
flag=0;break
elif c[0]>=l and c[1]<=r:
flag=0;break
if... | n=int(eval(input()))
B=[]
for i in range(n):
x,l=list(map(int,input().split()))
B.append([x-l,x+l])
B.sort(key=lambda x:x[1])
max_l=-10**18-5
ans=0
for b in B:
if max_l <= b[0]:
max_l = b[1]
ans+=1
print(ans) | p02796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.