problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02796
|
def acinput():
return list(map(int, input().split(" ")))
N=int(input())
bars=[]
for i in range(N):
tmp = acinput()
tmp.extend([tmp[0]-tmp[1],tmp[0]+tmp[1]])
bars.append(tmp)
bars=sorted(bars,key=lambda x:x[3])
print(bars)
count=0
R=-10000000000
for i in range(0,N):
if R<=bars[i][2]:
R=bars[i][3]
count+=1
print(count)
|
def acinput():
return list(map(int, input().split(" ")))
N=int(input())
bars=[]
for i in range(N):
tmp = acinput()
tmp.extend([tmp[0]-tmp[1],tmp[0]+tmp[1]])
bars.append(tmp)
bars=sorted(bars,key=lambda x:x[3])
#print(bars)
count=0
R=-10000000000
for i in range(0,N):
if R<=bars[i][2]:
R=bars[i][3]
count+=1
print(count)
|
[
"call.remove"
] | 601,449
| 601,450
|
u346308892
|
python
|
p02796
|
N = int(input())
XL = []
for i in range(N):
x,l = map(int,input().split())
XL.append((x-l+1,x+l-1))
XL.sort(key=lambda x: x[1])
ans = 0
t = -10**10
for i in range(N):
if t < XL[i][0]:
ans += 1
t = XL[i][1]
print(ans)
|
N = int(input())
XL = []
for i in range(N):
x,l = map(int,input().split())
XL.append((x-l,x+l-1))
XL.sort(key=lambda x: x[1])
ans = 0
t = -10**10
for i in range(N):
if t < XL[i][0]:
ans += 1
t = XL[i][1]
print(ans)
|
[
"expression.operation.binary.remove"
] | 601,466
| 601,467
|
u032267656
|
python
|
p02796
|
N = int(input())
XL = []
for i in range(N):
x,l = map(int,input().split())
XL.append((x-l+1,x+l-1))
XL.sort(key=lambda x: (x[1]))
ans = 0
t = -10**9
for i in range(N):
if t <= XL[i][0]:
ans += 1
t = XL[i][1]
print(ans)
|
N = int(input())
XL = []
for i in range(N):
x,l = map(int,input().split())
XL.append((x-l,x+l-1))
XL.sort(key=lambda x: x[1])
ans = 0
t = -10**10
for i in range(N):
if t < XL[i][0]:
ans += 1
t = XL[i][1]
print(ans)
|
[
"expression.operation.binary.remove",
"call.arguments.change",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,468
| 601,467
|
u032267656
|
python
|
p02796
|
# -*- coding: utf-8 -*-
N = int(input())
robot_number = 0
arm_ranges = []
for n in range(N):
[x, l] = [int(i) for i in input().split()]
minimum = x - l
maximum = x + l
arm_ranges.append((maximum, minimum))
# 腕の届く端が小さいもの順にソート
arm_ranges_sorted = sorted(arm_ranges)
(ma, mi) = arm_ranges_sorted[0]
now_max = ma
robot_number += 1
for arm_range in arm_ranges_sorted[1:]:
(ma, mi) = arm_range
if mi >= now_max:
robot_number += 1
print(robot_number)
|
# -*- coding: utf-8 -*-
N = int(input())
robot_number = 0
arm_ranges = []
for n in range(N):
[x, l] = [int(i) for i in input().split()]
minimum = x - l
maximum = x + l
arm_ranges.append((maximum, minimum))
# 腕の届く端が小さいもの順にソート
arm_ranges_sorted = sorted(arm_ranges)
(ma, mi) = arm_ranges_sorted[0]
now_max = ma
robot_number += 1
for arm_range in arm_ranges_sorted[1:]:
(ma, mi) = arm_range
if mi >= now_max:
robot_number += 1
now_max = ma
print(robot_number)
|
[
"assignment.add"
] | 601,472
| 601,471
|
u169501420
|
python
|
p02796
|
import numpy as np
N=int(input())
XL=[]
for i in range(N):
XL.append(list(map(int,list(input().split()))))
XL=np.asarray(XL)
XLs=XL[np.argsort(XL[:,0])]
right=XLs[0][0]+XLs[0][1]
ans=1
for i in range(N-1):
if right-(XLs[i+1][0]+XLs[i+1][1])>0:
right=XLs[i+1][0]+XLs[i+1][1]
elif XLs[i+1][0]-XLs[i+1][1]-right>=0:
ans+=1
right=XLs[i+1][0]-XLs[i+1][1]
print(ans)
|
import numpy as np
N=int(input())
XL=[]
for i in range(N):
XL.append(list(map(int,list(input().split()))))
XL=np.asarray(XL)
XLs=XL[np.argsort(XL[:,0])]
right=XLs[0][0]+XLs[0][1]
ans=1
for i in range(N-1):
if right-(XLs[i+1][0]+XLs[i+1][1])>0:
right=XLs[i+1][0]+XLs[i+1][1]
elif XLs[i+1][0]-XLs[i+1][1]-right>=0:
ans+=1
right=XLs[i+1][0]+XLs[i+1][1]
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 601,484
| 601,485
|
u193657135
|
python
|
p02796
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if x[mid] >= n:
rr = mid
else:
ll = mid+1
n = onem()
a = []
b = []
for i in range(n):
x,c = m()
a.append([x-c-1,x+c-1])
b.append([x-c-1,x+c-1])
a.sort(key = lambda x:(x[1]))
b.sort()
aa = []
for i in range(n):
if not aa:
aa.append(a[0])
bbb = a[0][1]
else:
if bbb <= a[i][0]:
aa.append(a[i])
bbb = a[i][1]
else:
continue
print(aa)
print(len(aa))
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if x[mid] >= n:
rr = mid
else:
ll = mid+1
n = onem()
a = []
b = []
for i in range(n):
x,c = m()
a.append([x-c-1,x+c-1])
b.append([x-c-1,x+c-1])
a.sort(key = lambda x:(x[1]))
b.sort()
aa = []
for i in range(n):
if not aa:
aa.append(a[0])
bbb = a[0][1]
else:
if bbb <= a[i][0]:
aa.append(a[i])
bbb = a[i][1]
else:
continue
print(len(aa))
|
[
"call.remove"
] | 601,496
| 601,497
|
u807772568
|
python
|
p02796
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if x[mid] >= n:
rr = mid
else:
ll = mid+1
n = onem()
a = []
b = []
for i in range(n):
x,c = m()
a.append([x-c-1,x+c-1])
b.append([x-c-1,x+c-1])
a.sort(key = lambda x:(x[1]))
b.sort()
aa = []
for i in range(n):
if not aa:
aa.append(a[0])
bbb = a[0][1]
else:
if bbb <= a[i][0]:
aa.append(a[i])
bbb = a[0][1]
else:
continue
print(aa)
print(len(aa))
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if x[mid] >= n:
rr = mid
else:
ll = mid+1
n = onem()
a = []
b = []
for i in range(n):
x,c = m()
a.append([x-c-1,x+c-1])
b.append([x-c-1,x+c-1])
a.sort(key = lambda x:(x[1]))
b.sort()
aa = []
for i in range(n):
if not aa:
aa.append(a[0])
bbb = a[0][1]
else:
if bbb <= a[i][0]:
aa.append(a[i])
bbb = a[i][1]
else:
continue
print(len(aa))
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.remove"
] | 601,498
| 601,497
|
u807772568
|
python
|
p02796
|
N = int(input())
arr = [list(map(int,input().split())) for i in range(N)]
arr = sorted(arr, key=lambda x: x[0])
F = [True]*N
P = [0]*N
for i in range(N):
P[i] = [arr[i][0]-arr[i][1], arr[i][0]+arr[i][1]]
P = sorted(P,key=lambda x:x[1])
ind = 0
for i in range(1,N):
if P[i][0] < P[ind][1]:
F[i] = False
else:
ind += 1
print(F.count(True))
|
N = int(input())
arr = [list(map(int,input().split())) for i in range(N)]
arr = sorted(arr, key=lambda x: x[0])
F = [True]*N
P = [0]*N
for i in range(N):
P[i] = [arr[i][0]-arr[i][1], arr[i][0]+arr[i][1]]
P = sorted(P,key=lambda x:x[1])
ind = 0
for i in range(1,N):
if P[i][0] < P[ind][1]:
F[i] = False
else:
ind = i
print(F.count(True))
|
[] | 601,516
| 601,517
|
u957872856
|
python
|
p02796
|
from itertools import groupby
from operator import itemgetter
import numpy as np
N = int(input())
arm = []
for i in range(N):
x, l = map(int, input().split())
a = [x-l+1, x+l-1]
arm.append(a)
arm = sorted(arm, key=lambda x: x[1])
now = arm[0][1]
count = 1
for i in range(1,N):
if now < arm[i][0]:
count += 1
now = arm[i][1]
print(count)
|
from itertools import groupby
from operator import itemgetter
import numpy as np
N = int(input())
arm = []
for i in range(N):
x, l = map(int, input().split())
a = [x-l, x+l]
arm.append(a)
arm = sorted(arm, key=lambda x: x[1])
now = arm[0][1]
count = 1
for i in range(1,N):
if now <= arm[i][0]:
count += 1
now = arm[i][1]
print(count)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,526
| 601,527
|
u025287757
|
python
|
p02796
|
from operator import itemgetter
N= int(input())
ans = 1
a = []
for i in range(N):
tmpa, tmpb = map(int,input().split())
a.append([tmpa+tmpb, tmpa-tmpb])
a.sort()
tmp = a[0][1]
for i in range(1, N):
if a[i][0] >= tmp:
ans += 1
tmp = a[i][1]
print(ans)
|
from operator import itemgetter
N= int(input())
ans = 1
a = []
for i in range(N):
tmpa, tmpb = 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)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 601,531
| 601,532
|
u143903328
|
python
|
p02796
|
N = int(input())
XL = []
for i in range(N):
tmp = list(map(int, input().split()))
XL.append(tmp)
XL = sorted(XL, key=lambda x:x[0])
i = 0
now = 0
count = 0
while i <= len(XL)-2:
now_arm = XL[now][0] + XL[now][1]
if now_arm > XL[i+1][0] - XL[i+1][1]:
count += 1
if XL[i+1][0] + XL[i+1][0] < now_arm:
now = i+1
else:
pass
else:
now = i+1
i += 1
#print(XL)
print(len(XL) - count)
|
N = int(input())
XL = []
for i in range(N):
tmp = list(map(int, input().split()))
XL.append(tmp)
XL = sorted(XL, key=lambda x:x[0])
i = 0
now = 0
count = 0
while i <= len(XL)-2:
now_arm = XL[now][0] + XL[now][1]
if now_arm > XL[i+1][0] - XL[i+1][1]:
count += 1
if XL[i+1][0] + XL[i+1][1] < now_arm:
now = i+1
else:
pass
else:
now = i+1
i += 1
#print(XL)
print(len(XL) - count)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 601,539
| 601,540
|
u572193732
|
python
|
p02796
|
N = int(input())
XL = []
for i in range(N):
tmp = list(map(int, input().split()))
XL.append(tmp)
XL = sorted(XL, key=lambda x:x[0])
i = 0
now = 0
count = 0
while i <= len(XL)-2:
now_arm = XL[now][0] + XL[now][1]
if now_arm > XL[i+1][0] - XL[i+1][1]:
count += 1
if XL[i+1][0] + XL[i+1][0] < now_arm:
now = i
else:
pass
else:
now = i
i += 1
#print(XL)
print(len(XL) - count)
|
N = int(input())
XL = []
for i in range(N):
tmp = list(map(int, input().split()))
XL.append(tmp)
XL = sorted(XL, key=lambda x:x[0])
i = 0
now = 0
count = 0
while i <= len(XL)-2:
now_arm = XL[now][0] + XL[now][1]
if now_arm > XL[i+1][0] - XL[i+1][1]:
count += 1
if XL[i+1][0] + XL[i+1][1] < now_arm:
now = i+1
else:
pass
else:
now = i+1
i += 1
#print(XL)
print(len(XL) - count)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 601,541
| 601,540
|
u572193732
|
python
|
p02796
|
import sys
input = sys.stdin.readline
N = int(input())
start = []
end = []
itv = []
for i in range(N):
X, L = (int(i) for i in input().split())
itv.append([X+L-1, X-L+1])
#start.append(X-L)
#end.append(X+L)
#XL = [[int(i) for i in input().split()] for i in range(N)]
#line = [0] * (2*(10**9) +1)
itv.sort()
#print(itv)
ass = 0
tt = 0-10**9
for i in range(N):
if tt < itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
import sys
input = sys.stdin.readline
N = int(input())
start = []
end = []
itv = []
for i in range(N):
X, L = (int(i) for i in input().split())
itv.append([X+L, X-L])
#start.append(X-L)
#end.append(X+L)
#XL = [[int(i) for i in input().split()] for i in range(N)]
#line = [0] * (2*(10**9) +1)
itv.sort()
#print(itv)
ass = 0
tt = 0-10**9
for i in range(N):
if tt <= itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,544
| 601,545
|
u077141270
|
python
|
p02796
|
N = int(input())
li = []
for i in range(N):
hontai, ude = map(int, input().split())
li.append([hontai, ude, hontai-ude, hontai+ude])
li.sort(key=lambda x:x[3])
#print(li)
count = 1
now = li[0][3]
for i in range(1, N):
if now <= li[i][2]:
count += 1
now = li[i][2]
#print(now, count)
print(count)
|
N = int(input())
li = []
for i in range(N):
hontai, ude = map(int, input().split())
li.append([hontai, ude, hontai-ude, hontai+ude])
li.sort(key=lambda x:x[3])
#print(li)
count = 1
now = li[0][3]
for i in range(1, N):
if now <= li[i][2]:
count += 1
now = li[i][3]
#print(now, count)
print(count)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 601,552
| 601,553
|
u133566678
|
python
|
p02796
|
# -*- coding: utf-8 -*-
def main():
n = int(input())
y = list()
for i in range(n):
xi, li = map(int, input().split())
y.append((xi - li + 1, xi + li - 1))
count = 1
sorted_y = sorted(y, key=lambda x: x[1])
end_point = sorted_y[0][1]
for left, right in sorted_y[1:]:
if left > end_point:
end_point = right
count += 1
print(count)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
def main():
n = int(input())
y = list()
for i in range(n):
xi, li = map(int, input().split())
# y.append((xi - li + 1, xi + li - 1))
y.append((xi - li, xi + li))
count = 1
sorted_y = sorted(y, key=lambda x: x[1])
end_point = sorted_y[0][1]
for left, right in sorted_y[1:]:
if left >= end_point:
end_point = right
count += 1
print(count)
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,598
| 601,599
|
u226108478
|
python
|
p02796
|
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N=int(input())
l=[]
for i in range(N):
a,b=map(int,input().split())
st,fin=(a-b,a+b)
l.append([fin,st])
list=sorted(l)
pt=list[0][0]
cnt=1
print(list)
for j in range(1,N):
if pt<= list[j][1]:
cnt+=1
pt=list[j][0]
print(cnt)
|
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N=int(input())
l=[]
for i in range(N):
a,b=map(int,input().split())
st,fin=(a-b,a+b)
l.append([fin,st])
list=sorted(l)
pt=list[0][0]
cnt=1
for j in range(1,N):
if pt<= list[j][1]:
cnt+=1
pt=list[j][0]
print(cnt)
|
[
"call.remove"
] | 601,600
| 601,601
|
u474925961
|
python
|
p02796
|
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N=int(input())
l=[]
for i in range(N):
a,b=map(int,input().split())
st,fin=(a-b,a+b)
l.append([fin,st])
list=sorted(l)
pt=list[0][1]
cnt=1
for j in range(1,N):
if pt<= list[j][1]:
cnt+=1
pt=list[j][0]
print(cnt)
|
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N=int(input())
l=[]
for i in range(N):
a,b=map(int,input().split())
st,fin=(a-b,a+b)
l.append([fin,st])
list=sorted(l)
pt=list[0][0]
cnt=1
for j in range(1,N):
if pt<= list[j][1]:
cnt+=1
pt=list[j][0]
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 601,602
| 601,601
|
u474925961
|
python
|
p02796
|
n=int(input())
AB=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l
b=x+l
AB.append((a,b))
cnt=1
AB.sort(key=lambda L:L[1], reverse=True)
simekiri=AB[0][0]
for i in range(1,n):
migi=AB[i][1]
hidari=AB[i][0]
if migi<=simekiri:
cnt+=1
simekiri=hidari
print(cnt)
|
n=int(input())
AB=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l
b=x+l
AB.append((a,b))
cnt=1
AB.sort(key=lambda L:L[0],reverse=True)
simekiri=AB[0][0]
for i in range(1,n):
migi=AB[i][1]
hidari=AB[i][0]
if migi<=simekiri:
cnt+=1
simekiri=hidari
print(cnt)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 601,603
| 601,604
|
u994521204
|
python
|
p02796
|
N = int(input())
XL = []
for i in range(N):
array = list(map(int, input().strip().split()))
XL.append(array)
XL = sorted(XL)
Y = 0
cnt = 0
for i in range(N):
if XL[i][0]-XL[i][1]>=Y:
cnt += 1
Y = XL[i][0]+XL[i][1]
else:
Y = min(Y,XL[i][0]+XL[i][1])
print(cnt)
|
N = int(input())
XL = []
for i in range(N):
array = list(map(int, input().strip().split()))
XL.append(array)
XL = sorted(XL)
Y = 0
cnt = 0
for i in range(N):
if max(XL[i][0]-XL[i][1],0)>=Y:
cnt += 1
Y = XL[i][0]+XL[i][1]
else:
Y = min(Y,XL[i][0]+XL[i][1])
print(cnt)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 601,608
| 601,609
|
u212786022
|
python
|
p02796
|
N = int(input())
A = []
for _ in range(N):
x, l = map(int, input().split())
A.append((x+l-1, x-l+1))
A.sort()
now = A[0][0]
ans = 1
for r, l in A:
if now<l:
ans+=1
now = r
print(ans)
|
N = int(input())
A = []
for _ in range(N):
x, l = map(int, input().split())
A.append((x+l, x-l+1))
A.sort()
now = A[0][0]
ans = 1
for r, l in A:
if now<l:
ans+=1
now = r
print(ans)
|
[
"expression.operation.binary.remove"
] | 601,617
| 601,618
|
u310678820
|
python
|
p02796
|
n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r + 1, p + r - 1) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] <= segs[i][0]:
left = mid
else:
right = mid
if left != -1:
dp[i] = max(dp[i], 1 + dp[left])
print(dp[n - 1])
|
n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r, p + r) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] <= segs[i][0]:
left = mid
else:
right = mid
if left != -1:
dp[i] = max(dp[i], 1 + dp[left])
print(dp[n - 1])
|
[
"expression.operation.binary.remove"
] | 601,631
| 601,632
|
u953237709
|
python
|
p02796
|
n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r + 1, p + r - 1) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] < segs[i][0]:
left = mid
else:
right = mid
if left != -1:
dp[i] = max(dp[i], 1 + dp[left])
print(dp[n - 1])
|
n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r, p + r) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] <= segs[i][0]:
left = mid
else:
right = mid
if left != -1:
dp[i] = max(dp[i], 1 + dp[left])
print(dp[n - 1])
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,633
| 601,632
|
u953237709
|
python
|
p02796
|
N = int(input())
XL = sorted([list(map(int, input().split())) for _ in range(N)])
remove = 0
reach = 0
for i in range(N):
r = XL[i]
right = r[0] + r[1]
left = r[0] - r[1]
if i == 0:
reach = right
continue
if reach > left:
reach = max(reach, right)
remove += 1
else:
reach = right
print(N - remove)
|
N = int(input())
XL = sorted([list(map(int, input().split())) for _ in range(N)])
remove = 0
reach = 0
for i in range(N):
r = XL[i]
right = r[0] + r[1]
left = r[0] - r[1]
if i == 0:
reach = right
continue
if reach > left:
reach = min(reach, right)
remove += 1
else:
reach = right
print(N - remove)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 601,636
| 601,637
|
u596368396
|
python
|
p02796
|
n = int(input())
itv = []
for i in range(n):
x,l = map(int, input().split())
s = x-l+1
t = x+l-1
itv.append([t,s])
itv.sort()
ass = 1
tt = itv[0][0]
for i in range(1,n):
if tt < itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
n = int(input())
itv = []
for i in range(n):
x, l = map(int, input().split())
s = x-l
t = x+l
itv.append([t, s])
itv.sort()
ass = 1
tt = itv[0][0]
for i in range(1, n):
if tt <= itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,638
| 601,639
|
u906428167
|
python
|
p02796
|
def main():
N = int(input())
li = []
for _ in range(N):
a,b = [int(n) for n in input().split()]
li.append([a-b+1,a+b-1])
# li.sort(key=lambda x:x[0])
# last = (-10**10,-10**10)
res = N
# for a in li:
# if last[1] > a[1]:
# last = a
# res-=1
# elif last[1] > a[0]:
# last = last
# res-=1
# else:
# last = a
li.sort(key=lambda x:-x[0])
last = (10**10,10**10)
for a in li:
if a[1] > last[0]:
last = last
res-=1
else:
last=a
print(res)
main()
|
def main():
N = int(input())
li = []
for _ in range(N):
a,b = [int(n) for n in input().split()]
li.append([a-b,a+b])
# li.sort(key=lambda x:x[0])
# last = (-10**10,-10**10)
res = N
# for a in li:
# if last[1] > a[1]:
# last = a
# res-=1
# elif last[1] > a[0]:
# last = last
# res-=1
# else:
# last = a
li.sort(key=lambda x:-x[0])
# print(li)
last = (10**10,10**10)
for a in li:
if a[1] > last[0]:
last = last
res-=1
else:
last=a
print(res)
main()
|
[
"expression.operation.binary.remove"
] | 601,677
| 601,678
|
u974620347
|
python
|
p02796
|
N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < count:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
|
N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < N:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
|
[
"identifier.change",
"control_flow.loop.condition.change"
] | 601,693
| 601,694
|
u868600519
|
python
|
p02796
|
N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while i < count - 1:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
|
N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < N:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
|
[
"identifier.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 601,695
| 601,694
|
u868600519
|
python
|
p02796
|
N = int(input())
XL = []
for n in range(N):
XL.append([int(x) for x in input().split()])
XL = sorted(XL, key=lambda x:(x[0],x[1]))
m = -float("inf")
ans = 0
for n in range(N):
if XL[n][0]-XL[n][1] >= m:
ans += 1
m = XL[n][0]+XL[n][1]
print(ans)
|
N = int(input())
XL = []
for n in range(N):
XL.append([int(x) for x in input().split()])
XL = sorted(XL, key=lambda x:x[0]+x[1])
m = -float("inf")
ans = 0
for n in range(N):
if XL[n][0]-XL[n][1] >= m:
ans += 1
m = XL[n][0]+XL[n][1]
print(ans)
|
[
"call.arguments.change",
"assignment.value.change"
] | 601,730
| 601,729
|
u853010060
|
python
|
p02796
|
n = int(input())
robos = []
for i in range(n):
x,l = map(int,input().split())
robos.append([x-l+1,x+l-1])
robos.sort(key= lambda x:x[1])
# print(robos)
edge = -10000000000
out = 0
for i in range(n):
if robos[i][0] > edge:
out += 1
edge = robos[i][1]
else:
continue
print(out)
|
n = int(input())
robos = []
for i in range(n):
x,l = map(int,input().split())
robos.append([x-l,x+l])
robos.sort(key= lambda x:x[1])
# print(robos)
edge = -10000000000000
out = 0
for i in range(n):
if robos[i][0] >= edge:
out += 1
edge = robos[i][1]
else:
continue
print(out)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,749
| 601,750
|
u231685196
|
python
|
p02796
|
import sys
input = sys.stdin.readline
n = int(input())
ans = 0
x = [0] * n
for i in range(n):
x[i] = tuple([int(x) for x in input().strip().split()])
x.sort()
pre = -float('inf')
for xx in x:
if pre > xx[0] - xx[1]:
if pre < xx[0] + xx[1]:
continue
else:
pre = xx[0] + xx[1]
ans += 1
pre = xx[0] + xx[1]
print(ans)
|
import sys
input = sys.stdin.readline
n = int(input())
ans = 0
x = [0] * n
for i in range(n):
x[i] = tuple([int(x) for x in input().strip().split()])
x.sort()
pre = -float('inf')
for xx in x:
if pre > xx[0] - xx[1]:
if pre < xx[0] + xx[1]:
continue
else:
pre = xx[0] + xx[1]
continue
ans += 1
pre = xx[0] + xx[1]
print(ans)
|
[
"control_flow.continue.add"
] | 601,753
| 601,754
|
u408620326
|
python
|
p02796
|
n = int(input())
machine = []
machine_left = []
machine_right = []
for i in range(n):
x, l = [ int(v) for v in input().split() ]
machine.append((x-l, x+l))
machine.sort(key = lambda x: x[1])
s = machine[0][1]
ans = 1
for l, r in machine[1:]:
if l >= s:
r = s
ans += 1
print(ans)
|
n = int(input())
machine = []
machine_left = []
machine_right = []
for i in range(n):
x, l = [ int(v) for v in input().split() ]
machine.append((x-l, x+l))
machine.sort(key = lambda x: x[1])
s = machine[0][1]
ans = 1
for l, r in machine[1:]:
if l >= s:
s = r
ans += 1
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 601,782
| 601,783
|
u399721252
|
python
|
p02796
|
n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]+1:
x, l = xl[i]
else:
ans -= 1
print(ans)
|
n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]:
x, l = xl[i]
else:
ans -= 1
print(ans)
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 601,793
| 601,794
|
u832152513
|
python
|
p02796
|
n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 <= xl[i][0]-xl[i][1]+1:
x, l = xl[i]
else:
ans -= 1
print(ans)
|
n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]:
x, l = xl[i]
else:
ans -= 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 601,795
| 601,794
|
u832152513
|
python
|
p02796
|
# Keyence B
N = int(input())
robot_list = []
robot_count = 0
for _ in range(N):
x, l = map(int, input().split())
robot_list.append([x - l, x + l])
robot_list.sort()
r = - 10**9 - 1
for i in range(N):
if r <= robot_list[i][0]:
robot_count += 1
r = robot_list[i][1]
print(robot_count)
|
# Keyence B
N = int(input())
robot_list = []
robot_count = 0
for _ in range(N):
x, l = map(int, input().split())
robot_list.append([x + l, x - l])
robot_list.sort()
r = - 10**9 - 1
for i in range(N):
if r <= robot_list[i][1]:
robot_count += 1
r = robot_list[i][0]
print(robot_count)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 601,809
| 601,810
|
u998679483
|
python
|
p02796
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l+1, x-l-1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 601,811
| 601,812
|
u201234972
|
python
|
p02796
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now < a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 601,813
| 601,812
|
u201234972
|
python
|
p02796
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now < a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l, x-l))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now <= a:
now = b
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,813
| 601,814
|
u201234972
|
python
|
p02796
|
N=int(input())
rang=[]
for _ in range(N):
x,l=map(int,input().split())
rang.append((x-l, x+l))
rang=sorted(rang, key=lambda x: x[0])
lastright=rang[0][1]
cnt=1
for i in range(1,N):
left=rang[i][0]
right=rang[i][1]
if left>=lastright:
cnt+=1
lastright=right
print(cnt)
|
N=int(input())
rang=[]
for _ in range(N):
x,l=map(int,input().split())
rang.append((x-l, x+l))
rang=sorted(rang, key=lambda x: x[1])
lastright=rang[0][1]
cnt=1
for i in range(1,N):
left=rang[i][0]
right=rang[i][1]
if left>=lastright:
cnt+=1
lastright=right
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 601,815
| 601,816
|
u260216890
|
python
|
p02796
|
N = int(input())
num_array = [[0]*2 for i in range(N)]
for i in range(N):
x, l = map(int, input().split())
small = x-l
if small <= 0:
small = 0
big = x+l
num_array[i][0] = small
num_array[i][1] = big
num_array.sort()
tmp_r = -(10**18)
count = 0
for l, r in num_array:
if tmp_r > l:
continue
count += 1
tmp_r = r
print(count)
|
N = int(input())
num_array = [[0]*2 for i in range(N)]
for i in range(N):
x, l = map(int, input().split())
small = x-l
if small <= 0:
small = 0
big = x+l
num_array[i][1] = small
num_array[i][0] = big
num_array.sort()
tmp_r = -(10**18)
count = 0
for r, l in num_array:
if tmp_r > l:
continue
count += 1
tmp_r = r
print(count)
|
[
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 601,817
| 601,818
|
u836939578
|
python
|
p02796
|
n = int(input())
lis=[]
count=0
for i in range(n):
li=[None]*2
x, l = map(int, input().split())
li[0] = x+l
li[1] = x-l
lis.append(li)
lis.sort()
kari_r = -(10 ** 18)
print(lis)
for r, l in lis:
if kari_r > l:
continue
count+=1
kari_r = r
print(count)
|
n = int(input())
lis=[]
count=0
for i in range(n):
li=[None]*2
x, l = map(int, input().split())
li[0] = x+l
li[1] = x-l
lis.append(li)
lis.sort()
kari_r = -(10 ** 18)
for r, l in lis:
if kari_r > l:
continue
count+=1
kari_r = r
print(count)
|
[
"call.remove"
] | 601,823
| 601,824
|
u272336707
|
python
|
p02796
|
n = int(input())
x = [0]*n
l = [0]*n
for i in range(n):
x[i] , l[i] = map(int, input().split())
itv = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
a = x[i]+l[i]
b = x[i]-l[i]
itv[i][0] = a
itv[i][1] = b
itv.sort()
ans = 0
curx = -1000000000
for i in range(n):
if curx <= itv[i][0]:
curx = itv[i][1]
ans += 1
print(ans)
|
n = int(input())
x = [0]*n
l = [0]*n
for i in range(n):
x[i] , l[i] = map(int, input().split())
itv = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
a = x[i]+l[i]
b = x[i]-l[i]
itv[i][0] = a
itv[i][1] = b
itv.sort()
ans = 0
curx = -10000000000
for i in range(n):
if curx <= itv[i][1]:
curx = itv[i][0]
ans += 1
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 601,830
| 601,831
|
u246217175
|
python
|
p02796
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n = II()
lis = []
for _ in range(n):
x, l = LI()
lis.append((x + l, x - l))
lis.sort()
ans = 0
now = 0
for r, l in lis:
if now <= l:
now = r
ans += 1
print(ans)
return
#main
if __name__ == '__main__':
solve()
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n = II()
lis = []
for _ in range(n):
x, l = LI()
lis.append((x + l, x - l))
lis.sort()
ans = 0
now = -inf
for r, l in lis:
if now <= l:
now = r
ans += 1
print(ans)
return
#main
if __name__ == '__main__':
solve()
|
[
"assignment.value.change",
"expression.operation.unary.add"
] | 601,836
| 601,837
|
u423585790
|
python
|
p02796
|
N = int(input())
A = []
for i in range(a):
x, l = map(int, input().split())
A.append([x+l, x-l])
A.sort()
ans = 1
check1 = A[0]
for i in range(1, N):
check2 = A[i]
if check1[0] <= check2[1]:
ans += 1
check1 = check2
print(ans)
|
N = int(input())
A = []
for i in range(N):
x, l = map(int, input().split())
A.append([x+l, x-l])
A.sort()
ans = 1
check1 = A[0]
for i in range(1, N):
check2 = A[i]
if check1[0] <= check2[1]:
ans += 1
check1 = check2
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 601,840
| 601,841
|
u327532412
|
python
|
p02796
|
n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a-b+1,a+b])
l.sort(key=lambda x: x[1])
ans=1
nl=l[0][0]
nr=l[0][1]
for i in range(1,n):
if l[i][0]<nr:
continue
else:
nr=l[i][1]
ans+=1
print(ans)
|
n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a-b,a+b])
l.sort(key=lambda x: x[1])
ans=1
nl=l[0][0]
nr=l[0][1]
for i in range(1,n):
if l[i][0]<nr:
continue
else:
nr=l[i][1]
ans+=1
print(ans)
|
[
"expression.operation.binary.remove"
] | 601,912
| 601,913
|
u223904637
|
python
|
p02796
|
n,*t=map(int,open(0).read().split())
*z,=sorted(zip(*[iter(t)]*2))
s=set()
for i in range(n-1):
if i in s:
continue
x,l=z[i]
j=i+1
while 1:
y,r=z[j]
if x+l>y-r:
if y+r<x+l:
s|={i}
else:
s|={j}
else:
break
j+=1
if j==n:break
print(n-len(s))
|
n,*t=map(int,open(0).read().split())
*z,=sorted(zip(*[iter(t)]*2))
s=set()
for i in range(n-1):
if i in s:
continue
x,l=z[i]
j=i+1
while 1:
y,r=z[j]
if x+l>y-r:
if y+r<x+l:
s|={i}
break
else:
s|={j}
else:
break
j+=1
if j==n:break
print(n-len(s))
|
[
"control_flow.break.add"
] | 601,914
| 601,915
|
u729133443
|
python
|
p02796
|
N = int(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(a)
print(ans)
|
N = int(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)
|
[
"call.remove"
] | 601,919
| 601,920
|
u325282913
|
python
|
p02796
|
n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[0],x[1]))
A=1
P=lists[0]
#貪欲法
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A)
|
n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[1]))
A=1
P=lists[0]
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A)
|
[] | 601,921
| 601,922
|
u780962115
|
python
|
p02796
|
n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[0],x[1]))
A=1
P=lists[0]
#貪欲法
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A)
|
n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[1]))
A=1
P=lists[0]
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A)
|
[] | 601,921
| 601,923
|
u780962115
|
python
|
p02796
|
N = int(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+1, x+l-1
if s >= right:
right = t
ans += 1
print(ans)
|
N = int(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)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,933
| 601,934
|
u761320129
|
python
|
p02796
|
N = int(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+1, x+l-1
if s > right:
right = t
ans += 1
print(ans)
|
N = int(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)
|
[
"expression.operation.binary.remove"
] | 601,935
| 601,934
|
u761320129
|
python
|
p02796
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt)
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,938
| 601,939
|
u094191970
|
python
|
p02796
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**10
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt)
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,940
| 601,939
|
u094191970
|
python
|
p02796
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**9
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt)
|
n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,941
| 601,939
|
u094191970
|
python
|
p02796
|
n=int(input())
li=[None]*n
for i in range(0,n):
flag=True
x,l=map(int, input().split())
li[i]=(x+l, x)
li=sorted(li)
count=1
x,y=li[0]
for i in range(1,n):
x2,y2=li[i]
if y2 < x:
continue
count=count+1
x=x2
print(count)
|
n=int(input())
li=[None]*n
for i in range(0,n):
flag=True
x,l=map(int, input().split())
li[i]=(x+l, x-l)
li=sorted(li)
count=1
x,y=li[0]
for i in range(1,n):
x2,y2=li[i]
if y2 < x:
continue
count=count+1
x=x2
print(count)
|
[
"assignment.change"
] | 601,952
| 601,953
|
u698849142
|
python
|
p02796
|
n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_right = r
print(ans)
|
n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_r = r
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 601,956
| 601,957
|
u305366205
|
python
|
p02796
|
n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = n
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_right = r
print(ans)
|
n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_r = r
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.variable.change",
"identifier.change"
] | 601,958
| 601,957
|
u305366205
|
python
|
p02796
|
import sys
from operator import itemgetter
n = int(input())
robots = []
for line in sys.stdin:
X, L = map(int, line.split())
l, r = X - L, X + L
robots.append((l, r))
robots.sort(key=itemgetter(1))
curr = -1
ans = 0
for l, r in robots:
if curr > l:
continue
ans += 1
curr = r
print(ans)
|
import sys
from operator import itemgetter
n = int(input())
robots = []
for line in sys.stdin:
X, L = 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
ans += 1
curr = r
print(ans)
|
[
"assignment.value.change"
] | 601,966
| 601,967
|
u340781749
|
python
|
p02796
|
N=int(input())
ES = []
for i in range(N):
x,l = list(map(int,input().split()))
ES.append((x+l,x-l))
ES = sorted(ES)
sel = []
cur = None
ans = 0
for E,S in ES:
if cur is None or cur <= S:
sel.append((S,E))
cur = E
print(ans)
|
N=int(input())
ES = []
for i in range(N):
x,l = list(map(int,input().split()))
ES.append((x+l,x-l))
ES = sorted(ES)
sel = []
cur = None
ans = 0
for E,S in ES:
if cur is None or cur <= S:
sel.append((S,E))
cur = E
ans += 1
print(ans)
|
[] | 601,971
| 601,972
|
u335830383
|
python
|
p02796
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0] < r:
ans -= 1
else:
l, r = robo[1]
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0] < r:
ans -= 1
else:
l, r = robo[i]
print(ans)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 601,980
| 601,981
|
u076917070
|
python
|
p02796
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0] < r:
ans -= 1
else:
l, r = robo[1]
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0] < r:
ans -= 1
else:
l, r = robo[i]
print(ans)
if __name__ == '__main__':
main()
|
[
"call.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 601,982
| 601,981
|
u076917070
|
python
|
p02796
|
from operator import itemgetter
N = int(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):
ans+=1
S=X[i][1]
"""
while(len(X)>0):
#print(X)
ans+=1
S=X[0][1]
X.remove(X[0])
I = []
for i in range(len(X)):
if(X[i][0]>=S):
I.append(X[i])
X=I
#print(I)
"""
print(ans)
|
from operator import itemgetter
N = int(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):
ans+=1
S=X[i][1]
"""
while(len(X)>0):
#print(X)
ans+=1
S=X[0][1]
X.remove(X[0])
I = []
for i in range(len(X)):
if(X[i][0]>=S):
I.append(X[i])
X=I
#print(I)
"""
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,000
| 602,001
|
u492074881
|
python
|
p02796
|
n = int(input())
r = []
for i in range(n):
x, l = map(int, input().split())
r.append((x - l + 1, x + l - 1))
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)
|
n = int(input())
r = []
for i in range(n):
x, l = 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)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,004
| 602,005
|
u219197917
|
python
|
p02796
|
N = int(input())
xl = [list(map(int, input().split())) for _ in range(N)]
rl = []
for i in range(N):
rl.append((xl[i][0] - xl[i][1], xl[i][0] + xl[i][1]))
rl.sort(key=lambda x: x[1])
cnt = 0
tmp = -10 ** 18
print(rl)
for i, j in rl:
if tmp <= i:
cnt += 1
tmp = j
print(cnt)
|
N = int(input())
xl = [list(map(int, input().split())) for _ in range(N)]
rl = []
for i in range(N):
rl.append((xl[i][0] - xl[i][1], xl[i][0] + xl[i][1]))
rl.sort(key=lambda x: x[1])
cnt = 0
tmp = -10 ** 18
for i, j in rl:
if tmp <= i:
cnt += 1
tmp = j
print(cnt)
|
[
"call.remove"
] | 602,006
| 602,007
|
u311379832
|
python
|
p02796
|
n = int(input())
d = []
left = []
right = []
for i in range(n):
x,l = map(int, input().split())
# num , left , right
d.append([x-l,x+l])
d.sort()
p = d[0][1]
ans = n
for i in range(1,n):
if d[i][0] <= p:
ans -= 1
p = min(p,d[i][1])
else:
p = d[i][1]
print(ans)
|
n = int(input())
d = []
left = []
right = []
for i in range(n):
x,l = map(int, input().split())
# num , left , right
d.append([x-l,x+l])
d.sort()
p = d[0][1]
ans = n
for i in range(1,n):
if d[i][0] < p:
ans -= 1
p = min(p,d[i][1])
else:
p = d[i][1]
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,009
| 602,010
|
u934099192
|
python
|
p02796
|
n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l-1, x-l+1))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans)
|
n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l, x-l))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans)
|
[
"expression.operation.binary.remove"
] | 602,015
| 602,016
|
u382423941
|
python
|
p02796
|
n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l-1, x-l+1))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last < l:
ans += 1
last = r
print(ans)
|
n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l, x-l))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,017
| 602,016
|
u382423941
|
python
|
p02796
|
N = int(input())
S = [tuple(map(int, input().split())) for i in range(N)]
T = list(map(lambda j:(j[0]-j[1]+1, j[0]+j[1]-1), 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]
res = 1
print(res)
|
N = int(input())
S = [tuple(map(int, input().split())) for i in range(N)]
T = list(map(lambda j:(j[0]-j[1], j[0]+j[1]), 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]
res = 1
print(res)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,018
| 602,019
|
u259265086
|
python
|
p02796
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l+1, x+l-1))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur < l:
cur = r
cnt += 1
print(cnt)
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l, x+l))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur <= l:
cur = r
cnt += 1
print(cnt)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,026
| 602,027
|
u588341295
|
python
|
p02796
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l+1, x+l-1))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur < l:
cur = r
cnt += 1
print(cnt)
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l+0.5, x+l-0.5))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur < l:
cur = r
cnt += 1
print(cnt)
|
[
"call.arguments.change",
"expression.operation.binary.change"
] | 602,026
| 602,028
|
u588341295
|
python
|
p02796
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l+1, x+l-1))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur < l:
cur = r
cnt += 1
print(cnt)
|
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
LR = []
for i in range(N):
x, l = MAP()
LR.append((x-l, x+l-1))
LR.sort(key=itemgetter(1))
cur = -INF
cnt = 0
for l, r in LR:
if cur < l:
cur = r
cnt += 1
print(cnt)
|
[
"expression.operation.binary.remove"
] | 602,026
| 602,029
|
u588341295
|
python
|
p02796
|
n=int(input())
x=[]
l=[]
for i in range(n):
a,b=map(int,input().split())
x.append(a)
l.append(b)
ans = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
ans[i][1]=(x[i]+l[i])
ans[i][0]=max(0,x[i]-l[i])
ans.sort()
print(ans)
count=1
j=0
for i in range(n-1):
if ans[j][1]<=ans[i+1][0] :
count+=1
j=i+1
else:
if ans[j][1]>ans[i+1][1]:
j=i+1
print(count)
|
n=int(input())
x=[]
l=[]
for i in range(n):
a,b=map(int,input().split())
x.append(a)
l.append(b)
ans = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
ans[i][1]=(x[i]+l[i])
ans[i][0]=max(0,x[i]-l[i])
ans.sort()
count=1
j=0
for i in range(n-1):
if ans[j][1]<=ans[i+1][0] :
count+=1
j=i+1
else:
if ans[j][1]>ans[i+1][1]:
j=i+1
print(count)
|
[
"call.remove"
] | 602,048
| 602,049
|
u375695365
|
python
|
p02796
|
n=int(input())
X=[]
for i in range(n):
x,l=[int(_) for _ in input().split()]
X+=[tuple(x-l,x+l)]
X.sort(key=lambda x:x[0])
ans=n
tmp=X[0][1]
for i in range(1,n):
if tmp>X[i][0]:
ans-=1
tmp=min(tmp,X[i][1])
else:
tmp=X[i][1]
print(ans)
|
n=int(input())
X=[]
for i in range(n):
x,l=[int(_) for _ in input().split()]
X+=[(x-l,x+l)]
X.sort(key=lambda x:x[0])
ans=n
tmp=X[0][1]
for i in range(1,n):
if tmp>X[i][0]:
ans-=1
tmp=min(tmp,X[i][1])
else:
tmp=X[i][1]
print(ans)
|
[] | 602,058
| 602,059
|
u619197965
|
python
|
p02796
|
N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i]))
Range = sorted(Range, key = lambda x:x[2])
#print(Range)
a = 1
for i in range(N-1):
#print(Range[a][0], end = ","),print(Range[a-1][1])
if Range[a][0] >= Range[a-1][1]:
a += 1
else:
Range.pop(a)
#print(Range)
print(a)
|
N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i))
Range = sorted(Range, key = lambda x:x[1])
a = 1
for i in range(N-1):
if Range[a][0] >= Range[a-1][1]:
a += 1
else:
Range.pop(a)
print(a)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,067
| 602,068
|
u477915050
|
python
|
p02796
|
N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i]))
Range = sorted(Range, key = lambda x:x[2])
#print(Range)
a = 1
for i in range(N-1):
#print(Range[a][0], end = ","),print(Range[a-1][1])
if Range[a][0] >= Range[a-1][1]:
a += 1
else:
Range.pop(a)
#print(Range)
print(a)
|
N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i], l[i]))
Range = sorted(Range, key = lambda x:x[1])
#print(Range)
a = 1
for i in range(N-1):
#print(Range[a][0], end = ","),print(Range[a-1][1])
if Range[a][0] >= Range[a-1][1]:
a += 1
else:
#if Range[a][3] >= Range[a-1][3]:
Range.pop(a)
#else:
#Range.pop(a-1)
#print(Range)
print(a)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,067
| 602,069
|
u477915050
|
python
|
p02796
|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, XL):
s = []
for x, l in XL:
lp, rp = x-l+1, x+l-1
s.append((lp, rp))
s.sort(key=lambda x: x[1])
# s.sort(key=lambda x: x[0])
ans = 0
t = -INF
for l, r in s:
if t <= l:
ans += 1
t = r
return ans
def main():
N = read_int()
XL = [read_int_n() for _ in range(N)]
print(slv(N, XL))
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, XL):
s = []
for x, l in XL:
lp, rp = x-l, x+l
s.append((lp, rp))
s.sort(key=lambda x: x[1])
# s.sort(key=lambda x: x[0])
ans = 0
t = -INF
for l, r in s:
if t <= l:
ans += 1
t = r
return ans
def main():
N = read_int()
XL = [read_int_n() for _ in range(N)]
print(slv(N, XL))
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove"
] | 602,076
| 602,077
|
u334712262
|
python
|
p02796
|
import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l + 1, x + l - 1))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x < a[i][0]:
x = a[i][1]
res += 1
print(res)
|
import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,078
| 602,079
|
u141610915
|
python
|
p02796
|
import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l - 1))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res)
|
import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res)
|
[
"expression.operation.binary.remove"
] | 602,080
| 602,079
|
u141610915
|
python
|
p02796
|
N = int(input())
D = []
for i in range(N):
x, l = map(int, input().split())
D.append([x-l, x+l])
from operator import itemgetter
D = sorted(D, key = itemgetter(0))
u = -10**10 #最小値:x = 0, l = 10**10の時
cnt = 0
for a, b in D:
if u < a:
cnt += 1
u = b #つぎのロボットの範囲の下限に置きかえる
print(cnt)
|
N = int(input())
D = []
for i in range(N):
x, l = map(int, input().split())
D.append([x-l, x+l])
from operator import itemgetter
D = sorted(D, key = itemgetter(1))
u = -10**10 #最小値:x = 0, l = 10**10の時
cnt = 0
for a, b in D:
if u <= a:
cnt += 1
u = b #つぎのロボットの範囲の下限に置きかえる
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,083
| 602,082
|
u906481659
|
python
|
p02796
|
n = int(input())
xl = [list(map(int, input().split())) for i in range(n)]
xl = sorted([[x-l+1,x+l-1] for x,l in xl], key = lambda x: x[1])
now = - 10 ** 10
ans = 0
for s,e in xl:
if s > now:
ans += 1
now = e
print(ans)
|
n = int(input())
xl = [list(map(int, input().split())) for i in range(n)]
xl = sorted([[x-l,x+l] for x,l in xl], key = lambda x: x[1])
now = - 10 ** 10
ans = 0
for s,e in xl:
if s >= now:
ans += 1
now = e
print(ans)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,084
| 602,085
|
u102960641
|
python
|
p02796
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[1])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt)
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,093
| 602,094
|
u417365712
|
python
|
p02796
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt)
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,095
| 602,094
|
u417365712
|
python
|
p02796
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l+1, x+l-1))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 < l:
cnt += 1
r0 = r
print(cnt)
|
import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,096
| 602,094
|
u417365712
|
python
|
p02796
|
N = int(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 < itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
N = int(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 <= itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,099
| 602,100
|
u497952650
|
python
|
p02796
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
x = []
for _ in range(N):
X, L = MAP()
x.append([X-L+1, X+L-1])
x.sort(key = lambda x: x[1])
ans = 0
tmp = -INF
for l, r in x:
if tmp < l:
tmp = r
ans += 1
print(ans)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
x = []
for _ in range(N):
X, L = MAP()
x.append([X-L, X+L])
x.sort(key = lambda x: x[1])
ans = 0
tmp = -INF
for l, r in x:
if tmp <= l:
tmp = r
ans += 1
print(ans)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,175
| 602,176
|
u285891772
|
python
|
p02796
|
n = int(input())
robot = [0]*n
for i in range(n):
x,l = map(int,input().split())
robot[i] = (x-l, x+l)
robot.sort()
ans = 1
right = robot[0][1]
for i in range(1,n):
if right <= robot[i][0]:
right = robot[i][1]
ans += 1
print(ans)
|
n = int(input())
robot = [0]*n
for i in range(n):
x,l = map(int,input().split())
robot[i] = (x+l, x-l)
robot.sort()
#print(robot)
ans = 1
right = robot[0][0]
for i in range(1,n):
if right <= robot[i][1]:
right = robot[i][0]
ans += 1
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 602,182
| 602,183
|
u855831834
|
python
|
p02796
|
N, *XL = 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 a, b in XL:
if a >= curr:
curr = b
ans += 1
print(ans)
|
N, *XL = 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)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 602,205
| 602,206
|
u888092736
|
python
|
p02796
|
(N,), *XL = [list(map(int, s.split())) for s in open(0)]
XL.sort(key=lambda x: x[0] + x[1])
print(XL)
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, 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)
|
[
"call.remove"
] | 602,207
| 602,208
|
u888092736
|
python
|
p02796
|
n=int(input())
lr=[]
for i in range(n):
x,l=map(int,input().split())
lr.append((x-l,x+1))
lr.sort(key=lambda x: x[1])
ans=0
l=-10**18
r=0
for i in range(n):
if i==0:
tl,tr=lr[i]
l=tl
r=tr
ans+=1
continue
tl,tr=lr[i]
if tl>=r:
ans+=1
r=tr
l=tl
print(ans)
|
n=int(input())
lr=[]
for i in range(n):
x,l=map(int,input().split())
lr.append((x-l,x+l))
lr.sort(key=lambda x: x[1])
ans=0
l=-10**18
r=0
for i in range(n):
if i==0:
tl,tr=lr[i]
l=tl
r=tr
ans+=1
continue
tl,tr=lr[i]
if tl>=r:
ans+=1
r=tr
l=tl
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 602,209
| 602,210
|
u970197315
|
python
|
p02796
|
n=int(input())
import bisect
L=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l+1
b=x+l-1
L.append((b,a))
L=sorted(L)
rob=1
bottom=L[0][0]
for i in range(1,n):
if L[i][1]>bottom:
rob += 1
bottom=L[i][0]
print(rob)
|
n=int(input())
import bisect
L=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l+0.1
b=x+l-0.1
L.append((b,a))
L=sorted(L)
rob=1
bottom=L[0][0]
for i in range(1,n):
if L[i][1]>bottom:
rob += 1
bottom=L[i][0]
print(rob)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 602,211
| 602,212
|
u216752093
|
python
|
p02796
|
N = int(input())
LR = [[0,0] for _ in range(N)]
for i in range(N):
a,b = map(int, input().split())
LR.append([a-b,a+b])
LR.sort(key=lambda x: x[0])
prev_right = - 10**9 #一つ前の右端
cnt = 0
for i in range(N):
if LR[i][0]>=prev_right: #次の左端が前の右端以上なら
cnt += 1
prev_right = LR[i][1]
else:
if LR[i][1]<prev_right:
prev_right = LR[i][1]
print(cnt)
|
N = int(input())
LR = [[0,0] for _ in range(N)]
for i in range(N):
a,b = map(int, input().split())
LR[i] = [a-b,a+b]
LR.sort(key=lambda x: x[0])
# print(LR)
prev_right = - 10**9 #一つ前の右端
cnt = 0
for i in range(N):
if LR[i][0]>=prev_right: #次の左端が前の右端以上なら
cnt += 1
prev_right = LR[i][1]
else:
if LR[i][1]<prev_right:
prev_right = LR[i][1]
# print(prev_right)
print(cnt)
|
[
"call.arguments.change"
] | 602,213
| 602,214
|
u678167152
|
python
|
p02796
|
def main():
N, *XL = 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 robot in robots:
if last <= robot[1]:
last = robot[1]
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
def main():
N, *XL = 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 robot in robots:
if last <= robot[0]:
last = robot[1]
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 602,221
| 602,222
|
u838644735
|
python
|
p02796
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans)
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r + 1 < s:
ans += 1
r = t
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 602,223
| 602,224
|
u025501820
|
python
|
p02796
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r < s:
ans += 1
r = t
print(ans)
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r + 1 < s:
ans += 1
r = t
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 602,225
| 602,224
|
u025501820
|
python
|
p02796
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans)
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l, x + l))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans)
|
[
"expression.operation.binary.remove"
] | 602,223
| 602,226
|
u025501820
|
python
|
p02796
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r < s:
ans += 1
r = t
print(ans)
|
import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l, x + l))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,225
| 602,226
|
u025501820
|
python
|
p02796
|
from operator import itemgetter
N = int(input())
arms = []
finishtime = float('-inf')
for i in range(N):
x,l = map(int,input().split())
arms.append((x-l,x+l))
arms.sort(key=itemgetter(1))
cnt=0
for L,R in arms:
if R >= finishtime:
cnt+=1
finishtime = R
print(cnt)
|
from operator import itemgetter
N = int(input())
arms = []
finishtime = float('-inf')
for i in range(N):
x,l = map(int,input().split())
arms.append((x-l,x+l))
arms.sort(key=itemgetter(1))
cnt=0
for L,R in arms:
if finishtime<=L:
cnt+=1
finishtime = R
print(cnt)
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 602,234
| 602,235
|
u820180033
|
python
|
p02796
|
N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][0]
ans += 1
print(ans)
|
N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][1]
ans += 1
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 602,246
| 602,247
|
u854061980
|
python
|
p02796
|
N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a+b,a-b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][0]
ans += 1
print(ans)
|
N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][1]
ans += 1
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 602,248
| 602,247
|
u854061980
|
python
|
p02796
|
n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
lst.append((x + l, x - l))
sorted_lst = sorted(lst)
num = 0
ans = n
while True:
tmp = sorted_lst[num][0]
for i in range(num + 1, n):
if tmp > sorted_lst[i][1]:
ans -= 1
print(num, i)
else:
num = i
break
if i == n - 1:
num = i
break
if num == n - 1:
break
print(ans)
|
n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
lst.append((x + l, x - l))
sorted_lst = sorted(lst)
num = 0
ans = n
while True:
tmp = sorted_lst[num][0]
for i in range(num + 1, n):
if tmp > sorted_lst[i][1]:
ans -= 1
else:
num = i
break
if i == n - 1:
num = i
break
if num == n - 1:
break
print(ans)
|
[
"call.remove"
] | 602,252
| 602,253
|
u183422236
|
python
|
p02796
|
n = int(input())
Robo = []
for i in range(n):
x, l = map(int, input().split())
Robo.append([x-l, x+l])
Robo.sort(key=lambda x: x[0])
#print(Robo)
biggest_right = 2 * -10**9 - 1
counter = 0
for left, right in Robo:
if biggest_right <= left:
counter += 1
biggest_right = max(right, biggest_right)
print(counter)
|
n = int(input())
Robo = []
for i in range(n):
x, l = 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_right = max(right, biggest_right)
print(counter)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,256
| 602,257
|
u332657092
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.