input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# coding: utf-8
# Your code here!
N,M = list(map(int,input().split()))
L,R = list(map(int,input().split()))
curSet = set(range(L,R+1))
for i in range(2,M+1):
L,R = list(map(int,input().split()))
curVec = set(range(L,R+1))
curSet = curSet.intersection(curVec)
print((len(curSet))) | # coding: utf-8
# Your code here!
N,M = list(map(int,input().split()))
L = [0]*M
R = [0]*M
#Li,Ri = map(int,input().split())
for i in range(1,M+1):
L[i-1],R[i-1] = list(map(int,input().split()))
validID = min(R)-max(L)+1
if (validID>0):
print(validID)
else:
print("0")
| p03037 |
n, m = list(map(int, input().split()))
def ip(l1, l2):
ans = []
if len(l1) != len(l2):
print('length mismatch')
else:
for i in range(len(l1)):
ans.append(l1[i]*l2[i])
return ans
g = []
for i in range(m):
g.append(list(map(int, input().split())))
l = [1 for i in range(n)]
for i in range(m):
temp_l = [0 for i in range(n)]
for j in range(g[i][0]-1, g[i][1]):
temp_l[j-1] = 1
l = ip(l, temp_l)
ans = sum(l)
print(ans)
| n, m = list(map(int, input().split()))
max_l = 0
min_r = 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()))
ID = [i for i in range(1, N+1)]
for i in range(M):
L, R = list(map(int, input().split()))
r = [i for i in range(L, R+1)]
ID = set(ID) & set(r)
if len(ID) == 0:
print((0))
exit()
if len(ID) > N:
print(N)
else:
print((len(ID))) | N, M = list(map(int, input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
max = 1
min = 100000
for i in range(M):
if max < LR[i][0]:
max = LR[i][0]
if min > LR[i][1]:
min = LR[i][1]
if max <= min:
print((min - max + 1))
else:
print((0)) | p03037 |
N,M=list(map(int,input().split()))
X=[0]*N
c=0
for i in range(M):
L,R=list(map(int,input().split()))
for j in range(L-1,R):
X[j]+=1
for i in X:
if i==M:
c+=1
print(c) | N,M=list(map(int,input().split()))
L=[list(map(int,input().split()))for i in range(M)]
r=N
l=0
for i in range(M):
l=max(l,L[i][0])
r=min(r,L[i][1])
if r-l+1<0:
print((0))
else:
print((r-l+1)) | p03037 |
n, m = list(map(int, input().split()))
d = []
for i in range(m):
a, b = list(map(int, input().split()))
d.append(list(range(a, b+1)))
b = d[0]
for i in d:
src_set = set(b)
tag_set = set(i)
matched_list = list(src_set & tag_set)
print((len(matched_list))) | n, m = list(map(int, input().split()))
a, b = list(map(int, input().split()))
d = list(range(a, b+1))
for i in range(m-1):
a, b = list(map(int, input().split()))
src_set = set(d)
tag_set = set(list(range(a, b+1)))
d = list(src_set & tag_set)
print((len(d))) | p03037 |
n, m = list(map(int, input().split()))
a, b = list(map(int, input().split()))
d = list(range(a, b+1))
for i in range(m-1):
a, b = list(map(int, input().split()))
src_set = set(d)
tag_set = set(list(range(a, b+1)))
d = list(src_set & tag_set)
print((len(d))) | n,m=list(map(int,input().split()))
max_ = 0
min_ = n+1
for i in range(m):
a,b=list(map(int, input().split()))
max_ = max(max_, a)
min_ = min(min_, b)
#print(max_, min_)
if(min_ < max_):print((0))
else:print((min_-max_+1)) | p03037 |
#!/usr/bin/env python3
n, m = list(map(int, input().split()))
li = [0] * (n + 1)
for _ in range(m):
l, r = [int(x) - 1 for x in input().split()]
li[0] += 1
li[l] -= 1
li[r + 1] += 1
li[n] -= 1
for i in range(n):
li[i + 1] += li[i]
print((sum(x <= 0 for x in li[:-1])))
| n, m = list(map(int, input().split()))
ml, mr = 0, n
for i in range(m):
l, r = [int(x) - 1 for x in input().split()]
ml = max(ml, l)
mr = min(mr, r)
print((max(0, mr - ml + 1)))
| p03037 |
N, M = list(map(int, input().split()))
LR = [None]*M
for i in range(M):
l, r = list(map(int, input().split()))
if i==0:
ans = set(range(l, r+1))
else:
ans = ans & set(range(l, r+1))
print((min(len(ans), N))) | N, M = map(int, input().split())
for i in range(M):
l, r = map(int, input().split())
if i==0:
left = l
right = r
else:
if l>left:
left = l
if r<right:
right = r
print(0) if left>right else print(right-left+1)
| p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
for i in range(N):
clear = 0
for j in range(M):
if L[j] <= i + 1 <= R[j]:
clear += 1
else:
break
if clear == M:
count += 1
print(count)
| N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
Lmax = max(L)
Rmin = min(R)
if Lmax <= Rmin:
print((Rmin - Lmax + 1))
else:
print((0))
| p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
c = set(range(l, r+1))
for _ in range(m-1):
l, r = list(map(int, input().split()))
c = c & set(range(l, r+1))
print((len(c)))
| n, m = list(map(int, input().split()))
tl, tr = 1, n
for _ in range(m):
l, r = list(map(int, input().split()))
if tr<l or tl>r:
tl, tr = 1, 0; break
else:
tl = l if tl<l else tl
tr = r if tr>r else tr
print((tr-tl+1))
| p03037 |
n,m=list(map(int,input().split()))
a=[]
te=set(range(1,n+1))
for i in range(m):
x,y=list(map(int,input().split()))
tes=set(range(x,y+1))
te=te&tes
print((len(te))) | n,m=list(map(int,input().split()))
l=1;ma=n
te=set(range(1,n+1))
for i in range(m):
x,y=list(map(int,input().split()))
l=max(x,l)
ma=min(ma,y)
print((abs(l-ma)+1 if l<=ma else 0))
| p03037 |
import collections
n, m = list(map(int, input().split()))
ans = []
def addNum(ans):
a, b = list(map(int, input().split()))
for i in range(a, b+1):
ans.append(i)
for i in range(m):
addNum(ans)
res = collections.Counter(ans)
count = 0
for i in list(res.values()):
if i == m:
count += 1
print(count) | n, m = list(map(int, input().split()))
ans1 = []
for i in range(m):
a, b = list(map(int, input().split()))
ans2 = [i for i in range(a, b+1)]
if ans1 == []:
ans1 = ans2
else:
ans1 = list(set(ans1) & set(ans2))
print((len(ans1))) | p03037 |
n, m = list(map(int, input().split()))
ans1 = []
for i in range(m):
a, b = list(map(int, input().split()))
ans2 = [i for i in range(a, b+1)]
if ans1 == []:
ans1 = ans2
else:
ans1 = list(set(ans1) & set(ans2))
print((len(ans1))) | n, m = list(map(int, input().split()))
maxNum = 0
minNum = 0
for i in range(m):
a, b = list(map(int, input().split()))
if maxNum == 0:
maxNum = b
else:
if maxNum > b:
maxNum = b
if minNum == 0:
minNum = a
else:
if minNum < a:
minNum = a
if maxNum - minNum >= 0:
print((maxNum - minNum + 1))
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
g = [tuple(map(int,input().split())) for i in range(m)]
ans=0
for i in range(1,n+1):
if all([t[0]<=i and i<=t[1] for t in g]):
ans+=1
print(ans) | n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
t = tuple(map(int,input().split()))
l.append(t[0])
r.append(t[1])
l,r=max(l),min(r)
if l<=r:
print((abs(l-r)+1))
else:
print((0)) | p03037 |
N,M = list(map(int, input().split()))
A = []
for i in range(M):
L, R = list(map(int, input().split()))
B = list(range(L,R+1))
A.append(B)
S = set(A[0])
for i in range(M):
S = set(S) & set(A[i])
print((len(S)))
| N, M = list(map(int, input().split()))
L = 0
R = 10**5 +2
for i in range(M):
l,r = list(map(int, input().split()))
if L < l:
L = l
if R > r:
R = r
ans = 0
for i in range(1,N+1):
if L <= i <= R:
ans += 1
print(ans)
| p03037 |
import collections as co
N,M =list(map(int,input().split()))
card=[]
ans=0
for i in range(M):
st,en=list(map(int,input().split()))
for cn in range(st,en+1):
card.append(cn)
vv=co.Counter(card)
for k in range(N+1):
if M==vv[k]:
ans+=1
print(ans)
| N,M =list(map(int,input().split()))
la=1
rm=N
for i in range(M):
a,b=list(map(int,input().split()))
la=max(la,a)
rm=min(rm,b)
print((max(0,rm-la+1)))
| p03037 |
n,m = list(map(int, input().split(' ')))
keys = set(range(1,n+1))
for _ in range(m):
a,b = list(map(int, input().split(' ')))
keys = keys.intersection(set( range(a,b+1) ))
if len(keys) == 0: break
print(len(keys))
| n,m = list(map(int, input().split(' ')))
def intersection(A,B):
a,b = max(A[0],B[0]), min(A[1],B[1])
return [a,b] if a <= b else []
r = [1,n+1]
for _ in range(m):
a,b = list(map(int, input().split(' ')))
r = intersection(r, [a,b])
if len(r) == 0: break
print((r[1] - r[0] + 1) if r else 0)
| p03037 |
n,m = list(map(int, input().split(' ')))
def intersection(A,B):
a,b = max(A[0],B[0]), min(A[1],B[1])
return [a,b] if a <= b else []
r = [1,n+1]
for _ in range(m):
a,b = list(map(int, input().split(' ')))
r = intersection(r, [a,b])
if len(r) == 0: break
print((r[1] - r[0] + 1) if r else 0)
| n,m = list(map(int, input().split(' ')))
def intersection(A,B):
a,b = max(A[0],B[0]), min(A[1],B[1])
return [a,b] if a <= b else []
r = [1,n]
for _ in range(m):
a,b = list(map(int, input().split(' ')))
r = intersection(r, [a,b])
if len(r) == 0: break
print((r[1] - r[0] + 1) if r else 0)
| p03037 |
N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
l = [0] * N
count = 0
for i in range(M):
for j in range(LR[i][1] - LR[i][0] + 1):
l[LR[i][0]+j-1] += 1
else:
for i in l:
if i == M:
count += 1
else:
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)
max_l = max(L)
min_r = min(R)
print((max(min_r - max_l + 1, 0)))
| p03037 |
def main():
import itertools
n,m = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(m)]
# print(n,m)
# print(l)
ans = 0
ans_pre = 0
for ID in range(1,n+1):
# print("---ID = {}---".format(ID))
ans_pre = 0
for i in range(m):
# print("-i = {}-".format(i))
li = l[i][0]
# print("li = {}".format(li))
ri = l[i][1]
# print("ri = {}".format(ri))
if ID >= li and ID <= ri:
ans_pre += 1
# print("ans_pre = {}".format(ans_pre))
if ans_pre == m:
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
import itertools
n,m = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(m)]
gaterange = []
#gate1とgate2の共通部分を出す
li = []
ri = []
for i in range(m):
li.append(l[i][0])
ri.append(l[i][1])
print((len(list(range(max(li)-1,min(ri))))))
if __name__ == '__main__':
main() | p03037 |
# coding: utf-8
import sys
import itertools
def sr(): return sys.stdin.readline().rstrip()
def ir(): return int(sr())
def lr(): return list(map(int, sr().split()))
N, M = lr()
l_list = []
r_list = []
for i in range(M):
l, r = lr()
l_list.append(l)
r_list.append(r)
ans = set()
for i in range(M):
cards = sorted(l_list[i:] + r_list[:i + 1])
cards = set(range(cards[0], cards[-1] + 1, 1))
if (len(ans) == 0):
ans = cards
continue
ans = cards & ans
print((len(ans)))
| # coding: utf-8
import sys
import itertools
def sr(): return sys.stdin.readline().rstrip()
def ir(): return int(sr())
def lr(): return list(map(int, sr().split()))
N, M = lr()
l_list = []
r_list = []
for i in range(M):
l, r = lr()
l_list.append(l)
r_list.append(r)
# ans = set()
# left = l_list[M - 1]
# right = r_list[0]
tl_list = []
tr_list = []
for i in range(M):
tmp_left = l_list[i]
tmp_right = r_list[i]
tl_list.append(tmp_left)
tr_list.append(tmp_right)
left = max(tl_list)
right = min(tr_list)
# cards = sorted(l_list[i:] + r_list[:i + 1])
# cards = set(range(cards[0], cards[-1] + 1, 1))
# if (len(ans) == 0):
# ans = cards
# continue
# ans = cards & ans
ans = right - left + 1
if ans <= 0:
print((0))
else:
print(ans)
| p03037 |
N,M = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(M)]
l = -1
r = float("inf")
for x,y in A :
if l < x :
l = x
if y < r :
r = y
print((max(0,r-l+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)
left = max(L)
right = min(R)
ans = max(0, right-left+1)
print(ans) | p03037 |
#<127>
N, M = list(map(int, input().split()))
gate = [0] * N
#rang = []
for m in range(M):
L, R = list(map(int, input().split()))
for x in range(L, R + 1):
gate[x - 1] += 1
#print(gate)
print((gate.count(M))) | N, M = list(map(int, input().split()))
L, R = [0] * M, [0] * M
for m in range(M):
L[m], R[m] = list(map(int, input().split()))
print((max(min(R) - max(L) + 1, 0))) | p03037 |
n, m = list(map(int, input().split()))
s=set()
l, r = list(map(int, input().split()))
for i in range(l, r+1):
s.add(i)
for i in range(m-1):
l, r = list(map(int, input().split()))
t = set()
for j in range(l, r+1):
t.add(j)
s = s & t
print((len(s))) | 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
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
ans = None
for i in range(m):
l, r = list(map(int, input().split()))
card = set(range(l, r + 1))
if ans is None:
ans = card
else:
ans = ans.intersection(card)
print((len(ans)))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
l_key = []
r_key = []
for i in range(m):
l, r = list(map(int, input().split()))
l_key.append(l)
r_key.append(r)
print((max(0, min(r_key) - max(l_key) + 1)))
| p03037 |
N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
cnt = 0
for i in range(N):
tmp = 0
for L, R in LR:
if L-1 <= i <= R-1:
tmp += 1
else:
break
if tmp == M:
cnt += 1
break
print(cnt) | N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
Lma = 0
Rmi = N + 1
for L, R in LR:
Lma = max(L, Lma)
Rmi = min(R, Rmi)
print((max(0, Rmi - Lma + 1))) | p03037 |
n, m = list(map(int, input().split()))
ans = set(range(1, n + 1))
for _ in range(m):
l, r = list(map(int, input().split()))
st = set(range(l, r + 1))
ans &= st
print((len(ans)))
| def solve2():
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))
solve2()
| p03037 |
n,m = list(map(int, input().split()))
ns = set(i+1 for i in range(n))
for i in range(m):
l, r = list(map(int, input().split()))
ns &= set(j for j in range(l, r+1))
print((len(ns))) | n,m = list(map(int, input().split()))
ns = set(i+1 for i in range(n))
l_min = 0
r_max = n
for i in range(m):
l, r = list(map(int, input().split()))
l_min = max(l_min, l)
r_max = min(r_max, r)
print((max(r_max - l_min+1, 0)))
| p03037 |
n, m = list(map(int, input().split()))
lr_list = list()
for _ in range(m):
lr_list.append(list(map(int, input().split())))
card_list = [i for i in range(1, n + 1)]
max_l = 0
min_r = 1e6
for l, r in lr_list:
# print(f"{card_list=}")
# print(f"{max_l=}, {min_r=}")
if l > max_l or r < min_r:
max_l = l
min_r = r
new_card_list = []
for card in card_list:
if card >= max_l and card <= min_r:
new_card_list.append(card)
card_list = new_card_list
print((len(card_list))) | n, m = list(map(int, input().split()))
# lr_list = list()
l_list = list()
r_list = list()
for _ in range(m):
l, r = list(map(int, input().split()))
l_list.append(l)
r_list.append(r)
# lr_list.append(list(map(int, input().split())))
min_r = min(r_list)
max_l = max(l_list)
if max_l <= min_r:
print((min_r - max_l + 1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
li = {i+1 for i in range(N)}
# print(li)
box = []
for _ in range(M):
l, r = list(map(int, input().split()))
# print(l, r)
for i in li:
# print(i)
if l <= i and i <= r:
box.append(i)
li = list(set(li) & set(box))
box.clear()
# print(li)
print((len(li)))
| N, M = list(map(int, input().split()))
l, r = list(map(int, input().split()))
for _ in range(M-1):
new_l, new_r = list(map(int, input().split()))
if l < new_l:
l = new_l
if new_r < r:
r = new_r
score = r-l+1
if score > 0:
print(score)
else:
print((0))
| p03037 |
list_l = []
list_R = []
ID,gate = list(map(int,input().split()))
s = 0
t = 0
for i in range(gate):
l,r = list(map(int,input().split()))
list_l.append(l)
list_R.append(r)
for i in range(ID+1):
for j in range(gate):
if list_l[j] <= i <= list_R[j]:
s += 1
else:
None
if s == gate:
t += 1
s = 0
print(t)
| list_l = []
list_R = []
ID,gate = list(map(int,input().split()))
s = 0
for i in range(gate):
l,r = list(map(int,input().split()))
list_l.append(l)
list_R.append(r)
a = max(list_l)
b = min(list_R)
for i in range(ID+1):
if a <= i <= b:
s += 1
else:
None
print(s) | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
ans = list(range(lr[0][0], lr[0][1]+1))
for l, r in lr:
# print(ans, set(range(l, r+1)))
ans = list(set(ans) & set(range(l, r+1)))
print((len(ans)))
| import sys
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
min_gate = 0
max_gate = sys.maxsize
for l, r in lr:
min_gate = max(min_gate, l)
max_gate = min(max_gate, r)
print((max(0, max_gate - min_gate + 1))) | p03037 |
N, M = list(map(int, input().split()))
L_list = []
R_list = []
for i in range(M):
A, B = list(map(int, input().split()))
L_list.append(A)
R_list.append(B)
counter = 0
for j in range(min(L_list),(max(R_list) + 1)):
if j >= max(L_list) and j <= min(R_list):
counter += 1
print(counter) | N, M = list(map(int, input().split()))
L_list = []
R_list = []
for i in range(M):
A, B = list(map(int, input().split()))
L_list.append(A)
R_list.append(B)
if max(L_list) > min(R_list):
print((0))
else:
print((min(R_list) - max(L_list) + 1)) | p03037 |
n,m=list(map(int,input().split()))
ll=[];rl=[];count=0;ans=0
count1=0;count2=0
for i in range(m):
l,r=list(map(int,input().split()))
ll.append(l);rl.append(r)
for o in range(n):
count1+=1
for i in range(m):
if ll[i]<=o+1<=rl[i]:
count2+=1
if count2==m:
ans+=1
count2=0
print(ans) | n,m=list(map(int,input().split()))
ll=[];rl=[]
for i in range(m):
l,r=list(map(int,input().split()))
ll.append(l,);rl.append(r)
tans=min(rl)-max(ll)+1
if tans>=0:print(tans)
else:print((0)) | p03037 |
import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
l,r = MAP()
res = set(range(l,r+1))
for i in range(m-1):
l,r = MAP()
res = res & set(range(l,r+1))
print((len(res))) | import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
l,r = [], []
for i in range(m):
a,b = MAP()
l.append(a)
r.append(b)
max_l = max(l)
min_r = min(r)
if min_r<max_l:
print((0))
exit()
print((min_r-max_l+1)) | p03037 |
k,m=list(map(int,input().split()))
l=[0 for i in range(k+1)]
for i in range(m):
a,s=list(map(int,input().split()))
l[a-1]+=1;l[s]-=1
ans=0
f=0
for j in range(k):
l[j]+=f
f=l[j]
print((len([1 for i in l if i==m]))) | n,m=list(map(int,input().split()))
table=[0]*(n+2)
for i in range(m):
l,r=list(map(int,input().split()))
table[l]+=1
table[r+1]-=1
from itertools import accumulate
from collections import Counter as co
var=co((accumulate(table)))
if m not in var:print((0))
else:print((var[m]))
| p03037 |
n,m = list(map(int, input().split()))
gatelist = [0] * n
for i in range(m):
l,r = list(map(int, input().split()))
for j in range(l-1,r):
gatelist[j] += 1
cnt = 0
for item in gatelist:
if item == m:
cnt +=1
print(cnt) | n,m = list(map(int, input().split()))
maxl = 0
minr = 100000
for i in range(m):
l,r = list(map(int, input().split()))
maxl = max(maxl,l)
minr = min(minr,r)
ans = max(minr - maxl + 1, 0)
print(ans) | p03037 |
n, m = list(map(int, input().split()))
lr_list = []
for _ in range(m):
l, r = list(map(int, input().split()))
lr_list.append((l, r))
card2canopen_dict = {i: True for i in range(1, n+1)}
for n_card in range(1, n+1):
for i, lr in enumerate(lr_list):
target_l = lr[0]
target_r = lr[1]
if card2canopen_dict[n_card] and target_l <= n_card <= target_r:
pass
else:
card2canopen_dict[n_card] = False
break
card_list = [key for key, value in list(card2canopen_dict.items()) if value]
ans = len(card_list)
print(ans)
| n, m = list(map(int, input().split()))
lr_list = []
for _ in range(m):
l, r = list(map(int, input().split()))
lr_list.append((l, r))
card2canopen_dict = {i: True for i in range(1, n+1)}
# 重ね合わせの区間を調べれば良い気がする
kukan_min, kukan_max = 1, n
for i, lr in enumerate(lr_list):
l, r = lr[0], lr[1]
if l >= kukan_min:
kukan_min = l
if r <= kukan_max:
kukan_max = r
if kukan_max < kukan_min:
ans = 0
else:
ans = len(list(range(kukan_min, kukan_max+1)))
print(ans)
| p03037 |
N,M=list(map(int,input().split()))
L=[]
R=[]
for i in range(M):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
count=0
for i in range(1,N+1):
if max(L)<=i<=min(R):
count+=1
print(count) | N,M=list(map(int,input().split()))
L=[]
R=[]
for i in range(M):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
count=0
if max(L)>min(R):
print((0))
else:
print((min(R)-max(L)+1)) | p03037 |
import itertools
from collections import Counter
def main():
N, M = list(map(int, input().split()))
LR = []
for _ in range(M):
L, R = list(map(int, input().split()))
LR.append(list(range(L, R + 1)))
LR = list(itertools.chain.from_iterable(LR))
C = Counter(LR)
ans = 0
for c in list(C.values()):
if c == M:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
N, M = list(map(int, input().split()))
L = 0
R = N
for _ in range(M):
l, r = list(map(int, input().split()))
if L < l:
L = l
if R > r:
R = r
ans = 0
if L <= R:
ans = R - L + 1
print(ans)
if __name__ == "__main__":
main() | p03037 |
import sys
def input():
return sys.stdin.readline()[:-1]
N, M = list(map(int, input().split()))
cards = [0] * (N + 1)
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(L, R + 1):
cards[j] += 1
print((cards.count(M)))
| import sys
def input():
return sys.stdin.readline()[:-1]
N, M = list(map(int, input().split()))
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(r_min - l_max + 1, 0)))
| p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
tmpa = list(map(int, list(range(l, r+1))))
for i in range(m-1):
l, r = list(map(int, input().split()))
ret = []
for j in range(l, r+1):
if j in tmpa:
ret.append(j)
tmpa = ret.copy()
print((len(tmpa))) | 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(min(rs)-max(ls)+1, 0))) | p03037 |
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
pass_id = [0 for i in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l - 1, r):
pass_id[i] += 1
# print(pass_id)
print((pass_id.count(m))) | # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
head = 1
tail = n
for _ in range(m):
l, r = list(map(int, input().split()))
head = max(head, l)
tail = min(tail, r)
if head > tail:
print((0))
else:
print((tail - head + 1)) | p03037 |
N, M = [int(n) for n in input().split()]
check_list = [0] * N
for i in range(M):
l, r = [int(n) for n in input().split()]
for j in range(l-1, r):
check_list[j] += 1
print((check_list.count(M))) | N, M = [int(n) for n in input().split()]
l, r = 1, 10**5
for i in range(M):
l_, r_ = [int(n) for n in input().split()]
l = max(l, l_)
r = min(r, r_)
if l > r:
print((0))
else:
print((r-l+1)) | p03037 |
n,m = list(map(int,input().split()))
gate = [[int(i) for i in input().split()] for _ in range(m)]
p = [0] * (10**5)
for y in gate:
p[y[0]-1:y[1]] = list([x+1 for x in p[y[0]-1:y[1]]])
cnt = 0
for z in range(n):
if p[z] == m:
cnt += 1
print(cnt) | n,m = list(map(int,input().split()))
gate = [[int(i) for i in input().split()] for _ in range(m)]
minv = gate[0][0]
maxv = gate[0][1]
for x in gate:
minv = max(minv,x[0])
maxv = min(maxv,x[1])
print((maxv-minv+1 if maxv-minv+1 >= 1 else 0))
| p03037 |
import functools
N, M = list(map(int, input().split()))
cards = []
for i in range(0, M):
L, R = list(map(int, input().split()))
card = [j for j in range(L, R+1)]
cards.append(card)
found = functools.reduce(lambda x, y: list(set(x) & set(y)), cards)
print((len(found))) | N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
c = [j for j in range(L, R+1)]
for i in range(0, M-1):
L, R = list(map(int, input().split()))
n = [j for j in range(L, R+1)]
c = list(set(c) & set(n))
if len(c) == 0:
break
print((len(c))) | p03037 |
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
L, R = list(map(int,input().split()))
ok = [i for i in range(n+1) if L<=i and i<=R]
ok2 = []
for i in range(m-1):
l, r = list(map(int,input().split()))
for j in ok:
if not(j < l or r < j):
ok2.append(j)
ok = ok2
ok2 = []
print((len(ok))) | import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
L = []
R = []
for i in range(m):
l, r = list(map(int,input().split()))
L.append(l)
R.append(r)
if min(R)-max(L) >= 0:
print((min(R)-max(L)+1))
else:
print((0)) | p03037 |
N, M = list(map(int,input().split()))
mat = [list(map(int,input().split())) for o in range(M)]
ans = set(j for j in range(mat[0][0], mat[0][-1] + 1))
for i in range(1, M):
s = set(j for j in range(mat[i][0], mat[i][-1] + 1))
ans = ans & s
print((len(ans)))
| N, M = list(map(int,input().split()))
mat = [list(map(int,input().split())) for o in range(M)]
lmax = mat[0][0]
for i in range(M):
if mat[i][0] > lmax:
lmax = mat[i][0]
rmin = mat[0][1]
for i in range(M):
if mat[i][1] < rmin:
rmin = mat[i][1]
ans = rmin - lmax + 1
if ans >= 1:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
t_list = [[0] * 2 for _ in range(M)]
for i in range(M):
t_list[i] = list(map(int, input().split()))
ans = 0
a = [j for j in range(t_list[0][0], t_list[0][1]+1)]
for i in range(M):
b = [j for j in range(t_list[i][0], t_list[i][1]+1)]
a = list(set(a) & set(b))
ans = len(set(a))
print(ans) | N, M = list(map(int, input().split()))
l_list = []
r_list = []
for i in range(M):
l, r = list(map(int, input().split()))
l_list.append(l)
r_list.append(r)
l = max(l_list)
r = min(r_list)
if r < l:
print((0))
else:
print((r-l+1)) | p03037 |
N, M = list(map(int, input().split()))
#print(N,M)
okList = [1] * N
#print(okList)
#print(type(okList))
for i in range(M):
L, R = list(map(int, input().split()))
L -= 1
if 0 < L:
okList[0:L] = [0] * L
#print(okList)
if R < len(okList):
okList[R:len(okList)] = [0] * (len(okList) - R)
#print(okList)
print((sum(okList))) | N, M = list(map(int, input().split()))
maxL = 1
minR = N
for i in range(M):
L, R = list(map(int, input().split()))
if maxL < L:
maxL = L
if minR != None and R < minR:
minR = R
#print("\t\t\t", maxL, minR)
if maxL <= minR:
print((minR - maxL + 1))
else:
print((0)) | p03037 |
if __name__ == '__main__':
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(M)]
LR1 = LR[0]
L1 = LR1[0]
R1 = LR1[1]
my_list = list(range(L1, R1+1))
for tmp_LR in LR[1::]:
tmp_L = tmp_LR[0]
tmp_R = tmp_LR[1]
my_list = [e for e in my_list if e >= tmp_L and e <= tmp_R]
answer = len(my_list)
print(answer)
| if __name__ == '__main__':
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(M)]
LR1 = LR[0]
maxL = LR1[0]
minR = LR1[1]
for tmp_LR in LR[1::]:
tmp_L = tmp_LR[0]
tmp_R = tmp_LR[1]
if tmp_L >= maxL:
maxL = tmp_L
if tmp_R <= minR:
minR = tmp_R
my_list = list(range(maxL, minR + 1))
answer = len(my_list)
print(answer)
| p03037 |
n,m = list(map(int,input().split()))
l = []
r = []
count = 0
def check(a,b,c):
if a >= max(b) and a <= min(c):
return 1
else:
return 0
for i in range(m):
l0,r0 = list(map(int,input().split()))
l.append(l0)
r.append(r0)
for y in range(n+1):
count = count + check(y,l,r)
print(count) | n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
l0,r0 = list(map(int,input().split()))
l.append(l0)
r.append(r0)
ans = min(r)-max(l)+1
if ans >= 0:
print(ans)
else:
print((0)) | 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()))
tmp=set(range(l,r+1))
ans=ans&tmp
print((len(ans))) | n,m=list(map(int,input().split()))
left=0
right=n
for i in range(m):
l,r=list(map(int,input().split()))
left=max(l,left)
right=min(r,right)
print((max(0,right-left+1))) | p03037 |
N, M = list(map(int, input().split()))
MC = []
for i in range(M):
L, R = list(map(int, input().split()))
tmp = [0] * N
for j in range(L-1, R):
tmp[j] = 1
MC.append(tmp)
cnt = 0
for i in range(N):
mc = True
for j in range(M):
if not MC[j][i]:
mc = False
break
if mc:
cnt += 1
print(cnt) | N, M = list(map(int, input().split()))
MC = [1] * N
for i in range(M):
L, R = list(map(int, input().split()))
for j in range(N):
if not L-1 <= j < R:
MC[j] = 0
print((MC.count(1))) | p03037 |
def main():
ini_inp=list([int(x) for x in input().split()])
N=ini_inp[0]
M=ini_inp[1]
L=[]
R=[]
for i in range(M):
sec_inp=list([int(x) for x in input().split()])
L.append(sec_inp[0])
R.append(sec_inp[1])
temp=[]
for i in range(M):
if i==0:
temp=set([i for i in range(L[i],R[i]+1)])
number=set([i for i in range(L[i],R[i]+1)])
temp=number & temp
if len(temp)==0:
break
print((len(temp)))
if __name__=="__main__":
main()
| def main():
ini_inp=list([int(x) for x in input().split()])
N=ini_inp[0]
M=ini_inp[1]
L=[]
R=[]
for i in range(M):
sec_inp=list([int(x) for x in input().split()])
L.append(sec_inp[0])
R.append(sec_inp[1])
low=L[0]
up=R[0]
flag=0
for i in range(1,M):
if L[i]>up:
flag=1
break
elif L[i]>=low:
low=L[i]
elif R[i]<=up:
up=R[i]
if flag==0:
print((up-low+1))
else:
print((0))
if __name__=="__main__":
main()
| p03037 |
n, m = list(map(int, input().split()))
card = [0] * n
l = []
r = []
for i in range(m):
l1, r1 = list(map(int, input().split()))
l.append(l1)
r.append(r1)
for i in range(m):
for j in range(l[i], r[i]+1):
card[j-1] += 1
ans = 0
for c in card:
if c >= m:
ans += 1
print(ans)
| from itertools import accumulate
n, m = list(map(int, input().split()))
card = [0] * (n + 1)
for _ in range(m):
l, r = list(map(int, input().split()))
card[l-1] += 1
card[r] -= 1
ans = 0
for i in accumulate(card):
if i == m:
ans += 1
print(ans)
| p03037 |
import copy
N, M = list(map(int,input().split()))
ls = []
for i in range(M):
L, R = list(map(int,input().split()))
l = [k+L for k in range(R-L+1)]
ls.append(l)
if M == 1:
print((len(l)))
else:
for i in range(M-1):
l_set = set(ls[i]) & set(ls[i+1])
if len(l_set) == 0:
break
ls[i+1] = copy.deepcopy(l_set)
print((len(l_set))) | import copy
N, M = list(map(int,input().split()))
if M == 1:
L, R = list(map(int,input().split()))
l = [k+L for k in range(R-L+1)]
print((len(l)))
else:
L, R = list(map(int,input().split()))
l = [k+L for k in range(R-L+1)]
l_tmp = copy.deepcopy(l)
L, R = list(map(int,input().split()))
l = [k+L for k in range(R-L+1)]
l_set = list(set(l) & set(l_tmp))
l_tmp = copy.deepcopy(l)
for i in range(M-2):
L, R = list(map(int,input().split()))
l = [k+L for k in range(R-L+1)]
l_set = list(set(l) & set(l_set))
l_tmp = copy.deepcopy(l)
if len(l_set) == 0:
break
print((len(l_set))) | p03037 |
import sys
import copy
N, M = list(map(int,input().split()))
Ls, Rs = [0 for _ in range(M)], [0 for _ in range(M)]
for i in range(M):
L, R = list(map(int,input().split()))
Ls[i] = L
Rs[i] = R
if i != 0:
if Rs[i-1] < Ls[i]:
print((0))
sys.exit( )
ls = []
for i in range(M):
l = [k+Ls[i] for k in range(Rs[i]-Ls[i]+1)]
ls.append(l)
if M == 1:
print((len(l)))
else:
for i in range(M-1):
l_set = set(ls[i]) & set(ls[i+1])
ls[i+1] = copy.deepcopy(l_set)
print((len(l_set))) | N, M = list(map(int,input().split()))
Ls, Rs = [0 for _ in range(M)], [0 for _ in range(M)]
for i in range(M):
L, R = list(map(int,input().split()))
Ls[i] = L
Rs[i] = R
L_prime = max(Ls)
R_peime = min(Rs)
if L_prime > R_peime:
print((0))
else:
print((R_peime - L_prime + 1)) | p03037 |
n, m = list(map(int, input().split()))
n = set([i for i in range(1,n+1)])
for i in range(m):
a, b = list(map(int, input().split()))
ab = set([j for j in range(a,b+1)])
n = n & ab
if len(n) == 0:
print((0))
exit()
print((len(n))) | n, m = list(map(int, input().split()))
left = 1
right = n
for i in range(m):
a, b = list(map(int, input().split()))
if a > left:
left = a
if b < right:
right = b
if left > right:
print((0))
exit()
print((right-left+1)) | p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
CARDS = {i for i in range(L,R+1)}
for i in range(M-1):
L, R = list(map(int, input().split()))
CARDS &= {card for card in range(L,R+1)}
if CARDS == set():
break
print((len(CARDS))) | N, M = list(map(int, input().split()))
Ls, Rs = set(), set()
for _ in range(M):
L, R = list(map(int, input().split()))
Ls.add(L)
Rs.add(R)
print((len([i for i in range(max(Ls), min(Rs)+1)]))) | p03037 |
#!/usr/bin/env python3
import sys
N, M = list(map(int, input().rstrip().split()))
L = []
R = []
for _ in range(M):
l, r = list(map(int, input().rstrip().split()))
L.append(l)
R.append(r)
Ans = set(range(L[0], R[0] + 1))
for i in range(1, len(L)):
Ans = set(range(L[i], R[i] + 1)) & Ans
if not Ans:
print((0))
sys.exit(0)
print((len(Ans)))
| #!/usr/bin/env python3
import sys
N, M = list(map(int, input().rstrip().split()))
L = []
R = []
for _ in range(M):
l, r = list(map(int, input().rstrip().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()))
for i in range(M):
l,r = list(map(int,input().split()))
if i == 0:
set_a = set(list(range(l,r+1)))
set_b = set(list(range(l,r+1)))
set_a = set_a & set_b
print((len(set_a))) | N,M = list(map(int,input().split()))
lst_l=[]
lst_r=[]
for i in range(M):
l,r = list(map(int,input().split()))
lst_l.append(l)
lst_r.append(r)
ans = min(lst_r)-max(lst_l)+1
if ans >=0:print(ans)
else:print((0)) | p03037 |
n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
a,b = list(map(int,input().split()))
l.append(a)
r.append(b)
count = 0
for i in range(1,n+1):
if l[m-1] <= i <= r[0]:
count += 1
for i in range(n):
for j in range(m):
l.append(1)
print(count) | n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
a,b = list(map(int,input().split()))
l.append(a)
r.append(b)
count = 0
ma = max(l)
mi = min(r)
for i in range(1,n+1):
if ma <= i <= mi:
count += 1
print(count) | p03037 |
n,m = list(map(int,input().split()))
l,r = [],[]
for i in range(m):
a,b = list(map(int,input().split()))
l.append(a)
r.append(b)
count = 0
for i in range(1,n+1):
for j in range(m):
if i < l[j] or i > r[j]:
count -= 1
break
print((n + count)) | n,m = list(map(int,input().split()))
l,r = [],[]
for i in range(m):
a,b = list(map(int,input().split()))
l.append(a)
r.append(b)
num = list(range(1,n+1))
lmax = max(l)
rmin = min(r)
if lmax > rmin:
print((0))
else:
gate = set(range(lmax,rmin+1))
ans = list(set(num) & gate)
print((len(ans))) | p03037 |
import fractions
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)
ans = 0
for i in range(1,n+1):
if max(l) <= i and i <= min(r):
ans += 1
print(ans) | import fractions
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)
ans = 0
M = max(l)
m = min(r)
for i in range(1,n+1):
if M <= i and i <= m:
ans += 1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
card = []
cntAppearance = []
for i in range(n):
cntAppearance.append(0)
for _ in range(m):
l ,r = list(map(int, input().split()))
for i in range(l,r+1):
card.append(i)
for j in card:
cntAppearance[j-1] += 1
cnt = 0
for i in cntAppearance:
if i == m:
cnt += 1
print(cnt) | n, m = list(map(int, input().split()))
cnt = 0
id = []
for _ in range(m):
l= list(map(int, input().split()))
if len(id) == 0:
id = l
else:
if id[0] < l[0]:
id[0] = l[0]
elif id[1] > l[1]:
id[1] = l[1]
if id[1] < id[0]:
cnt = 0
else:
cnt = id[1]-id[0]+1
print(cnt)
| p03037 |
n,m=list(map(int,input().split()))
lr=[list(map(int,input().split())) for i in range(m)]
a=set(range(lr[0][0],lr[0][1]+1))
for j in range(1,m):
a=a&set(range(lr[j][0],lr[j][1]+1))
print((len(a))) | n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
for i in range(m-1):
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()))
table = []
for i in range(m):
nest_table = []
l, r = list(map(int, input().split()))
nest_table.append(l)
nest_table.append(r)
table.append(nest_table)
ans = 0
for j in range(n):
for k in range(m):
frag = 0
if j+1 >= table[k][0] and j+1 <= table[k][1]:
pass
else:
frag += 1
break
if frag == 0:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
lower = 1
upper = 100000
for i in range(m):
l, r = list(map(int, input().split()))
if l >= lower:
lower = l
if r <= upper:
upper = r
if lower > upper:
print((0))
else:
if n < upper:
upper = n
print((upper - lower + 1)) | p03037 |
N, M = list(map(int, input().split()))
l, r = list(map(int, input().split()))
s = set( range(l,r+1) )
for m in range(M - 1):
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 = -1
r_min = N + 1
for m in range(M):
l, r = list(map(int, input().split()))
if l > l_max:
l_max = l
if r < r_min:
r_min = r
print((max(r_min - l_max + 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()))
d={}
cnt = 0
for i in range(M):
l = L[i]
r=R[i]
for j in range(l,r+1):
if j in d:
d[j] += 1
else:
d[j] = 1
if d[j] >= 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()))
L.sort()
R.sort()
l= L[len(L)-1]
r = R[0]
cnt =0
for i in range(l,r+1):
cnt+=1
print(cnt) | p03037 |
n,m=list(map(int,input().split()))
flag=n*[0]
for i in range(m):
l,r=list(map(int,input().split()))
flag[l-1:r]=list([n+1 for n in flag[l-1:r]])
print((flag.count(m))) | n,m=list(map(int,input().split()))
ansl=1
ansr=n
flag=0
for i in range(m):
l,r=list(map(int,input().split()))
if (ansl>r)or(ansr<l):
flag=1
break
if ansl<l:
ansl=l
if ansr>r:
ansr=r
if flag==0:
print((ansr-ansl+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
cards=[i for i in range(n)]
for j in range(m):
l,r=list(map(int,input().split()))
for i in range(l-1):
cards[i]=-1
for i in range(r,n):
cards[i]=-1
ans=sum(1 for cars in cards if cars>=0)
print(ans) | n,m=list(map(int,input().split()))
l=[]
r=[]
for j in range(m):
templ,tempr=list(map(int,input().split()))
l.append(templ)
r.append(tempr)
ans=min(r)-max(l)+1
if ans<0:
ans=0
print(ans) | p03037 |
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(m)]
ans=0
for i in range(l[0][0],l[0][1]+1):
if all([i in range(l[k][0],l[k][1]+1) for k in range(1,m)]):
ans+=1
print(ans) | n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(m)]
a=0
z=10**5
for i in range(m):
a=max(a,l[i][0])
z=min(z,l[i][1])
if a<=z:
print((z-a+1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
ID = [0] * N
N = {i for i in range(1, N + 1)}
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
N = N.intersection({j for j in range(L[i], R[i] + 1)})
print((len(N))) | 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()))
LL = max(L)
RR = min(R)
ans = 0
for i in range(N):
if LL <= i + 1 <= RR:
ans += 1
else:
pass
print(ans) | p03037 |
n,m=list(map(int, input().split()))
s=set(range(1, n+1)) #1~nのset
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()))
lmax=0
rmin=1000000
for i in range(m):
l,r=list(map(int, input().split()))
lmax=max(l, lmax)
rmin=min(r, rmin)
if rmin-lmax>=0:
print((rmin-lmax+1))
else:
print((0)) | p03037 |
from collections import Counter
n, m = list(map(int, input().split()))
ll = []
for i in range(m):
l, r = list(map(int, input().split()))
ll.extend(list(range(l,r+1)))
ans = 0
c = Counter(ll)
for k, v in list(c.items()):
if v == m:
ans = ans + 1
print(ans)
| from collections import Counter
n, m = list(map(int, input().split()))
ll = []
x = 0
y = 10 ** 5
for i in range(m):
l, r = list(map(int, input().split()))
x, y = max(x, l), min(y, r)
s = (y - x) + 1
if s < 0:
s = 0
print(s)
| p03037 |
n,m=list(map(int,input().split()))
lr = [list(map(int,input().split())) for _ in range(m)]
s = {i:0 for i in range(1,n+1)}
cnt = 0
for i in range(m):
for j in range(lr[i][0],lr[i][1]+1):
s[j] += 1
for v in list(s.values()):
if v == 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((max(min(r) - max(l) + 1, 0))) | p03037 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
N, M = list(map(int, input().split(" ")))
#N = int(input())
#S = input()
LR = []
min_i = -1
max_i = -1
for i in range(M):
L, R = list(map(int, input().split(" ")))
LR.append((L, R))
if i == 0:
min_i = L
max_i = R
else:
if L < min_i:
min_i = L
if max_i < R:
max_i = R
ans = 0
for i in range(min_i, max_i+1):
flg = True
for j in LR:
L, R = j
if i <= R and i >= L:
flg = True
else:
flg = False
break
if flg == True:
#print("sss")
ans += 1
print(ans)
if __name__ == "__main__":
main() | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
N, M = list(map(int, input().split(" ")))
#N = int(input())
#S = input()
LR = []
min_i = -1
max_i = -1
min_a = -1
max_a = -1
for i in range(M):
L, R = list(map(int, input().split(" ")))
LR.append((L, R))
if i == 0:
min_i = L
max_i = R
min_a = L
max_a = R
else:
if L > min_i:
min_i = L
if max_i > R:
max_i = R
ans = 0
for i in range(min_i, max_i+1):
ans += 1
print(ans)
if __name__ == "__main__":
main() | p03037 |
N, M = list(map(int, input().split()))
st = set(range(1, N+1))
for _ in range(M):
a, b = list(map(int, input().split()))
st.intersection_update(set(range(a, b+1)))
print((len(st))) | N, M = list(map(int, input().split()))
L, R = 1, N
for _ in range(M):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
if R<L:
print((0))
else:
print((R-L+1)) | p03037 |
N,M = list(map(int,input().split()))
l = [list(map(int,input().split())) for _ in range(M)]
for i in range(M):
l1 = list(range(l[i][0],l[i][1]+1))
if i == 0:
valid = l1
valid = set(valid) & set(l1)
print((len(valid)))
| N,M = list(map(int,input().split()))
l = [list(map(int,input().split())) for _ in range(M)]
for e in l:
L,R = e[0],e[1]
if e == l[0]:
_L,_R = L,R
else:
if _L < L:
_L = L
if _R > R:
_R = R
if _R - _L >= 0:
print((_R - _L + 1))
else:
print((0))
| p03037 |
Ns,Ms=input().split()
N=int(Ns)
M=int(Ms)
LR=input().split()
ans=set(range(int(LR[0]),int(LR[1])+1))
for i in range(M-1):
LR=[]
LR=input().split()
# print("ssssssssss")
# print(ans)
ansy=set(range(int(LR[0]),(int(LR[1])+1)))
ans=ans&ansy
print((len(ans)))
| Ns,Ms=input().split()
N=int(Ns)
M=int(Ms)
lists=[]
ansmins,ansmaxs=input().split()
ansmin=int(ansmins)
ansmax=int(ansmaxs)
for i in range(M-1):
tmpmin,tmpmax=input().split()
if int(tmpmin)>ansmin:
ansmin=int(tmpmin)
if int(tmpmax)<ansmax:
ansmax=int(tmpmax)
if (ansmax-ansmin+1)<0:
ans=0
else:
ans=ansmax-ansmin+1
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()))
x = set(range(l,r+1))
ans = ans & x
print((len(ans)))
|
n,m = list(map(int,input().split()))
ans,ansf = 1,n
for i in range(m):
l,r = list(map(int,input().split()))
ans = max(ans,l)
ansf = min(ansf,r)
if ansf - ans <0:
print((0))
else:
print((ansf-ans+1)) | p03037 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
for i in range(m):
a,b=list(map(int,input().split()))
l=[i for i in range(a,b+1)]
if i==0:
cards=l
else:
cards=list(set(l)&set(cards))
print((len(cards))) | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
leftgate=[]
rightgate=[]
for i in range(m):
l,r=list(map(int,input().split()))
leftgate.append(l)
rightgate.append(r)
if (min(rightgate)-max(leftgate))>-1:
print((min(rightgate)-max(leftgate)+1))
else:
print((0)) | p03037 |
N, M = list(map(int,input().split()))
c = 0
l2 = []
a, b = list(map(int,input().split()))
l = list(range(a,b+1))
for i in range(M-1):
c, d = list(map(int,input().split()))
l1 = list(range(c,d+1))
for j in l1:
if j in l:
l2.append(j)
l = l2
l2 = []
print((len(l)))
| n, m = list(map(int,input().split()))
a, b = list(map(int,input().split()))
cnt = 0
for i in range(1, m):
l, r = list(map(int,input().split()))
if (l > b and r > b) or (l < a and r < a):
print((0))
exit()
if a<=l<=b:
a = l
if r <= b:
b = r
print((b-a+1))
| p03037 |
n,m=list(map(int,input().split()))
an=[1]*n
for i in range(m):
l,r=list(map(int,input().split()))
for j in range(1,n+1):
if l <= j <= r:
pass
else:
an[j-1]=0
print((sum(an))) | n,m=list(map(int,input().split()))
lm=0
rm=10**9
for i in range(m):
l,r=list(map(int,input().split()))
lm=max(lm,l)
rm=min(rm,r)
print((max(0,rm-lm+1))) | p03037 |
N, M= (int(i) for i in input().split())
ans = set(range(1,N+1))
for i in range(M):
L_tmp, R_tmp = list(map(int, input().split()))
ans = ans & set(range(L_tmp,R_tmp+1))
print((len(ans)))
| N, M= (int(i) for i in input().split())
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)
ans = set(range(L_max,R_min+1))
print((len(ans)))
| p03037 |
n,m=list(map(int,input().split()))
a=[0 for i in range(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()))
lll=[]
rrr=[]
for i in range(m):
l,r=list(map(int,input().split()))
lll.append(l)
rrr.append(r)
print((max(0,min(rrr)-max(lll)+1))) | p03037 |
ans = 0
n, m = list(map(int, input().split()))
listL, listR = [], []
for i in range(m):
l, r = list(map(int, input().split()))
listL.append(l)
listR.append(r)
for j in range(n):
for i in range(m):
if not (listL[i] <= j + 1 <= listR[i]):
break
else:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
l, r = 1, n
for _ in range(m):
tmpL, tmpR = list(map(int, input().split()))
l = max(l, tmpL)
r = min(r, tmpR)
print((max(0, r - l + 1))) | p03037 |
n, m = list(map(int, input().split()))
L = [list(map(int, input().split())) for _ in range(m)]
print((sum([all([l <= i+1 <= r for l, r in L]) for i in range(n)]))) | n, m = list(map(int, input().split()))
L = [0]*m
R = [0]*m
for i in range(m):
*I, = list(map(int, input().split()))
L[i] = I[0]
R[i] = I[1]
print((max(min(R)-max(L)+1, 0))) | p03037 |
n, m = [int(x) for x in input().split()]
l, r = [int(x) for x in input().split()]
s1 = {int(x) for x in range(l, r+1)}
for i in range(m-1):
l, r = [int(x) for x in input().split()]
s2 = {int(x) for x in range(l, r+1)}
s1 = s1 & s2
print((len(s1))) | n, m = [int(x) for x in input().split()]
l = [0] * m
r = [0] * m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
L = max(l)
R = min(r)
if L <= R:
print((R - L + 1))
else:
print((0)) | p03037 |
import sys
input=lambda :sys.stdin.readline().rstrip()
n, m = list(map(int, input().split()))
key = [0]*n
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l-1, r):
key[i] = key[i]+1
print((len([i for i in key if i == m]))) | n, m = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(m)]
f_inf = float("inf")
max_l = 0
min_r = f_inf
for l, r in LR:
max_l = max(max_l, l)
min_r = min(min_r, r)
if min_r >= max_l:
print((min_r - max_l + 1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
vote = n * [0]
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l - 1, r):
vote[j] += 1
print((vote.count(m)))
| n, m = list(map(int, input().split()))
max_value = 10 ** 5
min_value = 1
for i in range(m):
l, r = list(map(int, input().split()))
min_value = max(min_value, l)
max_value = min(max_value, r)
ans = max_value - min_value + 1
if ans < 0:
ans = 0
print(ans)
| p03037 |
N,M=list(map(int,input().split()))
L,R=list(map(int,input().split()))
A=list(range(L,R+1))
for i in range(1,M):
L,R=list(map(int,input().split()))
A=set(A)&set(range(L,R+1))
print((len(A))) | N,M=list(map(int,input().split()))
L,R=list(map(int,input().split()))
a,b=L,R
for i in range(1,M):
L,R=list(map(int,input().split()))
a=max(a,L)
b=min(b,R)
if a>b:
print((0))
else:
print((b-a+1)) | p03037 |
m, n = list(map(int, input().split()))
l = []
for i in range(n):
a, b = list(map(int, input().split()))
l.append(set(range(a,b+1)))
if n >= 2:
for i in range(1,n):
d = l[0].intersection(l[i])
else:
d = l[0]
print((len(d))) | m, n = list(map(int, input().split()))
a, b = list(map(int, input().split()))
for i in range(n-1):
c, d = list(map(int, input().split()))
a = max(a,c)
b = min(b,d)
if b - a >=0 :
print((b-a +1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
l, m = list(map(int, input().split()))
ans = set(list(range(l, m+1)))
for i in range(M-1):
l, m = list(map(int, input().split()))
ans = ans & set(list(range(l, m+1)))
print((len(ans)))
| N, M = list(map(int, input().split()))
l = 1
m = N
for i in range(M):
l_i, m_i = list(map(int, input().split()))
l = max(l, l_i)
m = min(m, m_i)
if m < l:
print((0))
else:
print((m - l + 1)) | p03037 |
# ABC127 C - Prison
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n,m=nm()
l,r=0,10000000
for i in range(m):
cl,cr=nm()
l=max(cl,l)
r=min(cr,r)
if r-l>=0:
print((r-l+1))
elif r-l<0:
print((0))
| n,m=list(map(int,input().split()))
t_max=10**9
t_min=0
for i in range(m):
l,r=list(map(int,input().split()))
t_min=max(l,t_min)
t_max=min(r,t_max)
print((max(t_max-t_min+1,0))) | p03037 |
N, M = list(map(int, input().split()))
for i in range(M):
l, r = list(map(int, input().split()))
if i == 0:
s = set(range(l, r+1))
s = s & set(range(l, r+1))
print((len(s)))
| N, M = list(map(int, input().split()))
left = 0
right = N
for i in range(M):
L, R = list(map(int, input().split()))
left = max(left, L)
right = min(right, R)
if left > right:
print((0))
else:
print((right - left + 1))
| 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()))
x = set(range(l, r+1))
ans = ans & x
print((len(ans))) | n, m = list(map(int, input().split()))
x = [1, n]
for i in range(m):
l, r = list(map(int, input().split()))
x[0] = max(x[0], l)
x[1] = min(x[1], r)
print((max(x[1] - x[0] + 1, 0))) | p03037 |
n, m=list(map(int, input().split()))
grid = []
for i in range(m):
array = list(map(int, input().strip().split()))
grid.append(array)
maxa,mina=grid[0]
for i in range(1,m):
if maxa<grid[i][0]:
maxa=grid[i][0]
if mina>grid[i][1]:
mina=grid[i][1]
v=mina-maxa+1
if v>0:
print(v)
else:
print((0)) | n,m = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(m)]
L = max([i[0] for i in LR])
R = min([i[1] for i in LR])
print((max(R-L+1,0))) | p03037 |
n,m = list(map(int,input().split()))
kyotu_s = {k for k in range(1,n+1)}
for i in range(m):
l,r = list(map(int,input().split()))
s = {j for j in range(l,r+1)}
kyotu_s = s & kyotu_s
if len(kyotu_s)==0:
break
print((len(kyotu_s))) | n,m = list(map(int,input().split()))
min_i = 1
max_i = n
for i in range(m):
l,r = list(map(int,input().split()))
min_i = max(min_i,l)
max_i = min(max_i,r)
if max_i-min_i>=0:
print((max_i-min_i+1))
else:
print((0)) | p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.