input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
(N, M) = (int(i) for i in input().split(' '))
cards = set(range(1,N+1))
for i in range(0,M):
# gate i can be opened by following card set
(l, r) = (int(j) for j in input().split(' '))
#print(cards, set(range(l,r+1)))
cards = cards.intersection(set(range(l,r+1)))
print((len(cards)))
| (N, M) = (int(i) for i in input().split(' '))
(l0,r0) = (1, N)
n = -1
for i in range(0,M):
# gate i can be opened by following card set
(l, r) = (int(j) for j in input().split(' '))
#print(cards, set(range(l,r+1)))
if l > r0 or r < l0:
n = 0
break
(l0,r0) = (max(l,l0), min(r,r0))
if n == -1:
n = r0-l0 +1
print(n)
| p03037 |
N, M= list(map(int, input().split()))
L,R = [],[]
ans = [0]*(N+1)
for i in range(M):
a,b = list(map(int,input().split()))
for j in range(a,b+1):
ans[j] += 1
count = 0
for i in ans:
if i == M:
count += 1
print(count)
| N, M= list(map(int, input().split()))
L,R = 0,100100
ans = [0]*(N+1)
for i in range(M):
a,b = list(map(int,input().split()))
L = max(L,a)
R = min(R,b)
if R - L >= 0:
print((R-L+1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
C = [1] * N
for i in range(M):
a, b = list(map(int, input().split()))
a = a - 1
if a != 0:
C[:a] = [0] * a
if b-1 != len(C):
C[b:] = [0] * (len(C) - b)
print((sum(C)))
| N, M = list(map(int, input().split()))
L = []
R = []
l = 0
r = 10 ** 6
for i in range(M):
a,b = list(map(int, input().split()))
L.append(a)
R.append(b)
for i in range(M):
if l < L[i]:
l = L[i]
if r > R[i]:
r = R[i]
ans = r-l+1
if ans > 0:
print(ans)
else:
print("0") | p03037 |
n,m= list(map(int,input().split()))
L = []
R = []
for _ in range(m):
l,r = list(map(int,input().split()))
L += [l]
R += [r]
m = min(R)-max(L)+1
if m<0:
print((0))
else:
print(m) | n,m = list(map(int,input().split()))
ll = []
rr = []
for i in range(m):
l,r = list(map(int,input().split()))
ll.append(l)
rr.append(r)
p = min(rr) - max(ll) + 1
if p < 0:
print((0))
else:
print(p) | p03037 |
from collections import Counter
n,m=list(map(int,input().split()))
c=Counter()
for i in range(m):
l,r=list(map(int,input().split()))
idcard=list(range(l,r+1))
c+=Counter(idcard)
cnt=0
for i in range(1,n+1):
if c[i]==m:
cnt+=1
print(cnt) | n,m=list(map(int,input().split()))
l_max=0
r_min=10**5+1
for i in range(m):
l,r=list(map(int,input().split()))
l_max=max(l_max,l)
r_min=min(r_min,r)
print((max(0,r_min-l_max+1))) | p03037 |
n, m = list(map(int, input().split()))
l = []
r = []
for i in range(m):
x, y=[int(i) for i in input().split()]
l.append(x)
r.append(y)
ans = 0
'''
for i in range(n):
cnt = 0
for j in range(m):
for k in range(l[j], r[j]+1):
if i + 1 == k:
cnt += 1
if cnt == m:
ans += 1
print(ans)
'''
for i in range(n):
cnt = 0
#print('cnt rrr')
#print('i=' + str(i))
for j in range(m):
#print(l[j], end=' ')
#print(r[j])
if i + 1 >= l[j] and r[j] >= i + 1:
cnt += 1
#print('cnt='+ str(cnt))
else:
#print('break')
break
if cnt == m:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
maxl = 0
minr = 1000000
for i in range(m):
l, r = list(map(int, input().split()))
maxl = max(maxl, l)
minr = min(minr, r)
if minr < maxl:
print((0))
else:
print((minr - maxl + 1)) | p03037 |
nm = [int(i) for i in input().split()]
lr = [[int(i) for i in input().split()] for i in range(nm[1])]
a = [{j for j in range(lr[i][0], lr[0][1]+1)} for i in range(nm[1])]
b = set()
for i in range(len(a)):
if b == set():
b = a[i]
b = b & a[i]
print((len(b))) | nm = [int(i) for i in input().split()]
lr = [[int(i) for i in input().split()] for i in range(nm[1])]
l = [i[0] for i in lr]
r = [i[1] for i in lr]
print((len(list(range(max(l), min(r)+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)
ans = 0
for i in range(n+1):
count = 0
for j in range(m):
if i>=L[j] and i <=R[j]:
count+=1
if count==m:
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)
L.sort(reverse=True)
R.sort()
ans =0
for i in range(n+1):
if i >=L[0] and i <=R[0]:
ans +=1
print(ans) | p03037 |
N, M = list(map(int, input().split()))
b = [] * M
r = []
for i in range(M):
x, y = list(map(int, input().split()))
g = list(range(x, y + 1))
b.append(g)
# print(b)
for i in range(M - 1):
r = list(set(b[i]) & set(b[i + 1]))
# print(r)
b[i + 1] = r
if M >= 2:
print((len(r)))
else:
print((len(b[0])))
| N, M = list(map(int, input().split()))
l = 0
r = 10000000
for i in range(M):
x, y = list(map(int, input().split()))
l = max(l, x)
r = min(r, y)
print((r - l + 1 if l <= r else 0)) | p03037 |
N, M = list(map(int,input().split()))
A = [1]*N
for i in range(M):
L, R = list(map(int,input().split()))
for j in range(0,L-1):
A[j] = 0
for j in range(R,N):
A[j] =0
print((sum(A))) | N, M = list(map(int,input().split()))
L =[]
R =[]
for i in range(M):
L1, R1 = list(map(int,input().split()))
L.append(L1-1)
R.append(R1+1)
if min(R) - max(L) -1<0:
print("0")
else:
print((min(R)-max(L)-1)) | p03037 |
N, M = list(map(int, input().split()))
num = [0] * N
for _ in range(M):
L, R = list(map(int, input().split()))
L = L - 1
R = R - 1
for i in range(L, R+1):
num[i] += 1
ans = 0
for i in range(N):
if num[i] == M:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
num = [0] * N
L = 1
R = N
for _ in range(M):
l, r = list(map(int, input().split()))
if l > L:
L = l
if r < R:
R = r
print((max(R - L + 1, 0)))
| p03037 |
n, m = list(map(int, input().split()))
li_w = list()
for _ in range(m):
li_w.append(tuple(map(int, input().split())))
answer = set()
for idx, w in enumerate(li_w):
if idx == 0:
answer = set(range(w[0], w[1] + 1))
else:
answer = answer.intersection(list(range(w[0], w[1] + 1)))
print((len(answer)))
| n, m = list(map(int, input().split()))
li_w = list()
for _ in range(m):
li_w.append(tuple(map(int, input().split())))
w_l = 0
w_r = 999999
for w in li_w:
w_l = max(w_l, w[0])
w_r = min(w_r, w[1])
if w_r >= w_l:
print((w_r - w_l + 1))
else:
print((0))
| p03037 |
def main():
IN= open(0).read().split()[2:]
left,right=-1*float("inf"),float("inf")
for L,R in zip(IN[::2],IN[1::2]):
L,R=int(L),int(R)
if right<L or R<left:
print((0))
break
else:
tmp=sorted([left,right,L,R])
left,right=tmp[1],tmp[2]
else:
print((right-left+1))
if __name__=="__main__":
main() | def main():
IN=list(map(int,open(0).read().split()[2:]));L,R=max(IN[::2]),min(IN[1::2]);print((R-L+1 if R>=L else 0))
if __name__=="__main__":
main() | p03037 |
n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(input().split())
haba = a[0]
for i in a:
if int(haba[0]) <= int(i[0]) <= int(haba[1]):
haba[0] = i[0]
elif int(haba[1]) < int(i[0]):
print((0))
exit()
if int(haba[0]) <= int(i[1]) <= int(haba[1]):
haba[1] = i[1]
elif int(i[1]) < int(haba[0]):
print((0))
exit()
if n < int(haba[0]):
ans = 0
elif int(haba[0]) <= n <= int(haba[1]):
ans = n - int(haba[0]) + 1
else:
ans = int(haba[1]) - int(haba[0]) + 1
print(ans) | n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(list(map(int, input().split())))
haba = a[0]
for i in a:
if haba[0] <= i[0] <= haba[1]:
haba[0] = i[0]
elif haba[1] < i[0]:
print((0))
exit()
if haba[0] <= i[1] <= haba[1]:
haba[1] = i[1]
elif i[1] < haba[0]:
print((0))
exit()
if n < haba[0]:
ans = 0
elif haba[0] <= n <= haba[1]:
ans = n - haba[0] + 1
else:
ans = haba[1] - haba[0] + 1
print(ans) | p03037 |
n,m = list(map(int,input().split()))
l,r = list(map(int,input().split()))
temp1 = set(range(l,r+1))
for i in range(m-1):
l,r = list(map(int,input().split()))
temp2 = set(range(l,r+1))
temp1 = temp1 & temp2
print((len(temp1)))
| n,m = list(map(int,input().split()))
s,e = list(map(int,input().split()))
for i in range(m-1):
l,r = list(map(int,input().split()))
s = max(s,l)
e = min(e,r)
print((len(list(range(s,e+1)))))
| p03037 |
def enter_card(card, L, R):
for k in range(L-1,R):
card[k] += 1
return card
def open_list(a, M):
b = []
for (index, i) in enumerate(a):
if i == M:
b.append(index)
return b
N, M = list(map(int, input().split(' ')))
idcard = [0 for i in range(N)]
for i in range(M):
L, R = list(map(int, input().split(' ')))
idcard = enter_card(idcard, L, R)
a = open_list(idcard, M)
print((len(a))) | def enter_card(L, R, f_point, e_point):
if f_point < L:
f_point = L
if e_point > R:
e_point = R
return f_point, e_point
def open_list(L, R):
if L > R:
return 0
else:
return R - L + 1
N, M = list(map(int, input().split(' ')))
f_point = 1
e_point = N
for i in range(M):
L, R = list(map(int, input().split(' ')))
f_point, e_point = enter_card(L, R, f_point, e_point)
a = open_list(f_point, e_point)
print(a) | p03037 |
n,m = list(map(int, input().split()))
a = set(range(1,n+1))
for i in range(m):
l,r = list(map(int,input().split()))
a &= set(range(l,r+1))
print((len(a))) | n,m = list(map(int, input().split()))
a = n
b = 1
for i in range(m):
l,r = list(map(int,input().split()))
a = min(a,r)
b = max(b,l)
print((max(a-b+1,0))) | p03037 |
N, M = list(map(int, input().split()))
dic = {i:0 for i in range(1, N+1)}
c = 0
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L, R+1):
dic[j] = dic[j] + 1
for id, val in list(dic.items()):
if val == M:
c += 1
print(c) | N, M = list(map(int, input().split()))
L = 0
R = N
for i in range(M):
L_new, R_new = list(map(int, input().split()))
if L < L_new:
L = L_new
if R_new < R:
R = R_new
if L > R:
print((0))
else:
print((R-L+1)) | p03037 |
n,m=list(map(int, input().split()))
ans=[0]*n
for _ in range(m):
l,r=list(map(int, input().split()))
for i in range(l, r+1):
if l<=i<=r:
ans[i-1]+=1
print((ans.count(m))) | n,m=list(map(int, input().split()))
maxl=0
minr=n
for _ in range(m):
l,r=list(map(int, input().split()))
maxl = max(maxl, l)
minr = min(minr, r)
print((minr-maxl+1 if maxl<=minr else 0)) | p03037 |
import copy
N, M = list(map(int, input().split()))
LR = []
LR2 = []
count = 0
for i in range(M):
l, r = list(map(int, input().split()))
LR2.append(l)
LR2.append(r)
LR3 = copy.copy(LR2)
LR.append(LR3)
LR2.clear()
for i in range(1, N+1):
flag = 1
for j in LR:
if not (i >= j[0] and i <= j[1]):
flag = 0
break
if flag == 1:
count += 1
print(count)
| import copy
N, M = list(map(int, input().split()))
LR = []
LR2 = []
count = 0
min = 1
max = N
for i in range(M):
l, r = list(map(int, input().split()))
LR2.append(l)
LR2.append(r)
LR3 = copy.copy(LR2)
LR.append(LR3)
LR2.clear()
#print(M, N, LR)
for i in LR:
if min < i[0]:
min = i[0]
if max > i[1]:
max = i[1]
#print(min, max)
if max - min >= 0:
ans = max - min + 1
else:
ans = 0
print(ans)
| p03037 |
f=lambda:list(map(int,input().split()))
_,m=f()
l,r=list(zip(*[f() for _ in range(m)]))
print((max(0,(min(r)-max(l)+1)))) | f=lambda:list(map(int,input().split()))
_,m=f()
l,r=list(zip(*[f() for _ in range(m)]))
print((max(0,min(r)-max(l)+1))) | p03037 |
# import math
# import statistics
# a=input()
#b,c=int(input()),int(input())
# c=[]
# for i in a:
# c.append(i)
e1,e2 = list(map(int,input().split()))
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
h = []
for i in range(e2):
h.append(list(map(int,input().split())))
ans=[]
ha1=[]
ha = [k for i in range(e2) for k in range(1,e1+1) if h[i][0]<=k<=h[i][1]]
sha=sorted(ha)
ma=0
count=1
#最大値求める
for i in range(len(sha)-1):
if sha[i]==sha[i+1]:
count+=1
else:
if count>=e2:
ha1.append(count)
count=1
if count>=e2:
ha1.append(count)
print((len(ha1)))
# for i in range(1,e1+1):
# count=0
# for k in range(e2):
# if h[k][0]<=i<=h[k][1]:
# count+=1
# if count==e2:
# ans.append(count)
# print(len(ans))
| # import math
# import statistics
# a=input()
#b,c=int(input()),int(input())
# c=[]
# for i in a:
# c.append(i)
e1,e2 = list(map(int,input().split()))
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
h = []
for i in range(e2):
h.append(list(map(int,input().split())))
L=[]
R=[]
for i in range(len(h)):
L.append(h[i][0])
for i in range(len(h)):
R.append(h[i][1])
if min(R)>=max(L):
print((min(R)-max(L)+1))
else:
print((0))
| p03037 |
N,M= list(map(int,input().split()))
LRlis = [list(map(int, input().split())) for i in range(M)]
A = list(range(LRlis[0][0],LRlis[0][1]+1))
for i in range(M):
B = list(range(LRlis[i][0],LRlis[i][1]+1))
C = list(set(A) & set(B))
print((len(C))) | N,M= list(map(int,input().split()))
LRlis = [list(map(int, input().split())) for i in range(M)]
maxL = 0
minR = 10**5
for i in range(M):
maxL = max(LRlis[i][0],maxL)
minR = min(LRlis[i][1],minR)
ans = minR-maxL
if ans>=0:
print((ans+1))
else:
print((0)) | p03037 |
#127_C
n, m = list(map(int, input().split()))
s = set(range(1,n+1))
for _ in range(m):
l, r = list(map(int, input().split()))
s &= set(range(l, r+1))
print((len(s))) | #127_C
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)
print((max(0, min(R)-max(L)+1))) | p03037 |
"""
i番目のゲートは LiからRiまでのIDカードのうちどれか1枚を持っていれば通過できます
"""
N, M = list(map(int, input().split()))
arr = [0]*N
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L,R+1,1):
arr[j-1] += 1
print((arr.count(M)))
| """
i番目のゲートは LiからRiまでのIDカードのうちどれか1枚を持っていれば通過できます
"""
N, M = list(map(int, input().split()))
left = 0
right =float("inf")
for i in range(M):
L, R = list(map(int, input().split()))
if left<L:
left = L
if right > R:
right = R
print((max(right-left+1,0))) | p03037 |
n,m = list(map(int,input().split()))
max_L = []
min_R = []
cnt = 0
for i in range(m):
L,R = list(map(int,input().split()))
max_L.append(L)
min_R.append(R)
for i in range(1,n+1):
if max(max_L) <= i <= min(min_R):
cnt += 1
print(cnt) | n,m = list(map(int,input().split()))
max_L = []
min_R = []
cnt = 0
for i in range(m):
L,R = list(map(int,input().split()))
max_L.append(L)
min_R.append(R)
if max(max_L) <= min(min_R):
print((min(min_R)-max(max_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,r=list(map(int,input().split()))
L[i],R[i]=l,r
ans=min(R)-max(L)+1
print((max(ans,0)))
| 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()))
ans=min(R)-max(L)+1
print((max(ans,0)))
| p03037 |
from collections import Counter as co
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
l,r=list(map(int,input().split()))
a.extend(list(range(l,r+1)))
d=co(a)
x,y=list(zip(*list(d.items())))
print((y.count(m)))
| from collections import Counter as co
n,m=list(map(int,input().split()))
a=[]
x=0
y=10**6
for i in range(m):
l,r=list(map(int,input().split()))
if(l>x):
x=l
if(r<y):
y=r
if(y>=x):
print((y-x+1))
else:
print((0))
| p03037 |
N, M = list(map(int,input().split()))
ans = set(range(1,N+1))
for _ in range(M):
a,b = list(map(int,input().split()))
filset = set(range(a,b+1))
ans = ans & filset
print((len(ans))) | N, M = list(map(int,input().split()))
L = 0
R = N+1
for _ in range(M):
l,r = list(map(int,input().split()))
L = max(l,L)
R = min(r,R)
print((len(list(range(L,R+1))))) | p03037 |
n,m = list(map(int,input().split()))
l,r = list(map(int,input().split()))
for i in range(m-1):
in_l,in_r = list(map(int,input().split()))
l = max(l,in_l)
r = min(r,in_r)
print((max(r-l+1,0))) | n,m = list(map(int,input().split()))
lm,rm = list(map(int,input().split()))
for i in range(m-1):
l,r = list(map(int,input().split()))
lm = max(lm,l)
rm = min(rm,r)
print((max(rm-lm+1,0))) | p03037 |
import collections
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
lr_gate = []
for i in range(m):
for j in range(lr[i][0], lr[i][1] + 1):
lr_gate.append(j)
lr_gate = list(map(str, lr_gate))
lr_collect = collections.Counter(lr_gate)
count = 0
for v in list(lr_collect.values()):
if v == m:
count += 1
print(count) | n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
lr.sort()
r_min = 100000
l_max = 0
lr_min = 100000
for i in range(m):
l_max = max(lr[i][0], l_max)
r_min = min(lr[i][1], r_min)
lr_min = [r_min - l_max + 1 if l_max <= r_min else 0]
print((lr_min[0]))
| p03037 |
N, M = list(map(int, input().split(' ')))
for _ in range(M):
l, r = list(map(int, input().split(' ')))
if _ == 0:
if r > N:
r = N
ans = set(range(l, r+1))
else:
if r > N:
r = N
_ans = ans
ans = set(range(l, r+1))
ans = ans & _ans
print((len(ans))) | N, M = list(map(int, input().split(' ')))
L = 1
R = N
for _ in range(M):
l, r = list(map(int, input().split(' ')))
if l > L:
L = l
if r < R:
R = r
ans = R-L+1
if ans >= 0:
print(ans)
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
li=[list(map(int,input().split())) for i in range(m)]
cnt = []
ans=[]
for j in li:
cnt.append(set(num for num in range(j[0],j[1]+1)))
ans = cnt[0]
for k in range(len(cnt)-1):
ans = ans & cnt[k+1]
print((len(ans)))
| n,m = list(map(int,input().split()))
li=[list(map(int,input().split())) for i in range(m)]
max_l,min_r=0,10**9
for i in li:
max_l = max(max_l,i[0])
min_r = min(min_r,i[1])
if min_r >= max_l:
print((min_r-max_l+1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
id = [0] * (N+1)
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L, R+1):
id[j] += 1
cnt = 0
for i in range(1, N+1):
if id[i] == M:
cnt += 1
print(cnt)
| N, M = list(map(int, input().split()))
left = 1
right = N
for i in range(M):
L, R = list(map(int, input().split()))
if L > left :
left = L
if R < right:
right = R
if right-left+1 > 0:
print((right-left+1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
id_set = set(range(N + 1))
for m in range(M):
L, R = list(map(int, input().split()))
id_set = id_set & set(range(L, R + 1, 1))
if len(id_set) == 0:
break
print((len(id_set))) | N, M = list(map(int, input().split()))
L = list(range(M))
R = list(range(M))
for m in range(M):
L[m], R[m] = list(map(int, input().split()))
L_max = max(L)
R_min = min(R)
print((R_min - L_max + 1 if L_max <= R_min 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(1, M):
L, R = list(map(int, input().split()))
ans &= set(range(L, R + 1))
print((len(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)
print((max(min(R) - max(L) + 1, 0))) | p03037 |
N, M = list(map(int, input().split()))
l, r = list(map(int, input().split()))
s = set(list(range(l, r+1)))
for i in range(1, M):
l, r = list(map(int, input().split()))
s1 = set(list(range(l, r+1)))
s = s & s1
print((len(s))) | N, M = list(map(int, input().split()))
L_lis = []
R_lis = []
for i in range(M):
L, R = list(map(int, input().split()))
L_lis.append(L)
R_lis.append(R)
new_L, new_R = max(L_lis), min(R_lis)
if new_L <= new_R:
print((new_R - new_L + 1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
list1 = [0]*N
for i in range(M):
a, b = list(map(int, input().split()))
for j in range(a-1,b):
list1[j] = list1[j]+1
count1 = 0
for i in range(len(list1)):
if list1[i]==M:
count1 +=1
print(count1)
| N, M = list(map(int, input().split()))
a1 = 0
b1 = N
for i in range(M):
a, b = list(map(int, input().split()))
if a1 <= a:
a1 =a
if b1 >= b:
b1 = b
ans = b1-a1+1
if ans <0:
ans = 0
print(ans)
| p03037 |
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
n,m = Is()
s = set(range(1,n+1))
for i in range(m):
l,r = Is()
s = s & set(range(l,r+1))
print((len(s))) | import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
n,m = Is()
left,right = 0,n
for i in range(m):
l,r = Is()
left = max(left,l)
right = min(right,r)
# print(left,right)
if right-left < 0:
print((0))
else:
print((right-left+1)) | p03037 |
n,m=list(map(int,input().split()))
c=[0]*(n+2)
for i in range(m):
l,r=list(map(int,input().split()))
c[l-1]+=1
c[r]-=1
for i in range(1,n+2):
c[i]=c[i]+c[i-1]
ans=0
for i in range(n+2):
if c[i]==m:
ans+=1
print(ans) | n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
for i in range(m-1):
tl,tr=list(map(int,input().split()))
if l<tl:
l=tl
if tr<r:
r=tr
print((max(r-l+1,0))) | p03037 |
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
arr = [list(map(int, input().split())) for i in range(M)]
ID = [True]*N
for arrs in arr:
L, R = arrs
for i in range(N):
if L-1 <= i and i < R:
continue
else:
ID[i] = False
print((ID.count(True)))
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
maxL, minR = 0, N+1
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(L, maxL)
minR = min(R, minR)
ans = minR -maxL + 1
print((ans if ans>0 else 0))
if __name__ == '__main__':
main() | p03037 |
n, m = list(map(int, input().split()))
cnt = [0] * n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r + 1):
cnt[j - 1] += 1
print((cnt.count(m))) | 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)
L1 = max(l)
R1 = min(r)
if R1 >= L1:
print((R1 - L1 + 1))
else:
print((0)) | p03037 |
import sys
input = sys.stdin.readline
num = []
num = [int(i) for i in input().split()]
gate = []
for temp in range(num[1]):
temp = []
temp = [int(i) for i in input().split()]
gate.append(temp)
check = [0] * num[0]
for temp in gate:
while temp[0] <= temp[1]:
check[temp[0]-1] += 1
temp[0] += 1
print((check.count(num[1]))) | import sys
input = sys.stdin.readline
num = []
num = [int(i) for i in input().split()]
syou = []
dai = []
for temp in range(num[1]):
suuzi = []
suuzi = [int(i) for i in input().split()]
syou.append(suuzi[0])
dai.append(suuzi[1])
result= min(dai) - max(syou) + 1
if result > 0:
print(result)
else:
print((0)) | p03037 |
# -*- coding: utf-8 -*-
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):
for j in range(m):
if (i+1 < l[j]) or (i+1 > r[j]):
break
else:
count = count + 1
print(count) | # -*- coding: utf-8 -*-
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()))
l.sort()
r.sort()
if r[0] - l[m-1] + 1 > 0:
print((r[0] - l[m-1] + 1))
else:
print("0") | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
ans = set(range(lr[0][1] + 1)) - set(range(lr[0][0]))
for l, r in lr:
ans &= (set(range(r + 1)) - set(range(l)))
print((len(ans) if n > len(ans) else n)) | n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
max_l = float("-inf")
min_r = float("inf")
for l, r in lr:
max_l = max(max_l, l)
min_r = min(min_r, r + 1)
ans = min_r-max_l
print(("0" if ans <= 0 else ans if ans < n else n))
| p03037 |
n, m = list(map(int, input().split()))
lr = [[int(l), int(r)] for l, r in [input().split() for i in range(m)]]
for j in range(m):
lr[j] = [l for l in range(lr[j][0], lr[j][1]+1)]
lr[j] = set(lr[j])
lr_intersection = lr[0]
for k in range(1,m):
lr_intersection = lr_intersection.intersection(lr[k])
print((len(lr_intersection))) | import heapq
n, m = list(map(int, input().split()))
lr = []
heap1 = []
heap2 = []
for i in range(m):
lr.append(list(map(int, input().split())))
for j in range(m):
heapq.heappush(heap1, -lr[j][0])
heapq.heappush(heap2, lr[j][1])
d = heapq.heappop(heap2) + heapq.heappop(heap1) +1
if d < 0:
print((0))
else:
print(d) | p03037 |
N, M = list(map(int, input().split()))
C = [0]*N
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L, R+1):
C[j-1] += 1
ans = 0
for i in range(N):
if C[i] == M:
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)
ans = 0
l = max(L)
r = min(R)
for i in range(N):
if i+1 >= l and i+1 <= r:
ans += 1
print(ans) | p03037 |
N, M = list(map(int, input().split()))
set_ID = {i for i in range(N)}
for _ in range(M):
L, R = list(map(int, input().split()))
set_M = {i for i in range(L - 1, R)}
set_ID = set_ID & set_M
print((len(set_ID))) | N, M = list(map(int, input().split()))
L_limit = 1
R_limit = N
for _ in range(M):
L, R = list(map(int, input().split()))
L_limit = max(L_limit, L)
R_limit = min(R_limit, R)
print((max(R_limit - L_limit + 1, 0))) | p03037 |
n,m = list(map(int, input().split()))
l, r = [], []
c = 0
a = []
for _ in range(n):
a.append(0)
for _ in range(m):
l,r = list(map(int, input().split()))
for i in range(l-1, r):
a[i] += 1
for i in range(n):
if a[i] == m:
c += 1
print(c)
| n,m = list(map(int, input().split()))
l, r = [], []
x = 0
c = 0
a = []
for _ in range(n):
a.append(0)
for _ in range(m):
l,r = list(map(int, input().split()))
a[l-1] += 1
if r != n:
a[r] -= 1
for i in range(n):
x += a[i]
if(x == m):
c += 1
print(c)
| p03037 |
n,m = list(map(int,input().split()))
l = [0]*m
r = [0]*m
ans = 0
for i in range(m):
l[i],r[i] = list(map(int,input().split()))
for i in range(n):
for j in range(m):
if not l[j]<=i+1<=r[j]:
break
if j==m-1:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
l = [0]*m
r = [0]*m
ans = 0
for i in range(m):
l[i],r[i] = list(map(int,input().split()))
Min = max(l)
Max = min(r)
for i in range(n):
if Min<=i+1<=Max:
ans += 1
print(ans) | p03037 |
n, m = list(map(int, input().split(" ")))
cards = [0] * n
for i in range(m):
l, r = list(map(int, input().split(" ")))
for j in range(l-1, r):
cards[j] += 1
ans = 0
for card in cards:
if card == m:
ans += 1
print(ans) | n, m = list(map(int, input().split(" ")))
s, e = 1, n
for i in range(m):
l, r = list(map(int, input().split(" ")))
if s < l: s = l
if e > r: e = r
print((e-s+1 if s <= e else 0)) | p03037 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n,m =na()
ls = [i for i in range(1,n+1)]
for i in range(m):
l, r = na()
tmp = [j for j in range(l, r+1)]
ls = list(set(ls) & set(tmp))
print((len(ls)))
| import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n,m =na()
ls = 1
rs = n
for i in range(m):
l, r = na()
ls = max(ls, l)
rs = min(rs, r)
if ls > rs:
print((0))
else:
print((rs - ls + 1))
| p03037 |
n,m= list(map(int,input().split()))
for i in range(m):
a,b = list(map(int,input().split()))
if i == 0:
l = [a+j for j in range(b-a+1)]
l = list(set([a+j for j in range(b-a+1)]) & set(l))
print((len(set(l)))) | n,m = list(map(int, input().split()))
left = 0
right = 10**5
for _ in range(m):
l,r = list(map(int,input().split()))
left = max(left, l)
right = min(right,r)
print((max(0,right-left+1)))
| p03037 |
N, M = (int(x) for x in input().split())
L, R = [None]*M, [None]*M
for i in range(M):
L[i], R[i] = (int(x) for x in input().split())
tmp = set(range(L[0], R[0]+1))
for j in range(1, M):
tmp = tmp & set(range(L[j], R[j]+1))
print((len(tmp)))
| N, M = (int(x) for x in input().split())
L, R = [None]*M, [None]*M
for i in range(M):
L[i], R[i] = (int(x) for x in input().split())
tmp = [L[0], R[0]]
for j in range(1, M):
if tmp[0] < L[j]:
tmp[0] = L[j]
if R[j] < tmp[1]:
tmp[1] = R[j]
if tmp[0] > tmp[1]:
print((0))
exit()
print((tmp[1]-tmp[0]+1))
| p03037 |
n, m = list(map(int, input().split(' ')))
s = []
for i in range(m):
l, r = list(map(int, input().split(' ')))
a = set(j for j in range(l, r+1))
s.append(a)
result = s[0]
for i in range(len(s)-1):
result = result & s[i+1]
print((len(list(result)))) | n, m = list(map(int, input().split(' ')))
for i in range(m):
l, r = list(map(int, input().split(' ')))
a = set(j for j in range(l, r+1))
if i == 0:
result = a
else:
result = result & a
print((len(list(result)))) | p03037 |
n, m = list(map(int, input().split(' ')))
for i in range(m):
l, r = list(map(int, input().split(' ')))
a = set(j for j in range(l, r+1))
if i == 0:
result = a
else:
result = result & a
print((len(list(result)))) | n, m = list(map(int, input().split(' ')))
l_ = []
r_ = []
for i in range(m):
l,r = list(map(int, input().split(' ')))
l_ += [l]
r_ += [r]
l = max(l_)
r = min(r_)
if n < l:
print((0))
elif n < r:
r = n
print((r - l + 1))
elif l > r:
print((0))
elif l == r:
print((1))
else:
print((r - l + 1)) | p03037 |
n, m = (int(i) for i in input().split())
ok = [1] * n
for i in range(1,m+1):
tmp_l, tmp_r = (int(j) for j in input().split())
filter_array = [1 if tmp_l<=k<=tmp_r else 0 for k in range(1,n+1)]
ok = [x*y for (x,y) in zip(ok, filter_array)]
print((sum(ok))) | n, m = (int(i) for i in input().split())
ok = [1] * n
l, r = (1,n)
for i in range(1,m+1):
tmp_l, tmp_r = (int(j) for j in input().split())
if l < tmp_l:
l = tmp_l
if r > tmp_r:
r = tmp_r
print(( r-l+1 if r-l+1>0 else 0 )) | p03037 |
n,m = [int(i) for i in input().split()]
num_set = {i for i in range(n+1)}
for i in range(m):
s,e = [int(i) for i in input().split()]
card_set = {i for i in range(s,e+1)}
num_set = num_set & card_set
print((len(num_set))) | n,m = [int(i) for i in input().split()]
l = 0
r = n
for i in range(m):
s,e = [int(i) for i in input().split()]
l = max(l,s)
r = min(r,e)
print((max(0,r-l + 1))) | p03037 |
N,M = list(map(int,input().split()))
L1,R1 = list(map(int,input().split()))
through = set(range(L1,R1+1))
for i in range(M-1):
L,R = list(map(int,input().split()))
through = through & set(range(L,R+1))
print((len(through))) | N,M = list(map(int,input().split()))
through_list = []
for i in range(M):
L,R = list(map(int,input().split()))
through_list.append([L,R])
through_list.sort()
ans_range = through_list[0]
for i in range(M-1):
ans_range = [max(ans_range[0],through_list[i+1][0]),min(ans_range[1],through_list[i+1][1])]
ans = ans_range[1]-ans_range[0]+1
ans = max(0,ans)
print(ans) | p03037 |
n,m=list(map(int,input().split()))
id=[0]*100010
for i in range(m):
ll,rr=input().split()
for j in range(int(ll),int(rr)+1):
id[j]+=1
cnt=0
for i in range(1,n+1):
if id[i]==m:
cnt+=1
print(cnt) | n,m=list(map(int,input().split()))
maxl,minr=0,n
for i in range(m):
l,r=list(map(int,input().split()))
maxl=max(maxl,l)
minr=min(minr,r)
print((max(0,minr-maxl+1))) | p03037 |
n, m = list(map(int, input().split()))
x = list(range(1, n+1))
for i in range(m):
l, r = list(map(int, input().split()))
y = list(range(l, r+1))
x = list(set(x) & set(y))
print((len(x))) | n, m = list(map(int, input().split()))
ls = [0]*m
rs = [0]*m
for i in range(m):
l, r = list(map(int, input().split()))
ls[i] = l
rs[i] = r
print((max(min(rs)-max(ls)+1,0)))
| p03037 |
n, m = list(map(int, input().split()))
s = set(range(1, n+1))
for i in range(m):
l, r = list(map(int, input().split()))
s = s & set(range(l, r+1))
print((len(s)))
| n, m = list(map(int, input().split()))
l_max = 0
r_min = 10**6
for i in range(m):
l, r = list(map(int, input().split()))
l_max = max(l_max, l)
r_min = min(r_min, r)
if l_max > r_min:
print((0))
else:
print((r_min-l_max+1))
| p03037 |
n, m = list(map(int, input().split()))
lr = [tuple(map(int, input().split())) for _ in range(m)]
l, r = lr[0]
ans = set()
for k in range(l, r+1):
ans.add(k)
for i, j in lr[1:]:
ID = set()
for k in range(i, j+1):
ID.add(k)
ans = ans & ID
print((len(ans)))
| n, m = list(map(int, input().split()))
lr = [tuple(map(int, input().split())) for _ in range(m)]
l = 1
r = n
for i, j in lr:
l = max(i, l)
r = min(j, r)
print((max(r-l+1, 0)))
| p03037 |
# ABC 127 c
n, m = [int(el) for el in input().split(' ')]
for i in range(m):
l, r = [int(el) for el in input().split(' ')]
if i == 0:
cards = set(range(l, r + 1))
else:
newcards = set(range(l, r + 1))
cards = cards.intersection(newcards)
print((len(cards)))
| # ABC 127 c
n, m = [int(el) for el in input().split(' ')]
max_l = 0
min_r = n
for i in range(m):
l, r = [int(el) for el in input().split(' ')]
max_l = max(max_l, l)
min_r = min(min_r, r)
print((max(min_r - max_l + 1, 0)))
| p03037 |
N,M= list(map(int,input().split()))
list_A = [0] * N
for i in range(M):
A,B = list(map(int,input().split()))
list_A[A-1:B] = [x+1 for x in list_A[A-1:B]]
print((list_A.count(M)))
| N,M= list(map(int,input().split()))
end = []
start = []
for i in range(M):
A,B = list(map(int,input().split()))
end.append(B)
start.append(A)
end_min = min(end)
start_max = max(start)
if start_max > end_min:
print((0))
else:
print((end_min-start_max+1)) | p03037 |
n,m = list(map(int, input().split()))
a = [0]*m
b = [0]*m
for i in range(m):
l,r = list(map(int, input().split()))
a[i] = l
b[i] = r
s = 0
for i in range(a[m-1], b[m-1]+1):
t = 0
for j in range(m):
if a[j] <= i and i <= b[j]:
t += 1
else:
break
if t == m:
s += 1
print(s) | n,m = list(map(int, input().split()))
a = [0]*m
b = [0]*m
for i in range(m):
l,r = list(map(int, input().split()))
a[i] = l
b[i] = r
x = min(b)
y = max(a)
if x >= y:
print((x-y+1))
else:
print((0)) | p03037 |
n,m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
nums = list(range(1,n+1))
ans = 0
for i in nums:
for j in lr:
if i < j[0] or i > j[1]:
break
else:
ans += 1
print(ans) | n,m = list(map(int, input().split()))
lr = [0, 10**6]
for _ in range(m):
t = sorted(list(map(int, input().split())))
lr[0] = max(lr[0], t[0])
lr[1] = min(lr[1], t[1])
ans = lr[1] - lr[0] + 1
if ans < 0:
print((0))
else:
print(ans) | p03037 |
n,m = list(map(int, input().split()))
lr = [0, 10**6]
for _ in range(m):
t = sorted(list(map(int, input().split())))
lr[0] = max(lr[0], t[0])
lr[1] = min(lr[1], t[1])
ans = lr[1] - lr[0] + 1
if ans < 0:
print((0))
else:
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 = min(R)-max(L)+1
if ans < 0:
print((0))
else:
print(ans)
| 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)
ans = min(R)-max(L)+1
if ans < 0:
print((0))
else:
print(ans)
| n,m = list(map(int, input().split()))
max_l = float("-inf")
min_r = float("inf")
for _ in range(m):
l,r = list(map(int, input().split()))
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = min_r - max_l + 1
if ans > 0:
print(ans)
else:
print((0)) | p03037 |
n,m = list(map(int, input().split()))
max_l = float("-inf")
min_r = float("inf")
for _ in range(m):
l,r = list(map(int, input().split()))
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = min_r - max_l + 1
if ans > 0:
print(ans)
else:
print((0)) | n,m = list(map(int, input().split()))
ls = []
rs = []
for _ in range(m):
l,r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0: print(ans)
else: print((0)) | p03037 |
n,m = list(map(int, input().split()))
l = []
r = []
for _ in range(m):
a,b = list(map(int, input().split()))
l.append(a)
r.append(b)
ans = min(r) - max(l)+1
if ans > 0: print(ans)
else: print((0)) | n,m = list(map(int, input().split()))
x = []
y = []
for _ in range(m):
l,r = list(map(int, input().split()))
x.append(l)
y.append(r)
x = max(x)
y = min(y)
if y-x >= 0: print((y-x+1))
else: print((0)) | p03037 |
def solve():
import sys
n, m, *LR = list(map(int, sys.stdin.read().split()))
L = LR[::2]
R = LR[1::2]
res = set(range(1, n + 1))
for l, r in zip(L, R):
x = set(range(l, r + 1))
res &= x
print((len(res)))
solve()
| def solve():
import sys
n, m, *LR = list(map(int, sys.stdin.read().split()))
L = LR[::2]
R = LR[1::2]
l = max(L)
r = min(R)
print((max(0, r - l + 1)))
solve()
| p03037 |
n,m = list(map(int, input().split()))
gates = []
for i in range(m):
l,r = list(map(int, input().split()))
gates.append((l-1,r-1))
checker = [0 for i in range(n)]
for i in gates:
for j in range(i[0],i[1]+1):
checker[j] += 1
ans = 0
for i in checker:
if i == m:
ans += 1
print(ans)
| n,m = list(map(int, input().split()))
l,r = 0,n
for i in range(m):
L,R = list(map(int, input().split()))
l = max(l,L)
r = min(r,R)
print((r-l+1 if l<=r else 0))
| p03037 |
import sys
N, M = list(map(int, sys.stdin.readline().split()))
LR = [list(map(int,sys.stdin.readline().split())) for i in range(M)]
B = list(range(0, 10 ** 5 + 1))
for i in LR:
A = list(range(i[0], i[1] + 1))
B = set(A) & set(B)
print((len(B))) | import sys
N, M = list(map(int, sys.stdin.readline().split()))
LR = sorted([list(map(int,sys.stdin.readline().split())) for i in range(M)])
L = 1
R = 10 ** 5
for i in LR:
L = max(L, i[0])
R = min(R, i[1])
if R - L >= 0:
print((R - L + 1))
else:
print((0)) | p03037 |
#!/usr/bin/env python3
import math
n,m = list(map(int,input().split(" ")))
idl = []
idr = []
for i in range(m):
a,b = list(map(int,input().split(" ")))
idl.append(a)
idr.append(b)
ans = 0
for i in range(n):
flg = 0
for j in range(m):
if idl[j] <= i+1 <= idr[j]:
pass
else:
flg = 1
if flg == 0:
ans += 1
print(ans) | #!/usr/bin/env python3
import math
n,m = list(map(int,input().split(" ")))
s = 0
t = 10**5+1
for i in range(m):
a,b = list(map(int,input().split(" ")))
if s < a:
s = a
if b < t:
t = b
if t < s:
print((0))
else:
print((t-s+1)) | p03037 |
N, M = list(map(int, input().split()))
keys = set()
for i in range(1, N+1):
keys.add(i)
for _ in range(M):
akey = set()
l, r = list(map(int, input().split()))
for i in range(l, r+1):
akey.add(i)
keys = keys & akey
print((len(keys)))
| N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
if M == 1:
print((R - L + 1))
exit()
for _ in range(M-1):
l, r = list(map(int, input().split()))
if l <= R and L <= r:
L = max(L, l)
R = min(R, r)
else:
print((0))
exit()
print((R - L + 1))
| p03037 |
n, m = list(map(int,input().split(" ")))
l, r = list(map(int,input().split(" ")))
s = set(range(l, r+1))
for _ in range(1,m):
l, r = list(map(int,input().split(" ")))
s_temp = set(range(l, r+1))
s = s & s_temp
print((len(s))) | n, m = list(map(int,input().split(" ")))
l_max, r_min = list(map(int,input().split(" ")))
for _ in range(1,m):
l, r = list(map(int,input().split(" ")))
if l >= l_max:
l_max = l
if r <= r_min:
r_min = r
print((len(list(range(l_max, r_min+1))))) | p03037 |
def main():
n, m = list(map(int, input().split()))
card_list = [0] * n
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l-1,r):
card_list[i] += 1
print((card_list.count(m)))
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
card_list = [0] * n
l_list = []
r_list = []
for _ in range(m):
l, r = list(map(int, input().split()))
l_list.append(l)
r_list.append(r)
max_l = max(l_list)
min_r = min(r_list)
print((min_r-max_l+1 if min_r >= max_l else 0))
if __name__ == '__main__':
main() | p03037 |
import collections
n,m = list(map(int,input().split()))
card = [list(map(int,input().split())) for c in range(m)]
nums = []
for index,c in enumerate(card):
nums += [i for i in range(c[0],c[1]+1)]
ans = 0
for k,v in list(collections.Counter(nums).items()):
if v == m:
ans += 1
print(ans)
| N,M = list(map(int,input().split()))
L = []
R = []
for m in range(M):
l,r = list(map(int,input().split()))
L+=[l]
R+=[r]
print((max(0,min(R)-max(L)+1))) | p03037 |
N, M = list(map(int, input().split()))
L = []
R = []
ans = 0
for _ in range(M):
inp = input().split()
L.append(int(inp[0]))
R.append(int(inp[1]))
for k in range(1,N + 1):
for i,j in zip(L,R):
if i <= k and k <= j:
continue
else:
break
else:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
L = []
R = []
ans = 0
for _ in range(M):
inp = input().split()
L.append(int(inp[0]))
R.append(int(inp[1]))
L_max = max(L)
R_min = min(R)
for i in range(L_max,min(R_min,N) + 1):
ans += 1
print(ans)
| p03037 |
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 max(left)>min(right):
print((0))
else:
print((min(right)-max(left)+1)) | #n=int(input())
n,m=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
left=[];ri=[]
for i in range(m):
l,r=list(map(int,input().split()))
left.append(l)
ri.append(r)
ans=min(ri)-max(left)+1
if ans<=0:
ans=0
print(ans)
| p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
key = set([l + i for i in range(r - l + 1)])
for i in range(m - 1):
l, r = list(map(int, input().split()))
key &= set([l + i for i in range(r - l + 1)])
print((len(key))) | n, m = list(map(int, input().split()))
l0, r0 = list(map(int, input().split()))
for i in range(m - 1):
l, r = list(map(int, input().split()))
l0 = max(l0, l)
r0 = min(r0, r)
print((max(0, r0 - l0 + 1))) | p03037 |
n,m = list(map(int,input().split()))
l,r = [0] * m, [0] * m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
max = 0
for i in range(m):
if max < l[i]:
max = l[i]
min = 10**5
for i in range(m):
if min > r[i]:
min = r[i]
ans = 0
for i in range(max,min+1):
for j in range(m):
if not((i) >= l[j] and (i) <= r[j]):
break
if j == m - 1:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
l,r = [0] * m, [0] * m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
lmax = 0
rmin = 10 ** 5
for i in range(m):
lmax = max(lmax,l[i])
rmin = min(rmin,r[i])
if lmax <= rmin:
print((rmin - lmax + 1))
else:
print("0") | p03037 |
#C - Prison(ABC127)
N,M=list(map(int, input().split()))
l,r=list(map(int, input().split()))
for i in range(M-1):
L,R=list(map(int,input().split()))
l=max(L,l)
r=min(r,R)
if r-l+1>0:
print((r-l+1))
else:
print((0)) | #C - Prison(ABC127)
N,M=list(map(int, input().split()))
l,r=list(map(int, input().split()))
for i in range(M-1):
L,R=list(map(int,input().split()))
if l<L:
l=L
if r>R:
r=R
if r-l+1>0:
print((r-l+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
s=[0]*n
for i in range(m):
l,r=list(map(int,input().split()))
x=l
while x<=r:
s[x-1]+=1
x+=1
ans=[str(i) for i in s]
print((ans.count(str(m)))) | n,m=list(map(int,input().split()))
s=[0]*n
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((0))
else:
print((min(right)-max(left)+1)) | p03037 |
N, M=list(map(int, input().split())) #複数数値入力 「A B」みたいなスペース空いた入力のとき
LR=[[int(i) for i in input().split()] for i in range(M)] # 二次元配列入力 二次元マップみたいな入力のとき
ret = set(range(LR[0][0], LR[0][1]+1))
for i in LR[1:]:
ret = set(range(i[0], i[1]+1)) & ret
print((len(ret)))
|
N, M=list(map(int, input().split())) #複数数値入力 「A B」みたいなスペース空いた入力のとき
LR=[[int(i) for i in input().split()] for i in range(M)] # 二次元配列入力 二次元マップみたいな入力のとき
mi, ma = 0, 10**5
for i in LR:
mi = max(mi, i[0])
ma = min(ma, i[1])
if ma-mi < 0:
print((0))
else:
print((ma-mi + 1)) | p03037 |
n,m = list(map(int,input().split()))
l = []
for i in range(m):
l.append(list(map(int,input().split())))
ls = set(range(1,n+1))
for i in l:
ls = ls & set(range(i[0],i[1]+1))
print((len(ls)))
| n,m = list(map(int,input().split()))
l = []
for i in range(m):
l.append(list(map(int,input().split())))
ans = 0
lmax = 0
rmin = float('inf')
for i in l:
if i[0]>lmax:
lmax = i[0]
if i[1]<rmin:
rmin = i[1]
if lmax <= rmin:
ans = rmin - lmax + 1
print(ans)
| p03037 |
n,m = list(map(int,input().split()))
li1 = []
for i in range(m):
a,b = list(map(int,input().split()))
li2 = []
for j in range(a,b+1):
li2.append(j)
li1.append(set(li2))
for i in range(m):
li1[0] = li1[0] & li1[i]
print((len(li1[0]))) | n,m = list(map(int,input().split()))
li,lia = [],[]
for i in range(m):
a,b = list(map(int,input().split()))
li.append(a)
lia.append(b)
if min(lia)-max(li)+1 <= 0:
print((0))
else:
print((min(lia)-max(li)+1)) | p03037 |
from itertools import islice
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
lst = []
for i in LR:
lst_ = set(list(range(i[0],i[1]+1)))
lst.append(lst_)
lst = set.intersection(set(lst[0]), *islice(lst, 1, None))
print((len(lst)))
| 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()))
print((max(min(R) - max(L) + 1, 0))) | p03037 |
n,m = list(map(int,input().split()))
l, r = list(map(int,input().split()))
set1 = set([i for i in range(l,r+1)])
for i in range(m-1):
l, r = list(map(int,input().split()))
set2 = set([i for i in range(l,r+1)])
set1 = set1 & set2
print((len(set1))) | n,m = list(map(int,input().split()))
L0, R0 = list(map(int,input().split()))
for i in range(m-1):
l, r = list(map(int,input().split()))
L0 = max(L0,l)
R0 = min(R0,r)
if L0 <= R0:
print((R0-L0+1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
flag = [0] * N
for _ in range(M):
L, R = list(map(int, input().split()))
L -= 1
R -= 1
for i in range(L, R+1):
flag[i] += 1
count = 0
for i in range(N):
if flag[i] == M:
count += 1
print(count) | 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 = min(R) - max(L) + 1
if ans < 0:
ans = 0
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 = min(R) - max(L) + 1
if ans < 0:
ans = 0
print(ans) | N, M = list(map(int, input().split()))
max_L, min_R = 1, N
for i in range(M):
L, R = list(map(int, input().split()))
if L > max_L:
max_L = L
if R < min_R:
min_R = R
ans = min_R - max_L + 1
if ans < 0:
ans = 0
print(ans) | p03037 |
N, M = list(map(int, input().split()))
ans = set(range(1, N+1))
for i in range(M):
l, r = list(map(int, input().split()))
ans &= set(range(l, r+1))
print((len(ans))) | N, M = list(map(int, input().split()))
ans = set(range(1, N+1))
l_max = 1
r_min = N
for i in range(M):
l, r = list(map(int, input().split()))
l_max = max(l_max, l)
r_min = min(r_min, r)
print((max(0, r_min - l_max + 1))) | p03037 |
n, m = [int(i) for i in input().split()]
lr = [[int(i) for i in input().split()] for j in range(m)]
l = max(x[0] for x in lr)
r = min(x[1] for x in lr)
print((max(0, r - l + 1)))
| n, m = list(map(int, input().split()))
lmax, rmin = 0, n
for _ in range(m):
l, r = list(map(int, input().split()))
lmax = max(l, lmax)
rmin = min(r, rmin)
print((max(rmin - lmax + 1, 0)))
| p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
ans = set(range(L, R+1))
for _ in range(M-1):
L, R = list(map(int, input().split()))
ans = ans & set(range(L, R+1))
print((len(ans)))
| N, M = list(map(int, input().split()))
left, right = list(map(int, input().split()))
for _ in range(M-1):
L, R = list(map(int, input().split()))
left = max(left, L)
right = min(right, R)
print((max(right - left + 1, 0)))
| p03037 |
n, m = list(map(int, input().split()))
if m == 1:
l, r = list(map(int, input().split()))
print((r-l+1))
else:
l, r = list(map(int, input().split()))
ans = list(range(l, r+1))
for _ in range(m-1):
l, r = list(map(int, input().split()))
lr_list = list(range(l, r+1))
ans = [a for a in ans if lr_list.count(a) == 1]
if len(ans) == 0:
break
print((len(ans))) | n, m = list(map(int, input().split()))
if m == 1:
l, r = list(map(int, input().split()))
print((r-l+1))
else:
ls, rs = [], []
for _ in range(m):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
ans = set(list(range(1, N + 1)))
for lr in LR:
l, r = lr
ans = ans & set(list(range(l, r + 1)))
print((len(list(ans)))) | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
A, B = 1, N
for lr in LR:
L, R = lr
if R < A or B < L:
print((0))
exit()
if A <= L <= R <= B:
A, B = L, R
elif L <= A <= R <= B:
B = R
elif A <= L <= B <= R:
A = L
print((B - A + 1))
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
ans = set(list(range(1, N + 1)))
for lr in LR:
l, r = lr
ans = ans & set(list(range(l, r + 1)))
print((len(list(ans))))
| N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
A, B = 1, N
for lr in LR:
L, R = lr
if R < A or B < L:
print((0))
exit()
if A <= L <= R <= B:
A, B = L, R
elif L <= A <= R <= B:
B = R
elif A <= L <= B <= R:
A = L
print((B - A + 1))
| p03037 |
import collections
N,M=list(map(int,input().split()))
L=[]
R=[]
for i in range(M):
l,r=[int(i) for i in input().split()]
L.append(l)
R.append(r)
LR=[]
for i in range(M):
for j in range(L[i],R[i]+1):
LR.append(j)
LR=collections.Counter(LR)
LR=LR.most_common()
LR=dict(LR)
cnt=0
for i in list(LR.values()):
if i==M:
cnt+=1
print(cnt) | N,M=list(map(int,input().split()))
L=[]
R=[]
for i in range(M):
l,r=[int(i) for i in input().split()]
L.append(l)
R.append(r)
Lmax=max(L)
Rmin=min(R)
if Rmin-Lmax>=0:
print((Rmin-Lmax+1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
li = [list(map(int, input().split())) for _ in range(m)] #n行に１つずつ入力される整数
num_li = [idx for idx in range(10**5+1)]
for l, r in li:
temp_li = [i for i in range(l, r+1)]
num_li = set(temp_li) & set(num_li)
print((len(num_li))) | n, m = list(map(int, input().split()))
li = [list(map(int, input().split())) for _ in range(m)] #n行に１つずつ入力される整数
l_li = []
r_li = []
for l, r in li:
l_li.append(l)
r_li.append(r)
print((max(min(r_li) - max(l_li) +1, 0))) | p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.