input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,M=list(map(int,input().split()))
l,r=list(map(int,input().split()))
s={i for i in range(l,r+1)}
for _ in range(M-1):
l, r = list(map(int, input().split()))
t = {i for i in range(l, r + 1)}
s = s & t
if len(s) == 0:
print((0))
exit(0)
print((len(s))) | N,M=list(map(int,input().split()))
lmax=0
rmin=9999999
for i in range(M):
l,r=list(map(int,input().split()))
lmax=max(lmax,l)
rmin=min(rmin,r)
print((max(rmin-lmax+1,0)))
| p03037 |
N,M = list(map(int, input().split()))
L,R = list(map(int, input().split()))
ans = set(list(range(L,R+1)))
for _ in range(M-1):
L,R = list(map(int, input().split()))
gate = set(range(L,R+1))
ans &= gate
print((len(ans)))
| N,M = list(map(int, input().split()))
L,R = list(map(int, input().split()))
for _ in range(M-1):
l,r = list(map(int, input().split()))
if R>r:
R = r
if L<l:
L = l
if (R-L+1)>0:
print((R-L+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
a=[0]*(n+1)
for i in range(n):
a[i+1]=i+1
l,r=list(map(int,input().split()))
s=set(a[l:r+1])
for i in range(1,m):
l,r=list(map(int,input().split()))
s=s&set(a[l:r+1])
print((len(s))) | n,m=list(map(int,input().split()))
L,R=1,n
for i in range(m):
l,r=list(map(int,input().split()))
L=max(L,l)
R=min(R,r)
print((max(0,R-L+1))) | p03037 |
N,M = list(map(int,input().split()))
l,r = list(map(int,input().split()))
Kouho = [int(i) for i in range(l,r+1)]
for i in range(M-1):
l,r = list(map(int,input().split()))
tmp = [int(i) for i in range(l,r+1)]
for j in Kouho[:]:
if not j in tmp:
Kouho.remove(j)
print((len(Kouho)))
| N,M = list(map(int,input().split()))
Max_l = 0
Min_r = float('inf')
for i in range(M):
l,r = list(map(int,input().split()))
Max_l = max(Max_l,l)
Min_r = min(Min_r,r)
ans = 0
if Max_l<=Min_r:
ans = Min_r-Max_l+1
print(ans)
| p03037 |
n,m = list(map(int,input().split()))
L = [0]*m; R = [0]*m; cnt = 0
for i in range(m):
L[i],R[i] = list(map(int,input().split()))
for i in range(1, n+1):
if max(L) <= i <= min(R):
cnt += 1
print(cnt) | n,m = map(int,input().split())
L = [0]*m; R = [0]*m; cnt = 0
for i in range(m):
L[i],R[i] = map(int,input().split())
ml = max(L); mr = min(R)
print(mr-ml+1) if ml <= mr else print(0)
| p03037 |
#!/usr/bin/env python
# coding: utf-8
# In[1]:
import sys
#input = sys.stdin.readline
N, M = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(M)]
# In[9]:
union = set(range(1, N+1))
for i in range(M):
union = union & set(range(lr[i][0], lr[i][1]+1))
print((len(union)))
# In[ ]:
| #!/usr/bin/env python
# coding: utf-8
# In[15]:
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# In[ ]:
"""
4 2
1 3
2 4
"""
# In[19]:
l_ = 0
r_ = N
for i in range(M):
l, r = list(map(int, input().split()))
l_ = max(l_, l)
r_ = min(r_, r)
# In[21]:
#print(l_, r_)
ids = r_-l_+1
if ids < 0:
print((0))
else:
print(ids)
# In[ ]:
| p03037 |
n,m = list(map(int,input().split()))
ansl = 0
ansr = n+1
for i in range(m):
l,r = list(map(int,input().split()))
ansl = max(ansl,l)
ansr = min(ansr,r)
print((0 if ansl > ansr else ansr-ansl+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)
ansl = max(L)
ansr = min(R)
print((0 if ansl > ansr else ansr-ansl+1)) | p03037 |
n,m = list(map(int,input().split()))
para_val = []
for i in range(m) :
a,b = list(map(int,input().split()))
para_val.append([i for i in range(a,b+1)])
ans = [i for i in range(1,n+1)]
for i in range(m):
ans = list(set(ans) & set(para_val[i]))
print((len(ans))) | n,m = list(map(int,input().split()))
para_val = []
for i in range(m) :
a,b = list(map(int,input().split()))
para_val.append([a,b])
migi = []
hidari = []
for i,j in para_val:
migi.append(i)
hidari.append(j)
a = max(migi)
b = min(hidari)
if b - a >= 0 : print(("{}".format(b-a+ 1)))
else : print("0") | p03037 |
n, m = (int(x) for x in input().split())
ss = set(range(n))
for _ in range(m):
l, r = (int(x) for x in input().split())
ss = ss.intersection(list(range(l-1, r)))
print((len(ss))) | n, m = (int(x) for x in input().split())
max_l = float('-inf')
min_r = float('inf')
for _ in range(m):
l, r = (int(x) for x in input().split())
max_l = max(max_l, l)
min_r = min(min_r, r)
print((max(0, min_r - max_l+1))) | p03037 |
n,m=list(map(int,input().split()))
ln=[]
for i in range(m):
ln.append(list(map(int,input().split())))
ln[i]=list(range(ln[i][0],ln[i][1]+1))
nxl=ln[0]
for i in range(1,m):
nxl=set(nxl)&set(ln[i])
print((len(list(nxl))))
| n,m=list(map(int,input().split()))
l=[]
r=[]
t=[]
for i in range(m):
t.append(list(map(int,input().split())))
l.append(t[i][0])
r.append(t[i][1])
print((max(min(r)-max(l)+1,0)))
| 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(1,n+1):
if max(L) <= i and min(R) >= i:
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(1,n+1):
if L <= i and R >= i:
ans += 1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
L = [0] * m
R = [0] * m
judge = [0] * n
for i in range(m):
L[i], R[i] = list(map(int, input().split()))
for j in range(L[i], R[i] + 1):
judge[j - 1] += 1
cnt = 0
for i in range(n):
if judge[i] == m:
cnt += 1
print(cnt) |
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((min(R) - max(L) + 1 if min(R) >= max(L) else 0)) | p03037 |
N,M=list(map(int,input().split()))
s=[list(map(int,input().split())) for x in range(M)]
max_left=0
min_right=N
for i in range(M):
if s[i][0]>max_left:
max_left=s[i][0]
if s[i][1]<min_right:
min_right=s[i][1]
cnt=0
for j in range(max_left,min_right+1):
cnt+=1
print(cnt) | n, m = list(map(int, input().split()))
max_left = 1
min_right = n
for i in range(m):
left, right = list(map(int, input().split()))
max_left = max(max_left, left)
min_right = min(min_right, right)
print((max(min_right - max_left + 1, 0))) | p03037 |
import sys
N, M = [int(x) for x in sys.stdin.readline().split(" ")]
prev = set(range(1, N+1))
for i in range(0, M):
L, R = [int(x) for x in sys.stdin.readline().split(" ")]
accepted = set(range(L, R+1))
prev = prev & accepted
print((len(prev)))
| import sys
N, M = [int(x) for x in sys.stdin.readline().split(" ")]
_min, _max = 1, 100000
for _ in range(0, M):
L, R = [int(x) for x in sys.stdin.readline().split(" ")]
_min = max(_min, L)
_max = min(_max, R)
if _min > _max:
print((0))
else:
print((_max - _min + 1))
| p03037 |
N,M = (int(x) for x in input().split())
lr = []
for i in range(1,N+1):
lr.append(i)
l,r = (int(x) for x in input().split())
d = set(lr[l-1:r])
for i in range(1,M):
l,r = (int(x) for x in input().split())
d = d & set(lr[l-1:r])
print((len(d)))
| N,M = (int(x) for x in input().split())
R = N
L = 1
for i in range(M):
l,r = (int(x) for x in input().split())
if l > L:
L = l
if r < R:
R = r
if R-L < 0:
print((0))
else:
print((R-L+1)) | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
count = 0
for i in range(1,n+1):
flag = True
for j in range(m):
if not lr[j][0] <= i <= lr[j][1]:
flag = False
break
if flag:
count += 1
print(count)
| n, m = list(map(int, input().split()))
lll = []
rrr = []
for _ in range(m):
lr = list(map(int, input().split()))
lll.append(lr[0])
rrr.append(lr[1])
maxl = max(lll)
minr = min(rrr)
count = 0
for i in range(1,n+1):
if maxl <= i <= minr:
count += 1
print(count)
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
count = 0
for i in range(1, N+1):
flag = 0
for j in range(M-1, -1, -1):
if not (LR[j][0] <= i <= LR[j][1]):
break
else:
flag += 1
if flag == M:
count += 1
print(count) | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
L = []
R = []
for i in LR:
L.append(i[0])
R.append(i[1])
if min(R) - max(L) < 0:
print((0))
else:
print((min(R) - max(L) + 1)) | p03037 |
data = list([int(x) for x in input().split(" ")])
cardNum = []
for n in range(data[1]):
cardNum.append(list([int(x) for x in input().split(" ")]))
#print(cardNum)
card = [0]*(data[0]+1)
for n in range(data[1]):
for m in range(cardNum[n][0],cardNum[n][1]+1):
card[m] += 1
print((card.count(data[1]))) | data = list([int(x) for x in input().split(" ")])
cardNum = []
for n in range(data[1]):
cardNum.append(list([int(x) for x in input().split(" ")]))
card = [0]*(data[0])
check = [0,1000000]
for n in range(data[1]):
if check[0] < cardNum[n][0]:
check[0] = cardNum[n][0]
if check[1] > cardNum[n][1]:
check[1] = cardNum[n][1]
if check[1]-check[0] < 0:
print((0))
else:
print((check[1]-check[0]+1)) | p03037 |
#!/usr/bin/env python3
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
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 = N
for i in range(N):
for j in range(M):
c = 0
if not L[j] <= i + 1 <= R[j]:
ans -= 1
c = 1
if c == 1:
break
print(ans)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
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(0, ans)))
if __name__ == '__main__':
main()
| p03037 |
N, M = list(map(int, input().split()))
lst = [True] * N
for i in range(M):
L, R = list(map(int, input().split()))
L -= 1
R -= 1
for j in range(0, L):
lst[j] = False
for j in range(R+1, N):
lst[j] = False
ans = 0
for i in lst:
if i:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
tmp = list(map(int, input().split()))
L.append(tmp[0])
R.append(tmp[1])
ans = min(R) - max(L) + 1
if ans < 0: ans = 0
print(ans) | p03037 |
n,m = list(map(int,input().split()))
l = [-1]*(m)
r = [-1]*m
for i in range(m):
a,b = list(map(int,input().split()))
l[i]=a
r[i]=b
#print(r)
#print(l)
count = 0
k = 0
for i in range(1,n+1):
k=0
for j in range(m):
if (l[j] <= i) and (i <= r[j]):
k += 1
#print(k)
if k== m:
count +=1
print(count) | n,m = list(map(int,input().split()))
l = [-1]*(m)
r = [-1]*m
for i in range(m):
a,b = list(map(int,input().split()))
l[i]=a
r[i]=b
right = n
left = 0
#print(r)
#print(l)
count = 0
k = 0
for i in range(m):
right = min(r[i],right)
left = max(l[i],left)
ans = max(0,right -left +1)
print(ans)
| p03037 |
N,R = list(map(int,input().split()))
id = [0]*N
ans = 0
for i in range(R):
A,B = list(map(int,input().split()))
for j in range(B-A+1):
id[j+A-1]+=1
for i in id:
if i == R:
ans += 1
print(ans) | N,R = list(map(int,input().split()))
min = 0
max = 10000000
ans = 0
for i in range(R):
A,B = list(map(int,input().split()))
if A > min:
min = A
if B < max:
max = B
if min < max:
ans = max - min + 1
elif min == max:
ans = 1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
lst = [0 for i in range(n+1)]
cnt = 0
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l, r+1):
lst[i] += 1
cnt = lst.count(m)
print(cnt) | n, m = map(int, input().split())
l_list = []
r_list = []
cnt = 0
for _ in range(m):
l, r = map(int, input().split())
l_list.append(l)
r_list.append(r)
print(min(r_list) - max(l_list) + 1) if min(r_list) >= max(l_list) else print(0)
| p03037 |
n, m = list(map(int, input().split()))
ans=set()
l, r = list(map(int, input().split()))
for j in range(l,r+1):
ans.add(j)
for i in range(m-1):
l, r = list(map(int, input().split()))
temp=set()
for j in range(l,r+1):
temp.add(j)
ans=temp & ans
print((len(ans))) | n, m = list(map(int, input().split()))
ans=set()
lm=0
rm=n
for i in range(m):
l, r = list(map(int, input().split()))
lm=max(l, lm)
rm=min(r, rm)
if rm - lm < 0:
print((0))
else:
print((rm - lm + 1)) | p03037 |
n,k = list(map(int,input().split()))
rc = [list(map(int,input().split())) for i in range(k)]
tmp = set(range(1,n+1))
for i in rc:
tmp = tmp & set(range(i[0],i[1]+1))
print((len(tmp))) | n,k = list(map(int,input().split()))
rc = [list(map(int,input().split())) for i in range(k)]
transpose = [x for x in zip(*rc)]
ans = min(transpose[1]) - max(transpose[0])
if ans<0:
print((0))
else:
print((ans+1)) | p03037 |
N, M = [int(x) for x in input().split()]
a, b = [int(x) for x in input().split()]
s = set(range(a, b + 1))
for _ in range(M-1):
a, b = [int(x) for x in input().split()]
temp = set(range(a, b + 1))
s = s & temp
print((len(s))) | N, M = [int(x) for x in input().split()]
max_a, min_b = 0, 10000000
for _ in range(M):
a, b = [int(x) for x in input().split()]
if a > max_a:
max_a = a
if b < min_b:
min_b = b
if min_b < max_a:
print((0))
else:
print((min_b - max_a + 1)) | p03037 |
N, M = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(M)]
count_dict = {}
gate = set(range(10**5 + 1))
for i in range (M):
l = LR[i][0]
r = LR[i][1]
temp = set(range(l, r+1))
gate = gate & temp
print((len(gate)))
| N, M = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(M)]
count_dict = {}
gate = set(range(10**5 + 1))
L = 1
R = 10**5
for i in range (M):
l = LR[i][0]
r = LR[i][1]
if l > L:
L = l
if r < R:
R = r
print((len(list(range(L, R+1))))) | p03037 |
N, M = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(M)]
count_dict = {}
gate = set(range(10**5 + 1))
L = 1
R = 10**5
for i in range (M):
l = LR[i][0]
r = LR[i][1]
if l > L:
L = l
if r < R:
R = r
print((len(list(range(L, R+1))))) | N, M = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(M)]
L = 1
R = 10**5
for i in range (M):
l = LR[i][0]
r = LR[i][1]
if l > L:
L = l
if r < R:
R = r
print((len(list(range(L, R+1))))) | p03037 |
N, M = list(map(int, input().split()))
s = set()
for i in range(M):
L, R = list(map(int, input().split()))
tmp = set()
for j in range(L, R + 1):
tmp |= {j}
if i == 0:
s |= tmp
else:
s &= tmp
print((len(s))) | N, M = list(map(int, input().split()))
tmpL = 0
tmpR = float("inf")
for i in range(M):
L, R = list(map(int, input().split()))
tmpL = max(tmpL, L)
tmpR = min(tmpR, R)
if tmpR - tmpL < 0:
print((0))
else:
print((tmpR - tmpL + 1)) | p03037 |
from sys import stdin
def main():
N, M = list(map(int, input().split()))
seki = set(list(range(1,N+1)))
for i in range(M):
l, r = list(map(int, stdin.readline().rstrip().split()))
#l, r = map(int, input().split())
seki &= set(list(range(l, r+1)))
print((len(seki)))
if __name__ == '__main__':
main() | # 解説を見ての解答
from sys import stdin
n, m = list(map(int, stdin.readline().rstrip().split()))
lr = [list(map(int, stdin.readline().rstrip().split())) for i in range(m)]
l, r = lr[0][0], lr[0][1]
for i in range(m):
l = max(l, lr[i][0])
r = min(r, lr[i][1])
print((max(0,r-l+1))) | p03037 |
N, M = list(map(int, input().split()))
A = []
for i in range(M):
L, R = list(map(int, input().split()))
if i == 0:
S = set(list(range(L, R + 1)))
else:
S = S & set(list(range(L, R + 1)))
if len(S) == 0:
break
# L = set(A[0])
# for i in range(1, M):
# L = L & set(A[i])
print((len(S)))
| N, M = list(map(int, input().split()))
A = []
for i in range(M):
L, R = list(map(int, input().split()))
if i == 0:
Lmax = L
Rmin = R
else:
Lmax = max(L, Lmax)
Rmin = min(R, Rmin)
# L = set(A[0])
# for i in range(1, M):
# L = L & set(A[i])
if Rmin-Lmax < 0:
print((0))
else:
print((Rmin-Lmax+1))
| p03037 |
n,m = list(map(int,input().split(" ")))
gates = []
for i in range(m):
gates.append(list(map(int,input().split(" "))))
result = [1, n]
for card in gates:
if result[0] < card[0]:
result[0] = card[0]
if result[1] > card[1]:
result[1] = card[1]
tmp = result[1] - result[0] + 1
if tmp >= 0:
print(tmp)
else:
print((0)) | n,m = list(map(int,input().split(" ")))
lr = []
ming = 0
maxg = 10 **6
for i in range(m):
a,b = list(map(int,input().split(" ")))
lr.append((a,b))
for i in lr:
if i[0] > ming:
ming = i[0]
if i[1] < maxg:
maxg = i[1]
print((max([0, maxg - ming + 1]))) | p03037 |
from sys import stdin
def main():
n,m = [int(x) for x in stdin.readline().rstrip().split()]
l,r = [int(x) for x in stdin.readline().rstrip().split()]
ans = set(range(l,r+1))
for i in range(m-1):
l,r = [int(x) for x in stdin.readline().rstrip().split()]
cards = set(range(l,r+1))
ans = ans & cards
print((len(ans)))
if __name__=='__main__':
main() | from sys import stdin
def main():
n,m = [int(x) for x in stdin.readline().rstrip().split()]
_l = 0
_r = n
for i in range(m):
l,r = [int(x) for x in stdin.readline().rstrip().split()]
_l = max(l, _l)
_r = min(r, _r)
if _r - _l < 0:
print((0))
else:
print((_r - _l + 1))
if __name__=='__main__':
main() | p03037 |
n, m = list(map(int, input().split()))
card = [i for i in range(1, n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
x = [i for i in range(l, r+1)]
card = list(set(card) & set(x))
print((len(card)))
| 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)
if (L <= R):
print((R - L + 1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
for i in range(M):
if i==0:
L, R = list(map(int, input().split()))
s = set(range(L,R+1))
S = s
else:
L, R = list(map(int, input().split()))
s = set(range(L,R+1))
S = S & s
print((len(S))) | N, M = list(map(int, input().split()))
f = 0
for i in range(M):
if i==0:
L1, R1 = list(map(int, input().split()))
else:
L2, R2 = list(map(int, input().split()))
if R1 < L2 or L1 > R2:
print((0))
f+=1
break
elif L2<L1 and R1<R2:
continue
elif L1<L2 and R2<R1:
L1 = L2
R1 = R2
elif L2<L1 and R2<R1:
R1 = R2
elif L1<L2 and R1<R2:
L1 = L2
else:
continue
s = set(range(L1,R1+1))
if f!=1:
print((len(s))) | p03037 |
#!/usr/bin/env python3
import sys
def solve(N: int, M: int, L: "List[int]", R: "List[int]"):
result = set([i for i in range(int(1e5 + 1))])
# print(result)
for i in range(M):
l_to_r = {j for j in range(L[i], R[i] + 1)}
result = result & l_to_r
# print(result)
print((len(result)))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
L = [int()] * (M) # type: "List[int]"
R = [int()] * (M) # type: "List[int]"
for i in range(M):
L[i] = int(next(tokens))
R[i] = int(next(tokens))
solve(N, M, L, R)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, M: int, L: "List[int]", R: "List[int]"):
L = max(L)
R = min(R)
if L <= R:
print((R - L + 1))
elif L > R:
print((0))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
L = [int()] * (M) # type: "List[int]"
R = [int()] * (M) # type: "List[int]"
for i in range(M):
L[i] = int(next(tokens))
R[i] = int(next(tokens))
solve(N, M, L, R)
if __name__ == "__main__":
main()
| 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 &= set(range(l, r+1))
print((len(s))) | n, m = list(map(int, input().split()))
l, r = 1, n
for i in range(m):
li, ri = list(map(int, input().split()))
if ri<l or r<li:
print((0))
exit()
if l<=li and ri<=r:
l, r = li, ri
elif l<=ri<=r:
r = ri
elif l<=li<=r:
l = li
else:
continue
print((r-l+1)) | p03037 |
n, m = list(map(int, input().split()))
lr = []
for _ in range(m):
l, r = list(map(int, input().split()))
lr.append([l, r])
cnt = 0
for i in range(1, n+1):
for l, r in lr:
if not l <= i <= r:
break
else:
cnt += 1
print(cnt) | 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)
max_l = max(L)
min_r = min(R)
if max_l <= min_r:
print((min_r - max_l + 1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
count = 0
ans=[]
for i in range(M):
l, r = list(map(int, input().split()))
if count == 0:
for j in range(l, r+1):
ans.append(j)
else:
tmp = []
for j in range(l, r+1):
tmp.append(j)
ans = list(set(tmp) & set(ans))
count += 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)
maxl = max(L)
minr = min(R)
ans = minr - maxl + 1
if ans > 0:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
LR = []
for i in range(M):
L, R = list(map(int, input().split()))
LR.append(list(range(L, R+1)))
ans = set(LR[0])
for i in LR:
ans = ans & set(i)
print((len(ans))) | N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
L, R = list(map(int, input().split()))
ans = set(list(range(L, R+1)))
for i in range(M-1):
L, R = list(map(int, input().split()))
ans = ans & set(list(range(L, R+1)))
print((len(ans))) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
L, R = list(map(int, input().split()))
ans = set(list(range(L, R+1)))
for i in range(M-1):
L, R = list(map(int, input().split()))
ans = ans & set(list(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)
ans = list(range(max(L),min(R)+1))
print((len(ans)))
| p03037 |
N,M=list(map(int,input().split()))
L=[0]
R=[0]
ans=0
for i in range(M):
Lt,Rt=list(map(int,input().split()))
L.append(Lt)
R.append(Rt)
for i in range(1,N+1):
flg=1
for j in range(1,M+1):
if i >= L[j] and i <= R[j]:
continue
flg=0
if flg==1:
ans+=1
print(ans)
| N,M=list(map(int,input().split()))
Lm=0
Rm=N
ans=0
for i in range(M):
Lt,Rt=list(map(int,input().split()))
if Lm < Lt:
Lm = Lt
if Rm > Rt:
Rm = Rt
if Rm < Lm:
print((0))
else:
print((Rm-Lm+1))
| p03037 |
# C - Prison
N, M = list(map(int, input().split()))
ls = [i for i in range(1, N + 1)]
for _ in range(M):
l, r = list(map(int, input().split()))
ls = set(ls) & set([i for i in range(l, r + 1)])
print((len(ls)))
| # C - Prison
N, M = list(map(int, input().split()))
left = 0
right = 10 ** 5
for _ in range(M):
l, r = list(map(int, input().split()))
left, right = max(left, l), min(right, r)
print((len([i for i in range(left, right + 1)]) if left <= right else 0))
| p03037 |
n, m = [int(x) for x in input().split(' ')]
l, r = [int(x) for x in input().split(' ')]
res = set(range(l, r+1))
for i in range(int(m-1)):
l, r = [int(x) for x in input().split(' ')]
res &= set(range(l, r+1))
print((len(res)))
| n, m = [int(x) for x in input().split(' ')]
lr = [(int(l), int(r)) for l, r in [input().split(' ') for _ in range(m)]]
l = max([x[0] for x in lr])
r = min([x[1] for x in lr])
print((r-l+1 if l <= r else 0))
| p03037 |
N,M=list(map(int,input().split()))
dp=[0]*(N)
for _ in range(M):
L,R=list(map(int,input().split()))
for j in range(L-1,R):
dp[j]+=1
print((dp.count(M))) | N,M=list(map(int,input().split()))
l=0
r=float("Inf")
for i in range(M):
L,R=list(map(int,input().split()))
l=max(l,L)
r=min(r,R)
print((max(r-l+1,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()))
a=0
for i in range(1,N+1):
flag=0
for j in range(M):
if i<l[j] or i>r[j]:
flag=1
if flag==0:
a+=1
print(a) | n,m=list(map(int,input().split()))
x=1;y=n
for _ in range(m):
l,r=list(map(int,input().split()))
if x<l:
x=l
if y>r:
y=r
print((max(y-x+1,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):
tmp_l,tmp_r = list(map(int,input().split()))
tmp = set(range(tmp_l,tmp_r+1))
ans = ans&tmp
print((len(ans))) | n,m = list(map(int,input().split()))
ans_l = 0
ans_r = 100001
for i in range(m):
tmp_l,tmp_r = list(map(int,input().split()))
if ans_l < tmp_l:
ans_l = tmp_l
if tmp_r < ans_r:
ans_r = tmp_r
if ans_l <= ans_r:
print((ans_r-ans_l+1))
else:
print((0)) | p03037 |
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
l = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
listT = []
for t in l:
listT = listT + t
s = min(list(set(listT)))
e = max(list(set(listT)))
cnt = 0
for i in range(s, e+1):
isOk = True
for start, end in l:
if i < start or i > end:
isOk = False
break
if isOk == True:
cnt = cnt + 1
print(cnt) | from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
l = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
sMax = 0
eMin = 0
for s, e in l:
if sMax < s or sMax == 0:
sMax = s
if eMin > e or eMin == 0:
eMin = e
if eMin - sMax >= 0:
print((eMin - sMax + 1))
else:
print((0)) | p03037 |
N, M = list(map(int,input().split()))
A = [0] * (N+1)
for i in range(M):
L,R = list(map(int,input().split()))
for i in range(L,R+1):
A[i] += 1
print((sum([1 for a in A if a == M]))) | 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)
print((max(0,min(Rs)-max(Ls)+1))) | p03037 |
n,m = list(map(int,input().split()))
l,r = 1,n
for i in range(m):
l_tmp,r_tmp = list(map(int,input().split()))
if l_tmp > l:
l = l_tmp
if r_tmp < r:
r = r_tmp
if l>r:
print((0))
else:
print((r-l+1)) | def main():
n,m = list(map(int,input().split()))
l = 0
r = float('inf')
for i in range(m):
l_,r_ = list(map(int,input().split()))
if l<l_:
l = l_
if r_<r:
r = r_
if r-l>=0:
print((r-l+1))
else:
print((0))
if __name__ == "__main__":
main() | p03037 |
N,M=list(map(int,input().split()))
LR=[list(map(int,input().split())) for _ in range(M)]
count=0
judge=0
for i in range(1,N+1):
judge=0
for lr in LR:
if lr[0]<=i<=lr[1]:
judge+=1
if judge==M:
count+=1
print(count) | N,M=list(map(int,input().split()))
LR=[list(map(int,input().split())) for _ in range(M)]
l=1
r=N
for i in LR:
#print(i)
if i[0]>l:
l=i[0]
if i[1]<r:
r=i[1]
if r>=l:
print((r-l+1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
l1, r1 = list(map(int, input().split()))
num = list(range(1, n+1))
ans = set(num[l1-1:r1])
for i in range(2, m+1):
l, r = list(map(int, input().split()))
can_pass = set(num[l-1:r1])
ans = ans & can_pass
if len(ans) == 0:
break
print((len(ans))) | n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
for i in range(m-1):
l_c, r_c = list(map(int, input().split()))
l = max(l, l_c)
r = min(r, r_c)
print((max(r-l+1, 0))) | p03037 |
n,m = list(map(int,input().split()))
lr = [list(map(int,input().split())) for _ in range(m)]
li = [0]*n
for i in lr:
for j in range(i[0]-1,i[1]):
li[j] += 1
print((li.count(m)))
| n,m = list(map(int,input().split()))
llist = []
rlist = []
for i in range(m):
l,r = list(map(int,input().split()))
llist += [l]
rlist += [r]
print((max(0,min(rlist)-max(llist)+1)))
| p03037 |
n, m = list(map(int, input().split()))
ll = [0 for i in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l, r+1, 1):
ll[i] += 1
print((ll.count(m)))
| n, m = list(map(int, input().split()))
ll = [0 for i in range(n+1)]
l_max = 0
r_min = 1000000
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
if l_max <= r_min:
print((r_min - l_max + 1))
else:
print((0))
| p03037 |
n, m = list(map(int,input().split()))
cards = [1 for _ in range(n)]
for _ in range(m):
l,r= [int(x) - 1 for x in input().split()]
if 0 < l:
cards[:l] = [0 for _ in range(l)]
if r < n-1:
cards[r+1:] = [0 for _ in range(n-1 -r)]
print((sum(cards))) | n, m = list(map(int,input().split()))
cards = [1 for _ in range(n)]
L = 0
R = n-1
for _ in range(m):
l,r= [int(x) - 1 for x in input().split()]
L = max(L,l)
R = min(R,r)
print((max(0,R-L+1))) | p03037 |
N,M=list(map(int,input().split()))
G=[]
a=[]
S=[]
for i in range(M):
l,r=list(map(int,input().split()))
a=[x for x in range(l,r+1)]
G.append(a)
G_diff=set(G[0])
for i in range(1,M):
G_diff=set(G_diff).intersection(set(G[i]))
if G_diff:
print((len(G_diff)))
else:
print((0)) | 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)
max_l=max(L)
min_r=min(R)
if min_r-max_l>=0:
print((min_r-max_l+1))
else:
print((0)) | 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,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)) | 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,m = list(map(int,input().split()))
Low = []
Right = []
for i in range(m):
l,r = list(map(int,input().split()))
Low.append(l)
Right.append(r)
if min(Right) < max(Low):
print((0))
else:
print((min(Right)- max(Low) + 1)) | 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()))
def prison(N,M,L,R):
num=list(range(L[0],(R[0]+1)))
for j in range(M):
num=[i for i in num if L[j]<=i<=R[j]]
return len(num)
print((prison(N,M,L,R))) | 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()))
def prison(N,M,L,R):
max_val=min(R)
min_val=max(L)
num=max_val-min_val+1
if num<=0:
num=0
return(num)
print((prison(N,M,L,R))) | p03037 |
import copy
n,m = list(map(int,input().split()))
l = []
for i in range(m):
l.append([int(i) for i in input().split()])
ll = []
for k in range(l[0][0],l[0][1]+1):
ll.append(k)
for j in range(1,m):
for i in ll:
lll = copy.copy(ll)
if i < l[j][0] or i > l[j][1]:
lll.remove(i)
ll = lll
print((len(ll))) | n,m = list(map(int,input().split()))
l = []
for i in range(m):
l.append([int(i) for i in input().split()])
maxL = l[0][0]
minR = l[0][1]
for j in range(1,m):
if maxL <= l[j][0]:
maxL = l[j][0]
if minR >= l[j][1]:
minR = l[j][1]
if maxL <= minR:
print((minR - maxL + 1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
gate = []
for i in range(m):
li, ri = list(map(int, input().split()))
gate.append([li, ri])
l_inside = list(range(1, n+1))
for i in range(m):
l_inside = [j for j in l_inside if gate[i][0] <= j and j <= gate[i][1]]
print((len(l_inside)))
| # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
l_max = 1
r_min = n
for i in range(m):
li, ri = list(map(int, input().split()))
if l_max < li:
l_max = li
if r_min > ri:
r_min = ri
print((r_min-l_max+1 if r_min-l_max >= 0 else 0))
| p03037 |
N, M = list(map(int, input().split()))
left = -1
right = N
for _ in range(M):
tl, tr = list(map(int, input().split()))
left = max(left, tl)
right = min(right, tr)
print((max(0, right - left + 1)))
| N, M = list(map(int, input().split()))
maxL = 1
minR = N
for _ in range(M):
l, r = list(map(int, input().split()))
maxL = max(maxL, l)
minR = min(minR, r)
print((max(minR - maxL + 1, 0)))
# 交差しない場合を考慮する
| p03037 |
N, M = list(map(int, input().split()))
left = 1
right = N
# 1-indexed
# [left, right]
for _ 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:
break
print((max(0, right - left + 1)))
| n, m = list(map(int, input().split()))
l, r = [], []
for _ in range(m):
ll, rr = list(map(int, input().split()))
l.append(ll)
r.append(rr)
print((max(0, min(r) - max(l) + 1)))
| p03037 |
n, m = list(map(int, input().split()))
l, r = [], []
for _ in range(m):
ll, rr = list(map(int, input().split()))
l.append(ll)
r.append(rr)
print((max(0, min(r) - max(l) + 1)))
| def main():
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
L, R = 1, N
for _ in range(M):
left, right = list(map(int, input().split()))
L = max(L, left)
R = min(R, right)
ans = max(0, R - L + 1)
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| p03037 |
# import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def logical_and(lst, l, r):
res = []
for i in range(l, r+1):
if i in lst:
res.append(i)
return res
def solve():
n, m = MI()
l, r = MI()
ans = list(range(l, r+1))
for _ in range(m-1):
l, r = MI()
ans = logical_and(ans, l, r)
print((len(ans)))
if __name__ == '__main__':
solve()
| # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solve():
n, m = MI()
maxl, minr = MI()
for _ in range(m-1):
l, r = MI()
if maxl < l:
maxl = l
if r < minr:
minr = r
if maxl <= minr:
print((minr - maxl + 1))
else:
print((0))
if __name__ == '__main__':
solve()
| p03037 |
n,m = list(map(int,input().split()))
lr = [[] for i in range(m)]
cnt = 0
for _ in range(m):
l,r = list(map(int,input().split()))
lr[_].append(l)
lr[_].append(r)
for nn in range(1,n+1):
ok = True
for ran in lr:
if ran[0] > nn or ran[1] < nn:
ok = False
if ok:
cnt += 1
print(cnt) | n,m = list(map(int,input().split()))
ls = [i for i in range(m)]
rs = [i for i in range(m)]
cnt = 0
for _ in range(m):
ls[_],rs[_] = list(map(int,input().split()))
maxl = max(ls)
minr = min(rs)
for nn in range(1,n+1):
if maxl <= nn and minr >= nn:
cnt += 1
print(cnt) | p03037 |
N, M = list(map(int, input().split()))
cards = set(range(1, N+1))
for i in range(M):
L, R = list(map(int, input().split()))
cards &= set(range(L, R+1))
print((len(cards)))
| N, M = list(map(int, input().split()))
maxl = 0
minr = N + 1
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()))
ans = [1] * n
for i in range(m):
l, r = list(map(int, input().split()))
ans[:l-1] = [0] * (l - 1)
ans[r:] = [0] * (n - r)
print((sum(ans))) | n, m = list(map(int, input().split()))
Left = -1
Right = n + 1
for i in range(m):
l, r = list(map(int, input().split()))
Left = max(Left, l)
Right = min(Right, r)
if Left <= Right:
ans = Right - Left + 1
else:
ans = 0
print(ans) | p03037 |
N, M = list(map(int, input().split()))
m = 0b0
exec("m = 0b" + "1"*N)
for i in range(M):
L, R = list(map(int, input().split()))
exec("_m = 0b" + "1"*(R - L + 1) + "0"*(N - R))
m = m & _m
if m == 0b0 : break
print((bin(m).count("1")))
| 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((max(R - L + 1, 0))) | p03037 |
n,m=list(map(int,input().split()))
L=[list(map(int,input().split())) for _ in range(m)]
lm=0
rm=float('inf')
for i in range(m):
lm=max(L[i][0],lm)
rm=min(L[i][1],rm)
print((max(0,rm-lm+1))) | n,m=list(map(int,input().split()))
ml,mr=0,float('inf')
for i in range(m):
l,r=list(map(int,input().split()))
ml=max(l,ml)
mr=min(r,mr)
print((max(mr-ml+1,0))) | p03037 |
N,M = list(map(int,input().split()))
cards = [x for x in range(N)]
tmp = cards
for i in range(M):
L,R = list(map(int,input().split()))
tmp = list([x for x in tmp if L - 1 <= x <= R - 1])
print((len(tmp)))
| N,M = list(map(int,input().split()))
cards = [x for x in range(N)]
tmp = cards
Ls = []
Rs = []
for i in range(M):
L,R = list(map(int,input().split()))
Ls.append(L - 1)
Rs.append(R - 1)
print((max(min(Rs) - max(Ls) + 1,0)))
| p03037 |
M,N = list(map(int,input().split()))
ans=set(range(1,M+1))
for s in range(N):
S,Z = list(map(int,input().split()))
ans = ans & set(range(S, Z+1))
print((len(ans))) | M,N = list(map(int,input().split()))
ans=set(range(1,M+1))
START=0
END=10**5
for s in range(N):
S,Z = list(map(int,input().split()))
if START <= S:
START = S
if END >= Z:
END = Z
ans = list(range(START,END+1))
print((len(ans))) | p03037 |
n,m = list(map(int,input().split()))
cnt = set(range(1,n+1))
for i in range(m):
l,r = list(map(int,input().split()))
cnt = cnt&set(i for i in range(l,r+1))
print((len(cnt))) | n,m = list(map(int,input().split()))
a,b = 1,n
for i in range(m):
l,r = list(map(int,input().split()))
a,b = max(a,l),min(b,r)
print((max(b-a+1,0))) | p03037 |
n,m=list(map(int,input().split()))
a=list(range(1,n+1))
for i in range(m):
b=list(map(int,input().split()))
c=list(range(b[0],b[1]+1))
a=list(set(c) & set(a))
print((len(list(a)))) | n,m=list(map(int,input().split()))
a=list(range(1,n+1))
l=0
l1=0
r=0
r1=10**10
for i in range(m):
l,r=list(map(int,input().split()))
if l>l1:
l1=l
if r<r1:
r1=r
b=list(range(l1,r1+1))
a=list(set(b) & set(a))
print((len(list(a)))) | p03037 |
#coding:utf-8
n, m = list(map(int, input().split()))
l, r = 10**6, 0
ll = []
ans_l = []
tmp_ans = []
for i in range(m):
a, b = list(map(int, input().split()))
ans_l = []
if i == 0:
tmp_ans = list(range(a, b+1, 1))
else:
for j in range(len(tmp_ans)):
if a <= tmp_ans[j] <= b:
ans_l.append(tmp_ans[j])
tmp_ans = ans_l[:]
print((len(set(tmp_ans)))) | #coding:utf-8
n, m = list(map(int, input().split()))
l, r = 0, 10**6
for i in range(m):
a, b = list(map(int, input().split()))
l = max(l, a)
r = min(r, b)
print((r - l + 1 if l <= r else 0)) | p03037 |
#coding:utf-8
n, m = list(map(int, input().split()))
l, r = 0, 10**6
for i in range(m):
a, b = list(map(int, input().split()))
l = max(l, a)
r = min(r, b)
print((r - l + 1 if l <= r else 0)) | # coding: utf-8
N, M = list(map(int, input().split()))
L, R = 0, 10**6
card = []
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 |
card, gate = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ans = {i for i in range(l, r+1)}
for i in range(gate-1):
l, r = list(map(int, input().split()))
ans = ans & {i for i in range(l, r+1)}
print((len(ans))) | card, gate = list(map(int, input().split()))
max_l = 0
min_r = 100000
for i in range(gate):
l, r = list(map(int, input().split()))
max_l = max(max_l, l)
min_r = min(min_r, r)
print((len(list(range(max_l, min_r+1))))) | p03037 |
N, M = list(map(int, input().split()))
card = set(list(range(1, N+1)))
for _ in range(M):
l, r = list(map(int, input().split()))
gate = set(list(range(l, r+1)))
card &= gate
print((len(card))) | 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)
max_L = max(L)
min_R = min(R)
print((len(list(range(max_L, min_R+1))))) | p03037 |
n,m = [int(s) for s in input().split(' ')]
ans = []
anss = None
for i in range(m):
l,r = [int(s) for s in input().split(' ')]
temp = set(i for i in range(l,r+1))
ans.append(temp)
if i == 0:
anss = ans[0]
else:
anss &= ans[i]
print((len(anss))) | n,m = [int(s) for s in input().split(' ')]
ans = []
minn = 10000000
maxx = 0
for i in range(m):
l,r = [int(s) for s in input().split(' ')]
maxx = max(maxx,l)
minn = min(minn,r)
if minn - maxx < 0:
print((0))
else:
print((minn - maxx+1)) | p03037 |
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
nums=[x+1 for x in range(n)]
cnt=0
ans=0
for i in nums:
cnt=0
for t in l:
if(t[0]<=i<=t[1]):
cnt+=1
if(cnt==len(l)):
ans+=1
print(ans) | n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
nums=[x+1 for x in range(n)]
ans=0
r=[0,100000]
for i in l:
r[0]=max(r[0],i[0])
r[1]=min(r[1],i[1])
for i in nums:
if(r[0]<=i<=r[1]):
ans+=1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
a=[0]*n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l,r+1):
a[j-1] += 1
print((a.count(m))) | n, m = list(map(int, input().split()))
a=0
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+1 >= 0:
print((b-a+1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
a=0
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+1 >= 0:
print((b-a+1))
else:
print((0)) | n, m = list(map(int, input().split()))
l = 1
r = 10**5
for _ in range(m):
l_, r_ = list(map(int, input().split()))
l = max(l, l_)
r = min(r, r_)
if r>=l:
print((r-l+1))
else:
print((0)) | p03037 |
n , m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
d = [0]*n
for i in range(m):
for j in range(lr[i][0]-1, lr[i][1]):
d[j] += 1
print((d.count(m))) | n , m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
mi = 0
ma = n
for i in range(m):
mi = max(mi, lr[i][0])
ma = min(ma, lr[i][1])
if ma-mi>=0:
print((ma-mi+1))
else:
print((0)) | p03037 |
n , m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for i in range(m)]
mi = 0
ma = n
for i in range(m):
mi = max(mi, lr[i][0])
ma = min(ma, lr[i][1])
if ma-mi>=0:
print((ma-mi+1))
else:
print((0)) | n,m=list(map(int,input().split()))
lb=0
ub=n
for i in range(m):
l,r=list(map(int,input().split()))
lb=max(lb,l)
ub=min(ub,r)
if ub>=lb:
print((ub-lb+1))
else:
print((0)) | p03037 |
# -*- coding: utf-8 -*-
# IMPORT ###############################################################################################################
import sys # システム
# sys.setrecursionlimit(10**6) # 再帰処理の上限変更
# from collections import deque, Counter # キュー・個数カウント
# from itertools import accumulate, permutations, combinations # 累積和・順列・組み合わせ
# from operator import itemgetter # ソート補助
# from bisect import bisect_left, bisect_right, bisect # 二分探索
# from heapq import heappop, heappush # プライオリティキュー
# from fractions import gcd # 最大公約数
# from math import ceil, floor, sqrt, cos, sin, tan, pi # 数学処理
# from copy import deepcopy # オブジェクトコピー
# import numpy as np # 数値計算
# MAIN #################################################################################################################
def main():
# Init #############################################################################################################
im = InputManager()
# Input ############################################################################################################
n, m = im.inputMultiple()
gates = [0 for _ in range(n)]
for _ in range(m):
l, r = im.inputMultiple()
for i in range(l-1, r):
gates[i] += 1
# Logic ############################################################################################################
# Output ###########################################################################################################
print((gates.count(m)))
# Return ###########################################################################################################
return
# INPUT MANAGER ########################################################################################################
class InputManager(object):
def __init__(self):
pass
@staticmethod
def inputSingle(dtype=int):
return dtype(eval(input()))
@staticmethod
def inputMultiple(dtype=int, aslist=False):
if aslist:
return list(map(dtype, input().split()))
else:
return list(map(dtype, input().split()))
@staticmethod
def input2D(h, dtype=int):
return [list(map(dtype, input().split())) for i in range(h)]
# CALL MAIN ############################################################################################################
main() | # -*- coding: utf-8 -*-
# IMPORT ###############################################################################################################
import sys # システム
# sys.setrecursionlimit(10**6) # 再帰処理の上限変更
# from collections import deque, Counter # キュー・個数カウント
# from itertools import accumulate, permutations, combinations # 累積和・順列・組み合わせ
# from operator import itemgetter # ソート補助
# from bisect import bisect_left, bisect_right, bisect # 二分探索
# from heapq import heappop, heappush # プライオリティキュー
# from fractions import gcd # 最大公約数
# from math import ceil, floor, sqrt, cos, sin, tan, pi # 数学処理
# from copy import deepcopy # オブジェクトコピー
# import numpy as np # 数値計算
# MAIN #################################################################################################################
def main():
# Init #############################################################################################################
im = InputManager()
# Input ############################################################################################################
n, m = im.inputMultiple()
left = 0
right = n
for _ in range(m):
l, r = im.inputMultiple()
left = max(left, l - 1)
right = min(right, r - 1)
# Logic ############################################################################################################
# Output ###########################################################################################################
if (right - left) >= 0:
print((right - left + 1))
else:
print((0))
# Return ###########################################################################################################
return
# INPUT MANAGER ########################################################################################################
class InputManager(object):
def __init__(self):
pass
@staticmethod
def inputSingle(dtype=int):
return dtype(eval(input()))
@staticmethod
def inputMultiple(dtype=int, aslist=False):
if aslist:
return list(map(dtype, input().split()))
else:
return list(map(dtype, input().split()))
@staticmethod
def input2D(h, dtype=int):
return [list(map(dtype, input().split())) for i in range(h)]
# CALL MAIN ############################################################################################################
main() | p03037 |
N, M = list(map(int, input().split()))
ans = []
for i in range(M):
tmp = list(map(int, input().split()))
if i == 0:
ans = [x for x in range(tmp[0], tmp[1]+1)]
else:
cur = [x for x in range(tmp[0], tmp[1]+1)]
ans = [x for x in cur if x in ans]
print((len(ans))) | N, M = list(map(int, input().split()))
L = 0
R = 10**5
for i in range(M):
tmp = list(map(int, input().split()))
if L<tmp[0]:
L = tmp[0]
if R>tmp[1]:
R = tmp[1]
ans = [x for x in range(L, R+1)]
print((len(ans))) | p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
l1 = list(range(L, R+1))
if M > 1:
for i in range(1, M):
L, R = list(map(int, input().split()))
l2 = list(range(L, R+1))
l1 = list(set(l1)&set(l2))
print((len(l1))) | N, M = list(map(int, input().split()))
start = []
end = []
for i in range(M):
L, R = list(map(int, input().split()))
start.append(L)
end.append(R)
start_max = max(start)
end_min = min(end)
print((max(0, end_min - start_max + 1))) | p03037 |
n,m = list(map(int,input().split()))
card = [int(0) for i in range(n+1)]
for i in range(m):
l,r = list(map(int,input().split()))
for j in range(l,r+1):
card[j] += 1
#print(card)
cnt = 0
for i in range(n+1):
if card[i] == m:
cnt += 1
print(cnt) | n,m = list(map(int,input().split()))
min_card,max_card = 0,n
for i in range(m):
l,r = list(map(int,input().split()))
min_card = max(min_card,l)
max_card = min(max_card,r)
#print(min_card,max_card)
if min_card<=max_card:
print((max_card-min_card+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()))
a = [0]*M
for j in range(M):
a[j] = set(range(L[j],R[j]+1))
origin = set(range(1,N+1))
for k in range(M):
origin &= a[k]
print((len(origin))) | 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()))
min = L[0]
max = R[0]
for j in range(1,M):
if min < L[j]:
min = L[j]
if max > R[j]:
max = R[j]
if max-min+1 >= 0:
print((max-min+1))
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
l,r = [],[]
for i in range(m):
x,y = list(map(int,input().split()))
l.append(x)
r.append(y)
cnt = 0
for i in range(1,n+1):
for j in range(m):
if l[j]>i or r[j]<i:
break
else:
cnt+=1
print(cnt) | n,m = list(map(int,input().split()))
l,r = [],[]
for i in range(m):
x,y = list(map(int,input().split()))
l.append(x)
r.append(y)
print((max(0,min(r)-max(l)+1))) | p03037 |
n, m = list(map(int, input().split()))
LRs = [list(map(int, input().split())) for i in range(m)]
LRs = [set(range(LRs[i][0], LRs[i][1] + 1)) for i in range(m)]
for i in range(m):
if i == 0:
union = LRs[i]
else:
union = union & LRs[i]
print((len(union))) | n, m = list(map(int, input().split()))
LRs = [list(map(int, input().split())) for i in range(m)]
under = 1
top = 10**6+10
for i in range(m):
if LRs[i][0] > under:
under = LRs[i][0]
if LRs[i][1] < top:
top = LRs[i][1]
if not top >= under:
print((0))
else:
print((top - under + 1))
| p03037 |
n,m=list(map(int,input().split()))
set0=set(range(1,n+1))
for i in range(m):
l,r=list(map(int,input().split()))
id_set=set(range(l,r+1))
set0=set0&id_set
print((len(set0))) | n,m=list(map(int,input().split()))
l0,r0=1,n
for i in range(m):
l,r=list(map(int,input().split()))
if l>r0 or r<l0:
print((0))
exit()
else:
l0=max(l0,l)
r0=min(r0,r)
print((r0-l0+1)) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
card = set(range(l, r+1))
for i in range(1, m):
l, r = list(map(int, input().split()))
card = card.intersection(set(range(l, r+1)))
print((len(card))) | import sys
n, m = list(map(int, input().split()))
min_id = 1
max_id = n
for i in range(m):
l, r = list(map(int, input().split()))
if min_id < l <= max_id:
min_id = l
elif max_id < l:
print((0))
sys.exit()
if min_id <= r < max_id:
max_id = r
elif r < min_id:
print((0))
sys.exit()
print((max_id - min_id + 1))
| 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()))
ALL = [0] * N
for i in range(M):
for j in range(L[i]-1, R[i]):
ALL[j] += 1
print((ALL.count(M))) | 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(0,min(R) - max(L)+1))) | p03037 |
import sys
n, m = list(map(int, input().split()))
nums = []
# for i in range(n):
# nums.append(i + 1)
for i in range(m):
l, r = list(map(int, input().split()))
if i == 0:
for j in range(l, r + 1):
nums.append(j)
nums = list([x for x in nums if l <= x <= r])
if len(nums) == 0:
print((0))
sys.exit()
print((len(nums))) | n, m = list(map(int, input().split()))
lr = []
for i in range(m):
lr.append(list(map(int, input().split())))
lmax = 0
mmin = 10**5
for i in range(m):
lmax = max(lmax, lr[i][0])
mmin = min(mmin, lr[i][1])
print((max(0, mmin - lmax + 1))) | p03037 |
n,m = list(map(int,input().split()))
key = []
for i in range(1,n+1):
key.append(i)
ans = []
for i in range(m):
ls = []
L,R = list(map(int,input().split()))
for j in range(L,R+1):
ls.append(j)
key = (set(ls)&set(key))
print((len(key)))
| n,m = list(map(int,input().split()))
key = []
for i in range(1,n+1):
key.append(i)
ls = [0,100000]
for i in range(m):
L,R = list(map(int,input().split()))
if L > ls[0]:
ls[0] = L
if R < ls[1]:
ls[1] = R
ans = []
for i in range(ls[0],ls[1]+1):
ans.append(i)
print((len(set(ans)&set(key))))
| p03037 |
n ,m = list(map(int,input().split()))
s = set()
for i in range(m):
l,r = list(map(int, input().split()))
tmp = {i for i in range(l,r+1)}
if not s:
s = s | tmp
continue
s = s&tmp
print((len(s))) | n ,m = list(map(int,input().split()))
ll = 1
rr = n
for i in range(m):
l,r = list(map(int, input().split()))
if l > ll:
ll = l
if r < rr:
rr = r
ans = rr - ll +1
if ans > 0:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
L, R = 0, float("inf")
for _ in range(M):
l, r = list(map(int, input().split()))
if l > L:
L = l
if r < R:
R = r
count = 0
if L <= R:
for i in range(1, N+1):
if L <= i <= R:
count += 1
print(count) | N, M = list(map(int, input().split()))
L, R = 0, float("inf")
for _ in range(M):
l, r = list(map(int, input().split()))
if l > L:
L = l
if r < R:
R = r
if L <= R:
print((R - L + 1))
else:
print((0)) | p03037 |
n, m = list(map(int,input().split()))
for i in range(m):
l, r = list(map(int,input().split()))
rg = list(range(l, r + 1))
if i == 0:
s = set(rg)
else:
x = s & set(rg)
s = x
rg2 = set(range(1, n + 1))
ans = rg2 & s
print((len(ans)))
| n, m = list(map(int,input().split()))
lsl = []
lsr = []
for i in range(m):
l, r = list(map(int,input().split()))
lsl.append(l)
lsr.append(r)
lmax = max(lsl)
rmin = min(lsr)
if lmax > rmin:
print((0))
else:
ans1 = set(range(1,n + 1))
ans2 = set(range(lmax,rmin + 1))
ans = ans1 & ans2
print((len(ans)))
| p03037 |
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
def gcd(a, b):
a, b = max(a, b), min(a, b)
while a % b > 0: a, b = b, a % b
return b
def solve():
N, M = list(map(int, line_input()))
gate = [0 for n in range(N+1)]
for i in range(M):
l, r = list(map(int, line_input()))
gate[l-1] += 1
gate[r] -= 1
ans = (1 if gate[0] == M else 0)
for i in range(1, N):
gate[i] = gate[i] + gate[i-1]
if gate[i] == M: ans += 1
print(ans)
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
count = [0] * (N + 1)
for _ in range(M):
l, r = list(map(int, input().split()))
count[l - 1] += 1
count[r] -= 1
ans = (1 if count[0] == M else 0)
for i in range(1, N):
count[i] += count[i - 1]
if count[i] == M: ans += 1
print(ans)
return 0
if __name__ =="__main__":
solve() | p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.