Submission #47087829

Source Code Expand

1
2
3
4
5
6
7
8
9
10
from sortedcontainers import SortedSet, SortedList, SortedDict
l, q = map(int,input().split())
S = SortedSet([0, l])
for _ in range(q):
    c, x = map(int,input().split())
    if c == 1:
        S.add(x)
    else:
        print(S[S.bisect_left(x)] - S[S.bisect_left(x) - 1])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from sortedcontainers import SortedSet, SortedList, SortedDict
l, q = map(int,input().split())
S = SortedSet([0, l])

for _ in range(q):
    c, x = map(int,input().split())
    if c == 1:
        S.add(x)
    else:
        print(S[S.bisect_left(x)] - S[S.bisect_left(x) - 1])

Submission Info

Judge Result