input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
ans = [1] * (N+1)
for L,R in LR:
ans[:L] = [0] * L
ans[R+1:] = [0] * (N+1-R)
print((ans.count(1))) | N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
if min(R)-max(L)+1 <= 0:
print((0))
else:
print((min(R)-max(L)+1)) | p03037 |
N, M = list(map(int, input().split()))
c = [tuple(map(int, input().split())) for _ in range(M)]
nums = []
for i in range(0, M):
mi = list(range(c[i][0], c[i][1]+1))
nums.append(mi)
ans = set(nums[0])
dim = nums[1:]
print((len(ans.intersection(*dim)))) | N, M = list(map(int, input().split()))
c = [tuple(map(int, input().split())) for _ in range(M)]
right = N
left = 1
for i in range(0, M):
left = max(left, c[i][0])
right = min(right, c[i][1])
print((len(list(range(left, right+1))))) | p03037 |
n, m= list(map(int, input().split()))
gates = [list(map(int, input().split())) for _ in range(m)]
count=0
for i in range(1, n+1):
tf = True
for j in gates:
if j[0] > i or j[1] < i:
tf = False
break
if tf:
count+=1
print(count)
| n, m= list(map(int, input().split()))
gates = [list(map(int, input().split())) for _ in range(m)]
up = min([i[1] for i in gates])
down = max([i[0] for i in gates])
if up >= down:
print((up-down+1))
else:
print((0)) | p03037 |
N, M = [int(x) for x in input().split()]
def check(n, LR):
return 1 if all(l <= n <=r for l, r in LR) else 0
LR = []
for _ in range(M):
LR.append([int(x) for x in input().split()])
print((sum(check(n, LR) for n in range(1, N+1))))
| N, M = [int(x) for x in input().split()]
def check(n, LR):
return 1 if all(l <= n <=r for l, r in LR) else 0
L = 0
R = N
for _ in range(M):
l, r = [int(x) for x in input().split()]
if L < l:
L = l
if r < R:
R = r
if L <= R:
print((R - L + 1))
else:
print((0)) | p03037 |
def main():
n, m = list(map(int, input().split()))
gate = []
for _ in range(m):
ngate = list(map(int, input().split()))
gate.append(ngate)
result = 0
for i in range(1, n + 1):
for j in range(m):
if gate[j][0] <= i and i <= gate[j][1]:
if j == len(gate) - 1:
result += 1
continue
else:
break
return result
if __name__ == "__main__":
print((main())) |
def main():
n, m = list(map(int, input().split()))
A = []
B = []
for _ in range(m):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
l = max(A)
r = min(B)
#print(l, r)
if r >= l:
return r - l + 1
else:
return 0
if __name__ == "__main__":
print((main()))
"""
for i in range(1, n + 1):
for j in range(m):
if gate[j][0] <= i and i <= gate[j][1]:
if j == len(gate) - 1:
result += 1
continue
else:
break
""" | p03037 |
def main():
n, m = list(map(int, input().split()))
A = []
B = []
for _ in range(m):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
l = max(A)
r = min(B)
#print(l, r)
if r >= l:
return r - l + 1
else:
return 0
if __name__ == "__main__":
print((main()))
"""
for i in range(1, n + 1):
for j in range(m):
if gate[j][0] <= i and i <= gate[j][1]:
if j == len(gate) - 1:
result += 1
continue
else:
break
""" | n, m = list(map(int , input().split()))
# L = []
# R = []
l_max = 0
r_min = 10 ** 6
for _ in range(m):
l, r = list(map(int, input().split()))
if l_max < l:
l_max = l
if r < r_min:
r_min = r
if l_max <= r_min:
print((r_min - l_max + 1))
else:
print((0)) | p03037 |
import sys
n=0
m=0
id_list=[]
n, m = list(map(int, input().split()))
for i in range(0, m):
gate_min, gate_max = list(map(int, input().split()))
id_list.append([gate_min, gate_max])
result = 0
for i in range(1, n+1):
is_passed = True
for gate in id_list:
if not((i >= gate[0]) and (i <= gate[1])) :
is_passed = False
break
if is_passed:
result = result + 1
print(result)
sys.exit(0) | import sys
n=0
m=0
n, m = list(map(int, input().split()))
_min, _max = list(map(int, input().split()))
for i in range(1, m):
gate_min, gate_max = list(map(int, input().split()))
if (_max > gate_max):
_max = gate_max
if _min < gate_min:
_min = gate_min
result_list = list([x for x in range(1, n+1) if (_min <= x) and (x <= _max)])
result = len(result_list)
print(result)
sys.exit(0) | p03037 |
n, m = list(map(int, input().split()))
ans = set()
for _ in range(m):
l, r = list(map(int, input().split()))
tmp = set(range(l, r+1))
if ans:
ans &= tmp
else:
ans = tmp
print((len(ans))) | n, m = list(map(int, input().split()))
ml, mr = -1, -1
for _ in range(m):
l, r = list(map(int, input().split()))
if ml == -1:
ml = l
mr = r
else:
if ml < l:
ml = l
if mr > r:
mr = r
if mr - ml < 0:
print((0))
else:
print((mr - ml + 1)) | p03037 |
N, M = list(map(int, input().split()))
gate = []
for i in range(M):
l, r = list(map(int, input().split()))
tmp = []
for j in range(l, r + 1):
tmp.append(j)
gate.append(tmp)
gate_sum = set(gate[0])
for i in gate:
gate_sum = gate_sum & set(i)
print((len(gate_sum))) | N, M = list(map(int, input().split()))
gate = []
l, r = list(map(int, input().split()))
for i in range(M-1):
tmpl, tmpr = list(map(int, input().split()))
if l < tmpl:
l = tmpl
if tmpr < r:
r = tmpr
if r - l < 0:
print((0))
else:
print((r - l + 1))
| p03037 |
N, M = list(map(int, input().split()))
cards = list(range(1, N+1))
for _ in range(M):
l, r = list(map(int, input().split()))
cards = set(cards) & set(range(l, r+1))
print((len(cards))) | N, M = list(map(int, input().split()))
L, R = [], []
for _ in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
diff = min(R) - max(L) + 1
if diff > 0:
print(diff)
else:
print((0)) | p03037 |
N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
able = [0 for i in range(N)]
for i,j in permit:
for k in range(i,j+1):
able[k-1] += 1
print((able.count(M)))
| N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
l,r = 1, N
for i,j in permit:
l = max(l, i)
r = min(r, j)
print((max(r-l+1,0))) | p03037 |
N,M = list(map(int,input().split()))
li = []
ans = 0
for i in range(M):
x,y = list(map(int,input().split()))
li.append([x,y])
for i in range(1,N+1):
count = 0
for j,k in li :
if j <= i and i <= k :
count += 1
if count == len(li):
ans += 1
else:
break
print(ans)
|
N,M = list(map(int,input().split()))
L = []
R = []
ans = 0
for i in range(M):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
Lmax = max(L)
Rmin = min(R)
for i in range(1,N+1):
if Lmax <= i and i <= Rmin:
ans += 1
print(ans)
| p03037 |
n,m=list(map(int,input().split()))
a=[[int(i) for i in input().split()] for l in range(m)]
l=[int(i) for i in range(1,n+1)]
for x in a:
l=set(l)&set([int(i) for i in range(x[0],x[1]+1)])
print((len(l))) | n,m=list(map(int,input().split()))
a=[[int(i) for i in input().split()] for l in range(m)]
b=0
s=100000000000
for x in a:
b=max(b,x[0])
s=min(s,x[1])
print((max(0,s-b+1))) | p03037 |
N,M= list(map(int,input().split()))
gate=[list(map(int,input().split())) for i in range(M)]
count2=0
for i in range(1,N+1):
count=0
for j in gate:
if j[0]<=i<=j[1]:
count+=1
else:
break
if count==M:
count2+=1
print(count2) | N,M= list(map(int,input().split()))
gate=[list(map(int,input().split())) for i in range(M)]
count2=0
min1=1
max1=N
for j in gate:
if j[0]>min1:
min1=j[0]
if j[1]<max1:
max1=j[1]
if max1>=min1:
print((max1-min1+1))
else:
print((0)) | p03037 |
def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
lr = [list(map(int, input().rstrip('\n').split())) for _ in range(m)]
a = [0] * (n + 2)
for l, r in lr:
a[l] += 1
a[r + 1] -= 1
t = 0
cnt = 0
for i in range(1, n + 1):
t += a[i]
if t == m:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
x = [0] * (n + 2)
for i in range(m):
l, r = list(map(int, input().rstrip('\n').split()))
x[l] += 1
x[r+1] -= 1
t = 0
cnt = 0
for i in range(n + 2):
t += x[i]
if t == m:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| p03037 |
# coding: utf-8
(N, M) = list(map(int, input().split(" ")))
ids = list(range(1, N+1))
for _ in range(M):
(L, R) = list(map(int, input().split(" ")))
ids = [i for i in ids if L <= i <= R]
print((len(ids)))
| # coding: utf-8
(N, M) = list(map(int, input().split(" ")))
ids = list(range(1, N+1))
L_max = 0
R_min = 10000000000000000000
for _ in range(M):
(L, R) = list(map(int, input().split(" ")))
if L > L_max:
L_max = L
if R < R_min:
R_min = R
ids = [i for i in ids if L_max <= i <= R_min]
print((len(ids)))
| p03037 |
n, m = list(map(int,input().split()))
s = {}
for i in range(m):
l, r = list(map(int,input().split()))
if i == 0:
s = set(range(l,r+1))
else:
s = set(range(l, r+1)) & s
print((len(s))) | import heapq
n, m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
line = list(map(int,input().split()))
l.append(-line[0])
r.append(line[1])
heapq.heapify(l)
heapq.heapify(r)
l_max = - heapq.heappop(l)
r_min = heapq.heappop(r)
if l_max > r_min:
print((0))
else:
print((r_min-l_max+1)) | p03037 |
from functools import reduce
N,M=list(map(int,input().split()))
lst=[]
for i in range(M):
L,R=list(map(int,input().split()))
lst.append(set(range(L,R+1)))
print((len(reduce(lambda a,b:a&b,lst)))) | from functools import reduce
N,M=list(map(int,input().split()))
x=set()
L,R=list(map(int,input().split()))
x=set(range(L,R+1))
for i in range(M-1):
L,R=list(map(int,input().split()))
x=x & set(range(L,R+1))
print((len(x))) | p03037 |
from functools import reduce
N,M=list(map(int,input().split()))
x=set()
L,R=list(map(int,input().split()))
x=set(range(L,R+1))
for i in range(M-1):
L,R=list(map(int,input().split()))
x=x & set(range(L,R+1))
print((len(x))) | import sys
N,M=list(map(int,input().split()))
_min,_max=list(map(int,input().split()))
for i in range(M-1):
L,R=list(map(int,input().split()))
if R<_min or L>_max:
print((0))
sys.exit()
_min,_max=max(_min,L),min(_max,R)
print((_max+1-_min)) | p03037 |
n,m = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(m)]
ANS = []
for i in range(m):
ANS.append(set(range(LR[i][0],LR[i][1]+1)))
X = ANS[0]
for i in range(1,m):
X = X&ANS[i]
print((len(X))) | n,m = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(m)]
X = [LR[i][0] for i in range(m)]
Y = [LR[i][1] for i in range(m)]
print((max(min(Y)-max(X)+1,0))) | p03037 |
N,M = list(map(int,input().split()))
A = set(n for n in range(1,N+1))
for m in range(M):
L,R = list(map(int,input().split()))
B = set(n for n in range(L,R+1))
A = A&B
print((len(A))) | N,M = list(map(int,input().split()))
L1 = 0
R1 = N
for m in range(M):
L2,R2 = list(map(int,input().split()))
L1 = max(L1,L2)
R1 = min(R1,R2)
print((max(0,R1-L1+1))) | p03037 |
N,M = list(map(int,input().split()))
L = [0] * M
R = [0] * M
for i in range (0,M):
L[i],R[i] = list(map(int,input().split()))
S = [set(range(L[i],R[i]+1)) for i in range(0,M)]
temp = S[0]
for i in range(1,M):
temp = temp & S[i]
print((len(temp))) | N,M = list(map(int,input().split()))
L = [0] * M
R = [0] * M
for i in range (0,M):
L[i],R[i] = list(map(int,input().split()))
print((len(list(range(max(L),min(R)+1))))) | p03037 |
n,m = list(map(int, input().split()))
Answer = [p+1 for p in range(n)]
for i in range(m):
l,r = list(map(int, input().split()))
Answer = [q for q in Answer if q >=l and q <= r]
print((len(Answer))) | n, m = list(map(int, input().split()))
min_value = 1
max_value = n
for _ in range(m):
l, r = list(map(int, input().split()))
if l >= min_value:
min_value = l
if r <= max_value:
max_value = r
Answer = max(max_value - min_value +1,0)
print(Answer) | p03037 |
N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
set_ans = set(range(int(LR[0][0]),int(LR[0][1]+1)))
for m in range(1,M):
set_ans = set_ans & set(range(int(LR[m][0]),int(LR[m][1])+1))
if len(set_ans) == 0:
break
print((len(set_ans))) | N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
L = [x[0] for x in LR]
R = [x[1] for x in LR]
if min(R) - max(L)>=0:
print((min(R)-max(L)+1))
else:
print((0))
| p03037 |
N, M = [int(n) for n in input().split()]
S = set(range(1, N+1))
for i in range(M):
l, r = [int(n) for n in input().split()]
S &= set(range(l, r+1))
print((len(S)))
| N, M = [int(n) for n in input().split()]
L, R = (1, N)
for i in range(M):
l, r = [int(n) for n in input().split()]
L, R = (max(l, L), min(r, R))
print((max(0, R-L+1)))
| p03037 |
def main():
N, M = list(map(int, input().split()))
#L = [0] * M
#R = [0] * M
for i in range(M):
L, R = list(map(int, input().split()))
A = [j for j in range(L,R+1)]
if i == 0:
tmp = set(A)
continue
set_A = set(A)
tmp = set(list(set_A.intersection(tmp)))
print((len(tmp)))
main() | def main():
N, M = list(map(int, input().split()))
left = 0
right = float('inf')
for i in range(M):
L, R = list(map(int, input().split()))
left = max(left, L)
right = min(right, R)
if left <= right:
print((right - left + 1))
else:
print((0))
main() | p03037 |
N,M = list(map(int,input().split()))
LRlist = [tuple(map(int,input().split())) for _ in range(M)]
min_n = 0
max_n = N
for l,r in LRlist:
min_n = l if l>min_n else min_n
max_n = r if r<max_n else max_n
if max_n-min_n >= 0:
print((max_n-min_n+1))
else:
print((0)) | N,M = list(map(int,input().split()))
LRlist = [tuple(map(int,input().split())) for _ in range(M)]
min_n = 0
max_n = N
for l,r in LRlist:
min_n = l if l>min_n else min_n
max_n = r if r<max_n else max_n
ans = max_n-min_n+1
print((ans if ans>0 else 0)) | p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
ans = set(range(L, R + 1))
for i in range(M - 1):
L, R = list(map(int, input().split()))
ans &= set(range(L, R + 1))
print((len(ans)))
| N, M = list(map(int, input().split()))
llim = 0
rlim = N + 1
for _ in range(M):
L, R = list(map(int, input().split()))
llim = max(llim, L)
rlim = min(rlim, R)
print((max(0, rlim + 1 - llim)))
| p03037 |
n, m = (int(i) for i in input().split())
e = [[int(i) for i in input().split()] for i in range(m)]
e = [list(range(i[0],i[1]+1)) for i in e]
x = set(e[0])
for i in e:
x = x & set(i)
print((len(list(x)))) | n, m = (int(i) for i in input().split())
e = [[int(i) for i in input().split()] for i in range(m)]
start, end = e[0][0], e[0][1]
for i in e:
if start < i[0]:
start = i[0]
if end > i[1]:
end = i[1]
if start > end:
break
if start > end:
print((0))
else:
print((end-start+1)) | p03037 |
import collections
n, m = list(map(int, input().split()))
l = []
l2 = []
count = 0
for i in range(m):
array = list(map(int, input().split()))
l.append(array)
for i in range(m):
for j in range(l[i][0], l[i][1]+1):
l2.append(j)
c = collections.Counter(l2)
d = sorted(list(c.values()),reverse=True)
for i in d:
if i == m:
count += 1
print(count)
| n, m = list(map(int, input().split()))
x = []
y = []
for i in range(m):
array = list(map(int, input().split()))
x.append(array[0])
y.append(array[1])
a = max(x[:])
b = min(y[:])
print((len(list(range(a, b+1)))))
| p03037 |
from collections import defaultdict
n, m = list(map(int, input().split()))
card = defaultdict(int)
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
card[j] += 1
cnt = 0
for i, v in list(card.items()):
if v == m:
cnt += 1
print(cnt)
| from collections import defaultdict
n, m = list(map(int, input().split()))
left = []
right = []
for i in range(m):
l, r = list(map(int, input().split()))
left.append(l)
right.append(r)
if min(right) >= max(left):
print((min(right) - max(left) + 1))
else:
print((0))
| p03037 |
N,M = list(map(int,input().split()))
lst = [list(map(int,input().split())) for _ in range(M)]
L1,R1 = lst[0]
common = 0
for i in range(L1,R1+1):
count = 0
for j in range(1,M):
Lj,Rj = lst[j]
if i < Lj or i > Rj:
break
else:
count += 1
if count == M-1:
common += 1
print(common) | N,M = list(map(int,input().split()))
maxL = 1
minR = 100000
for i in range(M):
Li,Ri = list(map(int,input().split()))
maxL = max(maxL,Li)
minR = min(minR,Ri)
if minR - maxL >= 0:
print((minR-maxL+1))
else:
print((0)) | p03037 |
N,M = list(map(int,input().split()))
N_List = list(range(1,N+1))
for i in range(M):
st,sp = list(map(int,input().split()))
N_List = set(list(range(st,sp + 1))) & set(N_List)
print((len(N_List))) | N,M = list(map(int,input().split()))
for i in range(M):
st,sp = list(map(int,input().split()))
if i == 0:
N_List = [st,sp]
else:
if st > N_List[0]:
N_List[0] = st
if sp < N_List[1]:
N_List[1] = sp
print((len(list(range(N_List[0],N_List[1]+1))))) | p03037 |
N, M = list(map(int, input().split()))
cnt = 0
li = []
for i in range(N):
li.append(M)
# print(li)
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L-1, R):
li[j] = li[j] - 1
# print(li)
for i in range(0, len(li)):
if li[i] == 0:
cnt += 1
print(cnt) | N, M = list(map(int, input().split()))
L = []
for i in range(M):
LR = list(map(int, input().split()))
L.append(LR)
res = [L[0][0], L[0][1]]
for i in range(M):
res = [max(res[0], L[i][0]), min(res[1], L[i][1])]
if res[1] < res[0]:
print((0))
else:
print((res[1] - res[0] + 1)) | p03037 |
n, m = list(map(int, input().split()))
left, right = 1, n
for _ in range(m):
l, r = list(map(int, input().split()))
if l > left:
left = l
if r < right:
right = r
if left > right:
print((0))
quit()
print((right - left + 1)) | import sys
n, m, *lst = list(map(int, sys.stdin.read().split()))
l = max(lst[::2])
r = min(lst[1::2])
if l > r:
print((0))
else:
print((r - l + 1))
| p03037 |
_, _, *lst = list(map(int, open(0).read().split()))
l, r = max(lst[::2]), min(lst[1::2])
print((0 if l > r else r - l + 1)) | def main():
_, _, *lst = list(map(int, open(0).read().split()))
l, r = max(lst[::2]), min(lst[1::2])
print((0 if l > r else r - l + 1))
main() | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
l = []
r = []
for i in range(m):
l.append(lr[i][0])
r.append(lr[i][1])
ans = 0
for i in range(1, n+1):
if max(l) <= i <= min(r):
ans += 1
print(ans) | n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
l = []
r = []
for i in range(m):
l.append(lr[i][0])
r.append(lr[i][1])
lm = max(l)
rm = min(r)
ans = 0
for i in range(1, n+1):
if lm <= i <= rm:
ans += 1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
ls = []
rs = []
for i in range(m):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
n_all = 0
for card in range(1,n+1):
auth = True
for gate in range(m):
if not ls[gate] <= card <= rs[gate]:
auth = False
if auth == True:
n_all += 1
print(n_all) | n, m = list(map(int, input().split()))
ls = []
rs = []
for i in range(m):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
n_all = min(rs) - max(ls) + 1
if n_all < 0: n_all =0
print(n_all)
| p03037 |
import collections
n,m=list(map(int,input().split()))
l=[[]*i for i in range(m)]
a=set()
for i in range(m):
s,e=list(map(int,input().split()))
for j in range(s,e+1):
l[i].append(j)
for i in range(m):
if i==0:
a=set(l[i])
else:
a=a&set(l[i])
print((len(a))) | n,m=list(map(int,input().split()))
l,r=0,1000000
for i in range(m):
a,b=list(map(int,input().split()))
l=max(l,a)
r=min(r,b)
print((len(list(range(l,r+1))))) | p03037 |
N, M=list(map(int, input().split()))
for i in range(M):
L,R=list(map(int, input().split()))
if i==0:
LR=set(list(range(L,R+1)))
else:
LR=LR&set(list(range(L,R+1)))
print((len(LR))) | N, M=list(map(int, input().split()))
a=1
b=N
for i in range(M):
L,R=list(map(int, input().split()))
a=max(a,L)
b=min(b,R)
if b>=a:
print((b-a+1))
else:
print((0)) | p03037 |
import sys
sys.setrecursionlimit(200000)
n, m = list(map(int, input().split()))
def cutterl(l, lst) :
if lst == [] :
return []
elif lst[0] < l :
return cutterl(l, lst[1:])
else :
return lst
def cutterr(r, lst) :
if lst == [] :
return []
elif r < lst[-1] :
return cutterr(r, lst[:-1])
else :
return lst
nlist = list([x + 1 for x in range(n)])
llist=[]
rlist=[]
for i in range(m) :
l, r = list(map(int, input().split()))
llist.append(l)
rlist.append(r)
nlist = cutterl(max(llist), nlist)
nlist = cutterr(min(rlist), nlist)
print((len(nlist))) | n, m = list(map(int, input().split()))
llist = []
rlist = []
for i in range(m) :
l, r = list(map(int, input().split()))
llist.append(l)
rlist.append(r)
ll = max(llist)
rr = min(rlist)
print((max(0, min(rr, n)-ll+1))) | p03037 |
N,M= list(map(int, input().split()))
li=[]
for i in range(N):
li.append(0)
for i in range(M):
L,R= list(map(int, input().split()))
for t in range(L-1,R):
li[t] +=1
print((li.count(M)))
| N,M= list(map(int, input().split()))
L,R= list(map(int, input().split()))
flag = True
for i in range(M-1):
a,b= list(map(int, input().split()))
if a >= L and b <= R:
L = a
R = b
elif L <= b and R >= b:
R = b
elif L <= a and R >= a:
L = a
elif a < L and R < b:
L = L
else:
flag = False
break
if flag:
print((R-L+1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
count = 0
for i in range(N):
count += 1
for j in range(M):
if i+1 < L[j] or i+1 > R[j]:
count -= 1
break
print(count) | N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
s = 1
e = N
for i in range(M):
if s < L[i]:
s = L[i]
if e > R[i]:
e = R[i]
if s > e:
print((0))
else:
print((e-s+1)) | p03037 |
L,M=list(map(int,input().split()))
a=[0]*L
for i in range(M):
b,c=list(map(int,input().split()))
for j in range(b-1,c):
a[j]+=1
print((a.count(M))) | L,M=list(map(int,input().split()))
a=[0]*L
x=[]
y=[]
for i in range(M):
b,c=list(map(int,input().split()))
x.append(b)
y.append(c)
if max(x)<=min(y):
print((-max(x)+min(y)+1))
else:
print((0)) | p03037 |
N,M=list(map(int,input().split()))
list1=[list(map(int,input().split())) for i in range(M)]
list2=list(range(N+1))
ans=set(range(N+1))
for i in range(M):
lr=set(list2[list1[i][0]:list1[i][1]+1])
#print(lr)
ans=ans&lr
#print(ans)
print((len(ans)))
| N,M=list(map(int,input().split()))
list1=[list(map(int,input().split())) for i in range(M)]
start=[]
end=[]
for i in range(M):
start.append(list1[i][0])
end.append(list1[i][1])
stmax=max(start)
#print(stmax)
enmax=min(end)
#print(enmax)
if enmax>=stmax:
print((enmax-stmax+1))
else:
print((0))
| p03037 |
n, m = list(map(int, input().split()))
l1, r1 = list(map(int, input().split()))
li = set(list(range(l1, r1+1)))
for i in range(m-1):
l,r = list(map(int, input().split()))
li = li & set(list(range(l,r+1)))
print((len(li))) | a,b= list(map(int,input().split()))
x, y= list(zip(*[list(map(int,input().split())) for i in range(b)]))
f= min(y) - max(x)
if f< 0 :
print((0))
else :
print((min(y) - max(x) +1))
| p03037 |
a,b= list(map(int,input().split()))
x, y= list(zip(*[list(map(int,input().split())) for i in range(b)]))
f= min(y) - max(x)
if f< 0 :
print((0))
else :
print((min(y) - max(x) +1))
| n, m = list(map(int, input().split()))
low = 0
high = n+1
for i in range(m):
l, r = list(map(int, input().split()))
low = max(low, l)
high = min(high, r)
print((high-low+1 if low <= high else 0)) | p03037 |
n,m=list(map(int,input().split()))
c=list()
for i in range(m):
c.append(list(map(int,input().split())))
s=(list([x[0] for x in c]))
b=(list([x[1] for x in c]))
maxs=max(s)
minb=min(b)
if minb<maxs:
print('0')
else:
ans=minb-maxs+1
print(ans) | n,m=list(map(int,input().split()))
a=[]
b=[]
for i in range(m):
l,r=list(map(int,input().split()))
a.append(l)
b.append(r)
x=max(a)
y=min(b)
if y-x<0:
print('0')
else:
print((y-x+1)) | p03037 |
N,M = list(map(int,input().split()))
def inc(a,b):
h = []*(a-b)
for p in range(a,b+1):
if p <= b:
h.append(p)
return set(h)
for p in range(M):
L,M = list(map(int,input().split()))
if p == 0:
ls = inc(L,M)
else:
ls = ls & inc(L,M)
print((len(ls)))
| N,M = list(map(int,input().split()))
ls_a = []
ls_b = []
for p in range(M):
L,R = list(map(int,input().split()))
ls_a.append(L)
ls_b.append(R)
ans = min(ls_b)-max(ls_a)+1
if ans < 0:
print((0))
else:
print(ans) | p03037 |
n,m=list(map(int,input().split()))
lr=[[int(i) for i in input().split()] for i in range(m)]
cnt=[i for i in range(lr[0][0],lr[0][1]+1)]
ans=len(cnt)
for i in range(m):
cnt=list(set([i for i in range(lr[i][0],lr[i][1]+1)])&set(cnt))
ans=len(cnt)
if len(cnt)==0:
ans=0
break
print(ans) | n,m=list(map(int,input().split()))
lr=[[int(i) for i in input().split()] for i in range(m)]
l=lr[0][0]
r=lr[0][1]
ans=0
for i in range(1,m):
l=max(l,lr[i][0])
r=min(r,lr[i][1])
ans=r-l+1
if r<l:
ans=0
print(ans) | p03037 |
N, M = list(map(int, input().split()))
li = [i for i in range(1, N+1)]
ans = li
for lr in range(M):
l, r = list(map(int, input().split()))
ans = [i for i in ans if l <= i <= r]
print((len(ans))) | N, M = list(map(int, input().split()))
minNum = 1
maxNum = N
for lr in range(M):
l, r = list(map(int, input().split()))
if minNum <= l and r <= maxNum:
minNum = l
maxNum = r
elif minNum <= l <= maxNum and maxNum <= r:
minNum = l
elif l <= minNum and minNum <= r <= maxNum:
maxNum = r
elif r < minNum or maxNum < l:
print("0")
exit()
# print(l,r,minNum,maxNum)
print((maxNum - minNum +1))
| p03037 |
n, m = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(m)]
ans =[0] * (n + 1)
for l, r in LR:
ans[l - 1] += 1
ans[r] -= 1
accu =[0] * (n + 1)
for i in range(n):
accu[i + 1] += ans[i] + accu[i]
ans = accu.count(m)
print(ans) | n, m = list(map(int, input().split()))
L = []
R = []
for _ in range(m):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
ans = max(0, min(R) - max(L) + 1)
print(ans)
| p03037 |
N, M = list(map(int, input().split()))
path = set([n for n in range(1, N + 1)])
for _ in range(M):
l, r = list(map(int, input().split()))
pi = set([n for n in range(l, r + 1)])
path &= pi
print((len(path))) | N, M = list(map(int, input().split()))
l, r = 1, 10 ** 5
for _ in range(M):
li, ri = list(map(int, input().split()))
l = max(l, li)
r = min(r, ri)
ans = r - l + 1 if r >= l else 0
print(ans) | p03037 |
S = []
N, M = input().split(" ")
for m in range(int(M)):
a, b = input().split(" ")
S.append(set([i for i in range(int(a),int(b)+1)]))
if M == 1:
print((len(S[0])))
else:
sets = S[0]
for i in range(1,int(M)):
sets = sets & S[i]
print((len(sets))) | N, M = input().split(" ")
if M == 1:
a, b = input().split(" ")
print((int(b)-int(a)+1))
else:
a, b = input().split(" ")
sets = set([i for i in range(int(a),int(b)+1)])
for m in range(int(M)-1):
a, b = input().split(" ")
sets = sets & set([i for i in range(int(a),int(b)+1)])
print((len(sets))) | p03037 |
N, M = input().split(" ")
if M == 1:
a, b = input().split(" ")
print((int(b)-int(a)+1))
else:
a, b = input().split(" ")
sets = set([i for i in range(int(a),int(b)+1)])
for m in range(int(M)-1):
a, b = input().split(" ")
sets = sets & set([i for i in range(int(a),int(b)+1)])
print((len(sets))) | N, M = input().split(" ")
#S = []
if M == 1:
a, b = input().split(" ")
print((int(b)-int(a)+1))
else:
a, b = input().split(" ")
aM, bm = int(a),int(b)
#sets = set([i for i in range(int(a),int(b)+1)])
for m in range(int(M)-1):
a, b = input().split(" ")
aM = max(aM,int(a))
bm = min(bm,int(b))
#sets = sets & set([i for i in range(int(a),int(b)+1)])
if(bm<aM):
print((0))
else:
print((int(bm)-int(aM)+1)) | p03037 |
n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
A, B = list(map(int,input().split()))
l.append(A)
r.append(B)
sum = 0
for i in range(1,n+1,1):
flag = 1
for j in range(m):
if i < l[j] or i > r[j]:
flag = 0
break
if flag == 1:
sum += 1
print(sum) | n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
A, B = list(map(int,input().split()))
l.append(A)
r.append(B)
min = 0
max = n
for i in range(m):
if min < l[i]:
min = l[i]
if max > r[i]:
max = r[i]
if max - min + 1 > 0:
print((max - min + 1))
else:
print((0)) | p03037 |
import itertools
n,m = list(map(int, input().split()))
d = [0]*n
for i in range(m):
l,r = list(map(int, input().split()))
for i in range(l-1,r):
d[i]+=1
count = 0
for i in d:
if i == m:
count+=1
print(count) | n,m = list(map(int, input().split()))
fn = 1
ln = n
for i in range(m):
l,r = list(map(int, input().split()))
fn = max(fn,l)
ln = min(ln,r)
print((ln-fn+1 if ln-fn>=0 else 0)) | p03037 |
n,m = list(map(int, input().split()))
cn = [i for i in range(1,n+1)]
for i in range(m):
l,r = list(map(int, input().split()))
lr = [i for i in range(l,r+1)]
cn = set(cn)&set(lr)
print((len(cn))) | n,m = list(map(int, input().split()))
l,r = list(map(int, input().split()))
for i in range(m-1):
l2,r2 = list(map(int, input().split()))
if l<l2:
l = l2
if r>r2:
r = r2
print((max(r-l+1,0))) | p03037 |
n,m=list(map(int,input().split()))
CARD=[0]*(n+1)
for i in range(m):
L,R=list(map(int,input().split()))
CARD[L-1]+=1
CARD[R]-=1
ans=0
for i in range(n):
if CARD[i]==m:ans+=1
CARD[i+1]=CARD[i+1]+CARD[i]
print(ans) | def main():
n,m=list(map(int,input().split()))
CARD=[0]*(n+1)
for i in range(m):
L,R=list(map(int,input().split()))
CARD[L-1]+=1
CARD[R]-=1
ans=0
for i in range(n):
if CARD[i]==m:ans+=1
CARD[i+1]=CARD[i+1]+CARD[i]
print(ans)
if __name__=='__main__':
main() | p03037 |
def main():
n,m=list(map(int,input().split()))
CARD=[0]*(n+1)
for i in range(m):
L,R=list(map(int,input().split()))
CARD[L-1]+=1
CARD[R]-=1
ans=0
for i in range(n):
if CARD[i]==m:ans+=1
CARD[i+1]=CARD[i+1]+CARD[i]
print(ans)
if __name__=='__main__':
main() | def main():
import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
CARD=[0]*(n+1)
for i in range(m):
L,R=list(map(int,input().split()))
CARD[L-1]+=1
CARD[R]-=1
ans=0
for i in range(n):
if CARD[i]==m:ans+=1
CARD[i+1]=CARD[i+1]+CARD[i]
print(ans)
if __name__=='__main__':
main()
| p03037 |
N, M = list(map(int,input().split()))
li = [0]*N
for i in range(M):
L, R = list(map(int,input().split()))
for j in range(L-1,R,1):
li[j] += 1
print((li.count(M))) | N, M = list(map(int,input().split()))
li1 = []
li2 = []
for i in range(M):
L, R = list(map(int,input().split()))
li1.append([L,R])
li2.append([R,L])
li1.sort()
li2.sort(reverse=True)
if (li2[M-1][0])<(li1[M-1][0]):
print("0")
exit()
print(((li2[M-1][0])-(li1[M-1][0])+1)) | p03037 |
n, m = list(map(int, input().split()))
lr = []
for i in range(m):
lr.append(list(map(int, input().split())))
canPass = [m] * n
for j in range(len(lr)):
l = lr[j][0] - 1
r = lr[j][1] - 1
for k in range(l, r + 1):
canPass[k] -= 1
ans = canPass.count(0)
print(ans)
| n, m = list(map(int, input().split()))
l = 1
r = n
for i in range(m):
a, b = list(map(int, input().split()))
l = max(l, a)
r = min(r, b)
if l <= r:
print((r - l + 1))
else:
print((0))
| p03037 |
n,m=list(map(int, input().split()))
ans=set()
for i in range(m):
l,r=list(map(int, input().split()))
if i==0:
ans=set(range(l,r+1))
else:
tmp=set(range(l,r+1))
ans=ans & tmp
print((len(ans))) | n,m=list(map(int, input().split()))
l_ans=1
r_ans=n
for i in range(m):
l,r=list(map(int, input().split()))
l_ans=max(l_ans,l)
r_ans=min(r_ans,r)
if r_ans>=l_ans:
print((r_ans-l_ans+1))
else:
print((0)) | p03037 |
n, m = [int(x) for x in input().split()]
key_set = None
for _ in range(m):
l, r = [int(x) for x in input().split()]
if not key_set:
key_set = set(range(l, r + 1))
else:
key_set &= set(range(l, r + 1))
print((len(key_set))) | n, m = [int(x) for x in input().split()]
l_list = [0] * m
r_list = [0] * m
for i in range(m):
l_list[i], r_list[i] = [int(x) for x in input().split()]
print((max(min(r_list) - max(l_list) + 1, 0))) | p03037 |
n, m = list(map(int, input().split()))
card=[0 for _ in range(n)]
for i in range(m):
l, r = [int(x)-1 for x in input().split()]
for i in range(l,r+1):
card[i]+=1
print((card.count(m)))
| n, m = list(map(int, input().split()))
card=[0 for _ in range(n)]
l, r = list(map(int, input().split()))
l-=1
for i in range(m-1):
li, ri = list(map(int, input().split()))
li-=1
if li>r or ri<l:
l=r
break
elif li>=l and ri<=r:
l=li; r=ri
elif li<=l and ri>=r:
pass
elif li<=r and ri>=r:
l=li
elif ri>=l and li<=l:
r=ri
else:
pass
print((r-l))
| p03037 |
n, m = list(map(int, input().split()))
card=[0 for _ in range(n)]
l, r = list(map(int, input().split()))
l-=1
for i in range(m-1):
li, ri = list(map(int, input().split()))
li-=1
if li>r or ri<l:
l=r
break
elif li>=l and ri<=r:
l=li; r=ri
elif li<=l and ri>=r:
pass
elif li<=r and ri>=r:
l=li
elif ri>=l and li<=l:
r=ri
else:
pass
print((r-l))
| n, m = list(map(int, input().split()))
card=[0 for _ in range(n)]
l=[]; r=[]
for i in range(m):
li, ri = list(map(int, input().split()))
l.append(li)
r.append(ri)
print((max(0, min(r)-max(l)+1)))
| p03037 |
N, M = list(map(int, input().split()))
L, R = [], []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l), R.append(r)
s = []
for i in range(M):
s.append([i for i in range(L[i], R[i]+1)])
a = s[0]
for i in s:
a = set(a) & set(i)
ans = 0
for i in range(N+1):
if i in a:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
l, r = list(map(int, input().split()))
a = set([i for i in range(l, r+1)])
for i in range(M-1):
l, r = list(map(int, input().split()))
a = set(a) & set([i for i in range(l, r+1)])
ans = 0
for i in range(N+1):
if i in a:
ans += 1
print(ans) | p03037 |
N, M = list(map(int, input().split()))
L, R = [], []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l), R.append(r)
ans = 0
for i in range(N):
if max(L) <= i+1 <= min(R):
ans += 1
print(ans) | N, M = list(map(int, input().split()))
L, R = [], []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l), R.append(r)
if max(L) <= min(R):
print((min(R) - max(L) + 1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
c = [0 for _ in range(N)]
cnt = 0
for i, (l, r) in enumerate(LR):
for j in range(l - 1, r):
c[j] += i + 1
cnt += i + 1
s = [1 if k == cnt else 0 for k in c]
print((sum(s)))
| N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| N, M = list(map(int, input().split()))
left = 1
right = N
for _ in range(M):
l, r = list(map(int, input().split()))
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| p03037 |
N, M = list(map(int, input().split()))
left = 1
right = N
for _ in range(M):
l, r = list(map(int, input().split()))
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| def main():
N, M = list(map(int, input().split()))
left = 1
right = N
for _ in range(M):
l, r = list(map(int, input().split()))
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
main()
| p03037 |
n,m = list(map(int,input().split()))
gates = []
res = 0
for i in range(m):
l,r = list(map(int,input().split()))
gates.append({ i for i in range(l,r+1)})
r={i for i in range(1,n+1)}
for g in gates :
r = r & g
print((len(r))) | n,m = list(map(int,input().split()))
res={i for i in range(1,n+1)}
for i in range(m):
l,r = list(map(int,input().split()))
g = { i for i in range(l,r+1)}
res = res&g
if res == {} :
print((0))
break
print((len(res))) | p03037 |
n,m = list(map(int,input().split()))
res={i for i in range(1,n+1)}
for i in range(m):
l,r = list(map(int,input().split()))
g = { i for i in range(l,r+1)}
res = res&g
if res == {} :
print((0))
break
print((len(res))) |
n,m = list(map(int,input().split()))
L = []
R = []
for i in range(m):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
l = L[0]
r = R[0]
cnt = 0
for i in range(max(L),min(R)+1) :
if 0<=i<=r :
cnt += 1
print(cnt) | p03037 |
n = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(n[1])]
passcard = [i+l[0][0] for i in range(l[0][1] - l[0][0]+1)]
for t in range(n[1]-1):
passcard = [i for i in passcard if l[t+1][0] <= i <= l[t+1][1]]
print((len(passcard))) | n = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(n[1])]
minp = l[0][0]
maxp = l[0][1]
for t in range(n[1]):
minp = max(minp,l[t][0])
maxp = min(maxp,l[t][1])
print((max(0,maxp-minp+1))) | p03037 |
import os, sys, re, math
N, M = [int(s) for s in input().split(' ')]
cards = [True for _ in range(N+1)]
cards[0] = False
for _ in range(M):
l,r = [int(s) for s in input().split(' ')]
for i in range(1,l):
cards[i] = False
for j in range(r+1,len(cards)):
cards[j] = False
print((sum(cards)))
| import os, sys, re, math
N, M = [int(s) for s in input().split(' ')]
min_idx = 1
max_idx = 1e+5
for _ in range(M):
l,r = [int(s) for s in input().split(' ')]
min_idx = max(min_idx, l)
max_idx = min(max_idx, r)
if max_idx >= min_idx:
print((min(N, int(max_idx - min_idx + 1))))
else:
print((0))
| p03037 |
import os, sys, re, math
N, M = [int(s) for s in input().split(' ')]
min_idx = 1
max_idx = 1e+5
for _ in range(M):
l,r = [int(s) for s in input().split(' ')]
min_idx = max(min_idx, l)
max_idx = min(max_idx, r)
if max_idx >= min_idx:
print((min(N, int(max_idx - min_idx + 1))))
else:
print((0))
| import os, sys, re, math
N,M = list(map(int,input().split(' ')))
L = 1
R = N
for _ in range(M):
l,r = list(map(int,input().split(' ')))
L = max(L,l)
R = min(R,r)
ret = max(0, R-L+1)
print(ret) | p03037 |
import collections
N,M = list(map(int,input().split()))
x = []
for _ in range(M):
L,R = list(map(int,input().split()))
x.extend(list(range(L,R+1)))
c = collections.Counter(x)
print((len([i[0] for i in list(c.items()) if i[1] == M]))) | N,M = list(map(int,input().split()))
L = []
R = []
for _ in range(M):
x,y = list(map(int,input().split()))
L.append(x)
R.append(y)
if min(R) >= max(L):
print((min(R)-max(L)+1))
else:
print((0)) | p03037 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
clear_list = [1] * N
for i in range(M):
start, end = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(1,N+1):
if i < start or end < i:
clear_list[i-1] = 0
print((clear_list.count(1)))
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
clear_list = [1] * N
start = 0
end = 0
ans_start = 0
ans_end = 0
for i in range(M):
start, end = [int(x) for x in stdin.readline().rstrip().split()]
if ans_start == 0 or ans_start < start :
ans_start = start
if ans_end == 0 or ans_end > end:
ans_end = end
if ans_end - ans_start < 0:
print((0))
else:
print((ans_end - ans_start + 1 ))
| p03037 |
n,m = list(map(int,input().split()))
ans = {}
for _ in range(m):
l,r = list(map(int,input().split()))
gate = []
if ans:
for i in range(max(l,min(ans)),min(r+1,max(ans))+1):
gate.append(i)
ans &= set(gate)
else:
for i in range(l,r+1):
gate.append(i)
ans = set(gate)
print((len(ans))) | n,m = list(map(int,input().split()))
ans = []
for _ in range(m):
l,r = list(map(int,input().split()))
if ans:
ans = [max(ans[0],l),min(ans[1],r)]
else:
ans = [l,r]
print((ans[1]-ans[0]+1 if ans[1]-ans[0]+1>0 else 0)) | p03037 |
n ,m = list(map(int, input().split()))
L_R = []
for i in range(m):
l, r = list(map(int, input().split()))
tmp = set()
for i in range(l, r + 1):
tmp.add(i)
L_R.append(tmp)
result = L_R[0]
for target_set in L_R:
result = result.intersection(target_set)
print((len(result))) | n ,m = list(map(int, input().split()))
result = set()
first = True
for i in range(m):
l, r = list(map(int, input().split()))
tmp = set()
for i in range(l, r + 1):
tmp.add(i)
if first:
result = tmp
# print("tmp {}".format(tmp))
first = False
else:
result = result.intersection(tmp)
# print("result {} tmp {}".format(result, tmp))
print((len(result))) | p03037 |
n ,m = list(map(int, input().split()))
result = set()
tmp = set()
first = True
for i in range(m):
l, r = list(map(int, input().split()))
tmp = {i for i in range(l, r + 1)}
if first:
result = tmp
first = False
else:
result = result.intersection(tmp)
print((len(result))) | n ,m = list(map(int, input().split()))
L = []
R = []
for i in range(m):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
if max(L) <= min(R):
print((min(R) - max(L) + 1))
else:
print((0)) | p03037 |
N,M = list(map(int, input().split()))
first,last = list(map(int,input().split(" ")))
set_cnt = set()
for i in range(first,last+1):
set_cnt.add(i)
for m in range(M-1):
_first, _last = list(map(int,input().split(" ")))
_set_cnt = set()
for _ in range(_first,_last+1):
_set_cnt.add(_)
set_cnt = set_cnt & _set_cnt
print((len(set_cnt))) | N,M = list(map(int, input().split()))
min_set_cnt,max_set_cnt = list(map(int,input().split(" ")))
for m in range(M-1):
_first, _last = list(map(int,input().split(" ")))
min_set_cnt = max(min_set_cnt,_first)
max_set_cnt = min(max_set_cnt,_last)
ans = max(max_set_cnt - min_set_cnt + 1, 0)
print(ans) | p03037 |
N,M=list(map(int,input().split()))
x=set([int(x) for x in range(1,N+1)])
for i in range(M):
L,R=list(map(int,input().split()))
y=set(range(L,R+1))
x=x & y
print((len(x))) | N,M=list(map(int,input().split()))
l=[]
r=[]
for i in range(M):
L,R=list(map(int,input().split()))
l.append(L)
r.append(R)
a=max(l)
b=min(r)
x=list(range(a,b+1))
print((len(x))) | p03037 |
# -*- coding: utf-8 -*-
N, M = list(map(int, input().split()))
_count = [0]*N
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L-1,R):
_count[j] += 1
print(_count.count(M)) | # -*- coding: utf-8 -*-
N, M = list(map(int, input().split()))
_L = 1
_R = N
for i in range(M):
L, R = list(map(int, input().split()))
if _L < L:
_L = L
if R < _R:
_R = R
print(str(max(_R-_L+1,0))) | p03037 |
n, m = list(map(int, input().split()))
c = [0]*(n+1)
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
c[j] += 1
ans = 0
for ci in c:
if ci==m:
ans+=1
print(ans) | n, m = list(map(int, input().split()))
c = [0]*(n+1)
L, R = [], []
for i in range(m):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
print((max(minR+1-maxL, 0))) | p03037 |
N,M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
ans = [0 for _ in range(N)]
for i in range(M):
start = LR[i][0]
end = LR[i][1]
for j in range(start-1, end):
ans[j] += 1
cnt = 0
for k in ans:
if k == M:
cnt += 1
print(cnt) | N,M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
L1 = []
R1 = []
for i in range(M):
L1.append(LR[i][0])
R1.append(LR[i][1])
if min(R1)>=max(L1):
print((min(R1)-max(L1)+1))
else:
print((0)) | p03037 |
import sys
N, M = list(map(int, input().split()))
ans = {i for i in range(1, N + 1)}
for line in sys.stdin: # much faster than input
L, R = list(map(int, line.split()))
allowed = {i for i in range(L, R + 1)}
ans = ans & allowed
print((len(ans)))
| import sys
N, M = list(map(int, input().split()))
Lmax = 1
Rmin = N
for line in sys.stdin: # much faster than input
L, R = list(map(int, line.split()))
Lmax = max(L, Lmax)
Rmin = min(R, Rmin)
print((max(0, Rmin - Lmax + 1)))
| p03037 |
L, R = [[], []]
N, M = list(map(int, input().split()))
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
count = 0
for i in range(1,N+1):
count = min(R)-max(L)+1
print(('%d' % count)) | L, R = [[], []]
N, M = list(map(int, input().split()))
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
count = 0
minR = min(R)
maxL = max(L)
if minR < maxL:
count = 0
else:
for i in range(maxL, minR+1):
if i <= N:
count = count + 1
print(('%d' % count)) | p03037 |
n,m = list(map(int,input().split()))
l = [0] * m
r = [0] * m
for i in range(0,m):
l[i], r[i] = list(map(int, input().split()))
count = 0
for i in range(1,n+1):
if max(l) <= i <= min(r):
count += 1
print(count)
| n,m = list(map(int,input().split()))
l = [0] * m
r = [0] * m
for i in range(0,m):
l[i], r[i] = list(map(int, input().split()))
count = 0
max_l = max(l)
min_r = min(r)
for i in range(1,n+1):
if max_l <= i <= min_r:
count += 1
print(count)
| p03037 |
n, m = list(map(int, input().split()))
L, R = [], []
for _ in range(m):
l,r = list(map(int, input().split()))
L.append(l)
R.append(r)
res = 0
for i in range(1, n+1):
if max(L) <= i <= min(R):
res += 1
print(res) | n, m = list(map(int, input().split()))
L, R = [], []
for _ in range(m):
l,r = list(map(int, input().split()))
L.append(l)
R.append(r)
res = min(R) - max(L) + 1
if res < 0:
print((0))
else:
print(res) | p03037 |
n,m = list(map(int,input().split()))
a = {i for i in range(1,n+1)}
for _ in range(m):
l,r = list(map(int,input().split()))
temp = list(range(l,r+1))
a = a.intersection(temp)
print((len(a)))
| n,m = list(map(int,input().split()))
a_min = 1
a_max = n
for _ in range(m):
l,r = list(map(int,input().split()))
a_min = max(a_min,l)
a_max = min(a_max,r)
if a_min>a_max:
print((0))
else:
print((a_max-a_min+1))
| p03037 |
n, m = list(map(int, input().split()))
init_set = None
for i in range(m):
l,m = list(map(int, input().split()))
tmp_set = set([i for i in range(l,m+1)])
if init_set is None:
init_set = tmp_set
else:
init_set = init_set.intersection(tmp_set)
print((min(n,len(init_set)))) | n, m = list(map(int, input().split()))
low = 0
high = 100001
for i in range(m):
l,m = list(map(int, input().split()))
low = max(low, l)
high = min(high, m)
if high-low+1<0:
print((0))
else:
print((min(high-low+1, n))) | p03037 |
N, M = list(map(int, input().split()))
gate = [0] * N
maxL, minR = 0, N
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(maxL, L-1)
minR = min(minR, R-1)
for j in range(maxL, minR+1):
gate[j] += 1
count = 0
for k in gate:
if k == M:
count += 1
print(count)
| N, M = list(map(int, input().split()))
gate = [0] * N
maxL, minR = 0, N
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(maxL, L-1)
minR = min(minR, R-1)
count = minR - maxL + 1
if count >= 0:
print(count)
else:
print((0))
| p03037 |
n, m = [int(x) for x in input().split(' ')]
l = []
r = []
for i in range(m):
l_tmp, r_tmp = [int(x) for x in input().split(' ')]
l.append(l_tmp)
r.append(r_tmp)
result = 0
card_id = l[0]
for j in range(n):
for locked_l, locked_r in zip(l, r):
if not (locked_l <= card_id + j <= locked_r):
break
else:
result += 1
print(result)
| n, m = [int(x) for x in input().split(' ')]
l = []
r = []
for i in range(m):
l_tmp, r_tmp = [int(x) for x in input().split(' ')]
l.append(l_tmp)
r.append(r_tmp)
l_max = max(l)
r_min = min(r)
result = 0
if l_max <= r_min:
result = r_min - l_max + 1
print(result)
| p03037 |
N,M=list(map(int,input().split(" ")))
List=[input().split(" ") for _ in range(M)]
Ans=0
for i in range(1,N+1):
count=0
for j in range(M):
if int(List[j][0])<=i<=int(List[j][1]):
count+=1
if count==M:
Ans+=1
print(Ans) | n, m = list(map(int, input().split()))
R, L = [], []
for i in range(m):
l, r = list(map(int, input().split()))
R.append(r)
L.append(l)
print((max(min(R) - max(L) + 1, 0))) | p03037 |
n, m = list(map(int, input().split()))
gates = []
count = 0
for gate in range(m):
gates.append(list(map(int, input().split())))
for card in range(n):
card+=1
token = True
for gate in range(m):
if (card < gates[gate][0] or gates[gate][1] < card):
token = False
break
if token:
count +=1
print(count) | n, m = list(map(int, input().split()))
gates = []
for i in range(m):
gates.append(list(map(int, input().split())))
candidate = [1, n]
for gate in gates:
if candidate[0] < gate[0]:
candidate[0] = gate[0]
if gate[1] < candidate[1]:
candidate[1] = gate[1]
if (candidate[1] >= candidate[0]):
print((candidate[1] - candidate[0] + 1))
else:
print((0)) | p03037 |
import sys
input = sys.stdin.readline
def prison():
N, M = (int(_) for _ in input().split())
id_l = set(range(1, N+1))
for _ in range(M):
L, R = (int(_) for _ in input().split())
id_l = id_l & set(range(L, R+1))
return len(id_l)
print((prison())) | def prison():
N, M = (int(i) for i in input().split())
L_max = 0
R_min = float("inf")
for _ in range(M):
L, R = (int(i) for i in input().split())
L_max = max(L, L_max)
R_min = min(R, R_min)
result = max(R_min - L_max + 1, 0)
return result
print((prison())) | p03037 |
n,m = list(map(int,input().split()))
A =[]
for _ in range(m):
l,r = list(map(int,input().split()))
tmp = [i for i in range(l,r+1)]
A += tmp
from collections import Counter
cnt = Counter(A)
ans = []
for k,v in list(cnt.items()):
if v == m:
ans.append(k)
print((len(ans)))
| n,m = list(map(int,input().split()))
L = []
R = []
for _ in range(m):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
tmp = min(R)-max(L)+1
if tmp >= 1:
print(tmp)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
master_card = set()
L0, R0 = list(map(int, input().split()))
master_card |= set(range(L0, R0 + 1))
for i in range(1, M):
Li, Ri = list(map(int, input().split()))
master_card &= set(range(Li, Ri + 1))
print((len(master_card)))
| N, M = list(map(int, input().split()))
shita = 1
ue = 100000
for i in range(0, M):
Li, Ri = list(map(int, input().split()))
if shita < Li:
shita = Li
if Ri < ue:
ue = Ri
print((max(ue - shita + 1, 0)))
| p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.