input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split()))
gate = [ list(map(int, input().split())) for i in range(M) ]
nopass = 0
for i in range(1, N+1):
for j in gate:
if j[0] > i or j[1] < i:
nopass += 1
break
print((N - nopass)) | N, M = list(map(int, input().split()))
gate = [ list(map(int, input().split())) for i in range(M) ]
max_L = max([ i[0] for i in gate])
min_R = min([ i[1] for i in gate])
ans = 0
if max_L > min_R:
ans = 0
else:
ans = min_R - max_L + 1
print(ans) | p03037 |
N, M = [int(x) for x in input().split(" ")]
L, R = [], []
for i in range(M):
l, r = [int(x) for x in input().split(" ")]
L.append(l - 1)
R.append(r - 1)
pass_key = set([i for i in range(N)])
for i in range(M):
if len(pass_key) == 0:
print((0))
exit(0)
else:
pass_key = pass_key & set([ID for ID in range(L[i], R[i] + 1)])
print((len(pass_key)))
| N, M = [int(x) for x in input().split(" ")]
L, R = [], []
for i in range(M):
l, r = [int(x) for x in input().split(" ")]
L.append(l - 1)
R.append(r - 1)
L_max = max(L)
R_min = min(R)
count = R_min - L_max + 1 if R_min - L_max >= 0 else 0
print(count)
| p03037 |
n, m = list(map(int, input().split()))
lrs = [ list(map(int, input().split())) for _ in range(m)]
cards = set([i for i in range(lrs[0][0], lrs[0][1]+1)])
for lr in lrs[1:]:
tmp = set([i for i in range(lr[0], lr[1]+1)])
cards.intersection_update(tmp)
print((len(cards)))
| n, m = list(map(int, input().split()))
lrs = [ list(map(int, input().split())) for _ in range(m)]
cards = [lrs[0][0], lrs[0][1]] # [min, max]
for lr in lrs[1:]:
if (lr[1] < cards[0]) or (lr[0] > cards[1]):
print((0))
exit()
cards[0] = max(cards[0], lr[0])
cards[1] = min(cards[1], lr[1])
print((cards[1] - cards[0] + 1))
| p03037 |
N, M = list(map(int, input().split()))
id = [0 for i in range(N)]
for _ in range(M):
l, r = list(map(int, input().split()))
for i in range(l, r+1):
id[i-1] += 1
print((id.count(M))) | N, M = list(map(int, input().split()))
id = [0 for i in range(N)]
max_l = 0
min_r = 100000
for _ in range(M):
l, r = list(map(int, input().split()))
if max_l < l:
max_l = l
if min_r > r:
min_r = r
id = min_r-max_l+1
print((0 if id <0 else id)) | p03037 |
N, M = list(map(int, input().split()))
L = []
R = []
ans = 0
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
for i in range(N):
flg = 1
if i+1 < max(L) or i+1 > min(R):
flg = 0
ans += flg
print(ans) | N, M = list(map(int, input().split()))
L = 0
R = N
ans = 0
for i in range(M):
l, r = list(map(int, input().split()))
if l > L:
L = l
if r < R:
R = r
for i in range(N):
flg = 1
if i+1 < L or i+1 > R:
flg = 0
ans += flg
print(ans) | p03037 |
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
lst1 = [i for i in range(1, n + 1)]
for i in range(m):
l, r = list(map(int, input().split()))
lst = [l + j for j in range(r - l + 1)]
lst1 = lst if len(lst1) == 0 else list(set(lst1) & set(lst))
print((len(lst1)))
| # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
max_value, min_value = -1, -1
for i in range(m):
tmp_min_value, tmp_max_value = list(map(int, input().split()))
min_value = max([min_value, tmp_min_value]) if min_value >= 0 else tmp_min_value
max_value = min([max_value, tmp_max_value]) if max_value >= 0 else tmp_max_value
min_value = min_value if min_value <= n else n
max_value = max_value if max_value <= n else n
ret = max_value - min_value + 1
if ret < 0:
ret = 0
print(ret)
| p03037 |
N, M = list(map(int, input().split()))
a = {i for i in range(1, N+1)}
for i in range(M):
L, R = list(map(int, input().split()))
# print(a, set([i for i in range(L, R+1)]))
a = a & {i for i in range(L, R+1)}
# print(a, set([i for i in range(L, R+1)]))
print((len(a))) | N, M = list(map(int, input().split()))
a = {i for i in range(1, N+1)}
L_list = []
R_list = []
for i in range(M):
L, R = list(map(int, input().split()))
L_list.append(L)
R_list.append(R)
# print(a, set([i for i in range(L, R+1)]))
# a = a & {i for i in range(L, R+1)}
# print(a, set([i for i in range(L, R+1)]))
print((max(min(R_list) - max(L_list) + 1, 0))) | p03037 |
import sys
from itertools import accumulate
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
acc = [0] * (N+1)
for _ in range(M):
left, right = list(map(int, input().split()))
acc[left-1] += 1
acc[right] -= 1
cnt = 0
for a in accumulate(acc):
if a == M:
cnt += 1
return cnt
if __name__ == '__main__':
print((main()))
| import sys
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
L = 0
R = 10**5 + 1
for _ in range(M):
left, right = list(map(int, input().split()))
L = max(L, left)
R = min(R, right)
return max(R - L + 1, 0)
if __name__ == '__main__':
print((main()))
| p03037 |
n,m=(int(i) for i in input().split())
mylist=[0 for i in range(100010)]
for i in range(m):
a,b=(int(i) for i in input().split())
for j in range(a,b+1):
mylist[j]+=1
print((mylist.count(m))) | n,m=(int(i) for i in input().split())
list_a=[]
list_b=[]
for i in range(m):
a,b=(int(i) for i in input().split())
list_a.append(a)
list_b.append(b)
max_a=max(list_a)
min_b=min(list_b)
if min_b-max_a+1>=0:
print((min_b-max_a+1))
else:
print((0))
| p03037 |
N,M=list(map(int,input().split()))
set1=set()
set2=set()
L,R=list(map(int,input().split()))
for i in range(L,R+1):
set1.add(i)
min=min(set1)
max=max(set1)+1
for i in range(M-1):
L,R=list(map(int,input().split()))
if min <= L:
min=L
if max >= R+1:
max=R+1
for j in range(min,max):
set2.add(j)
set1=set1&set2
set2.clear()
print((len(set1)))
| N,M=list(map(int,input().split()))
set1=set()
L,R=list(map(int,input().split()))
for i in range(L,R+1):
set1.add(i)
min=min(set1)
max=max(set1)
Flag=True
for i in range(M-1):
L,R=list(map(int,input().split()))
if R < min:
Flag=False
break
elif L > max:
Flag=False
break
if L >= min and max >= L:
min = L
if R >= min and max >= R:
max = R
if Flag:
print((max-min+1))
else:
print((0)) | p03037 |
def main():
card_cnt, gate_cnt = list(map(int, input().split()))
LR = set(range(1, 100000+1))
for _ in range(gate_cnt):
L, R = list(map(int, input().split()))
LR.intersection_update(list(range(L, R+1)))
if len(LR) == 0:
break
print((len(LR)))
if __name__ == "__main__":
main() | def main():
card_cnt, gate_cnt = list(map(int, input().split()))
min_v, max_v = list(map(int, input().split()))
for _ in range(1, gate_cnt):
L,R = list(map(int, input().split()))
min_v = max(min_v, L)
max_v = min(max_v, R)
if min_v > max_v:
print((0))
break
else:
print((len(list(range(min_v, max_v+1)))))
if __name__ == "__main__":
main() | p03037 |
N,M=list(map(int,input().split()))
LR=[list(map(int,input().split())) for _ in range(M)]
cnt=0
for i in range(1,N+1):
for l,r in LR:
if i<l or r<i:
break
else:
cnt+=1
print(cnt) | N,M=list(map(int,input().split()))
mm=0
mx=10**5
for _ in range(M):
l,r = list(map(int,input().split()))
mm = max(mm,l)
mx= min(mx,r)
print((max(mx-mm+1,0))) | p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
s = set(range(LR[0][0], LR[0][1]+1))
for lr in LR:
s = s.intersection(s, set(range(lr[0], lr[1]+1)))
print((len(s))) | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
minv = 100000
maxv = 1
for lr in LR:
maxv = max(maxv, lr[0])
minv = min(minv, lr[1])
print((max(0, minv - maxv + 1))) | p03037 |
n, m = list(map(int,input().split()))
lst = [0 for i in range(n)]
for i in range(m):
l, r = list(map(int,input().split()))
for j in range(l - 1, r):
lst[j] = lst[j] + 1
ans = 0
for i in range(n):
if(lst[i] == m):
ans = ans + 1
print(ans)
| n, m = list(map(int,input().split()))
for i in range(m):
if (i == 0):
l, r = list(map(int,input().split()))
else:
l2, r2 = list(map(int,input().split()))
l = max(l, l2)
r = min(r, r2)
if (l > r):
print((0))
else:
print((r - l + 1))
| p03037 |
N, M = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(M)]
S2 = [set(range(s[0], s[1] + 1)) for s in S]
S3 = set.intersection(*S2)
print((len(S3)))
#ans = set(range(S[0][0], S[0][1] + 1))
#for s in S[1:] :
# a = set(range(s[0], s[1] + 1))
# ans = ans & a
# if len(ans) == 0 :
# break
#print(len(ans)) | import collections
N, M = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(M)]
smax = max([s[0] for s in S])
smin = min([s[1] for s in S])
if smin - smax + 1 >= 0 :
print((smin - smax + 1))
else :
print((0))
#S2 = [set(range(s[0], s[1] + 1)) for s in S]
#S3 = set.intersection(*S2)
#print(len(S3))
#ans = set(range(S[0][0], S[0][1] + 1))
#for s in S[1:] :
# a = set(range(s[0], s[1] + 1))
# ans = ans & a
# if len(ans) == 0 :
# break
#print(len(ans)) | p03037 |
n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
lis=list(range(l,r+1))
ans=lis
for i in range(m-1):
l,r=list(map(int,input().split()))
lis_=list(range(l,r+1))
ans=list(set(lis)&set(lis_))
print((len(ans))) | #不十分だった
n, m = list(map(int, input().split()))
l_max, r_min = 0, 10**5 + 1
for i in range(m):
l, r = list(map(int, input().split()))
l_max = max(l_max, l)
r_min = min(r_min, r)
print((max(r_min - l_max + 1, 0))) | p03037 |
n, m = list(map(int,input().split()))
arr = [0]*n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l-1,r):
arr[j]+=1
print((arr.count(m)))
| n, m = list(map(int,input().split()))
arr = [1, n]
check = True
for i in range(m):
l, r = list(map(int, input().split()))
if l <= arr[0] and r>= arr[1]:
continue
elif l > arr[1] or r < arr[0]:
check = False
if arr[0] <= l and l <= arr[1]:
arr[0] = l
if arr[1] >= r and r >= arr[0]:
arr[1] = r
if check:
print((arr[1] - arr[0] + 1))
else:
print((0))
| p03037 |
n,m = list(map(int,input().split()))
lScope = []
rScope = []
ans = 0
for i in range(m):
l,r = list(map(int,input().split()))
lScope.append(l)
rScope.append(r)
# k in keyScope[i] (i= 0~m) を確かめたい
for key in range(1,n+1):
if max(lScope) <= key <= min(rScope):
ans += 1
print(ans) | n,m = list(map(int,input().split()))
lScope = []
rScope = []
ans = 0
for i in range(m):
l,r = list(map(int,input().split()))
lScope.append(l)
rScope.append(r)
# k in keyScope[i] (i= 0~m) を確かめたい
if min(rScope) >= max(lScope):
print((min(rScope) - max(lScope) + 1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
ans=[1 for i in range(n)]
for i in range(m):
l,r=list(map(int,input().split()))
for j in range(n):
if ans[j]==1:
if j<l-1 or j>r-1:
ans[j]=0
print((ans.count(1))) | n,m=list(map(int,input().split()))
lmax,rmin=0,n
for i in range(m):
l,r=list(map(int,input().split()))
if l>lmax:
lmax=l
if r<rmin:
rmin=r
if rmin-lmax<0:
print((0))
else:
print((rmin-lmax+1)) | p03037 |
N,M = list(map(int,input().split()))
cards = [True]*N
for g in range(M):
L,R = list(map(int,input().split()))
for i in range(L-1):
cards[i] = False
for i in range(R,N):
cards[i] = False
print((cards.count(True))) | N,M = list(map(int,input().split()))
maL = 0
miR = N
for g in range(M):
L,R = list(map(int,input().split()))
maL = max(maL,L)
miR = min(miR,R)
if maL <= miR:
print((miR-maL+1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
List = [list(map(int, input().split())) for _ in range(M)]
ones = [1]*N
for i in range(M):
ones[List[i][1]:]=[0]*(N-List[i][1])
ones[:List[i][0]-1]=[0]*(List[i][0]-1)
print((sum(ones))) | N, M = list(map(int, input().split()))
List = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for i in range(M):
if left<List[i][0]:
left = List[i][0]
if List[i][1]<right:
right = List[i][1]
if right<left:
print((0))
else:
print((right-left+1)) | p03037 |
N, M = list(map(int, input().split()))
if M == 1:
l1, r1 = list(map(int, input().split()))
print((r1 - l1 + 1))
else:
C = 0
l1, r1 = list(map(int, input().split()))
for _ in range(M - 1):
l2, r2 = list(map(int, input().split()))
A = list(range(l1, r1 + 1))
B = list(range(l2, r2 + 1))
C = set(A) & set(B)
print((len(C))) | N, M = list(map(int, input().split()))
left= []
right = []
for _ in range(M):
L, R = list(map(int, input().split()))
left.append(L)
right.append(R)
min_right = min(right)
max_left = max(left)
if min_right < max_left:
print((0))
else:
print((min_right - max_left + 1))
| p03037 |
card_num, gate_num = list(map(int, input().split()))
s, t = list(map(int, input().split()))
all_set = set(range(s, t+1))
for _ in range(gate_num-1):
s, t = list(map(int, input().split()))
all_set = all_set.intersection(set(range(s, t+1)))
print((len(all_set)))
| card_num, gate_num = list(map(int, input().split()))
ans_start, ans_end = list(map(int, input().split()))
for _ in range(gate_num-1):
s, e = list(map(int, input().split()))
if e < ans_start or ans_end < s:
print((0))
exit()
elif s < ans_start and ans_start < e < ans_end:
ans_end = e
elif ans_start < s < ans_end and ans_end < e:
ans_start = s
elif ans_start == e:
ans_end = e
elif ans_end == s:
ans_start = s
print((ans_end - ans_start + 1))
| p03037 |
n, m = list(map(int, input().split()))
lis = [1]*(n+2)
lis[0] = 0
lis[-1] = 0
for k in range(m):
i, j = list(map(int, input().split()))
lis[:i] = [0]*(i)
lis[j+1:] = [0]*(n - j + 2)
print((sum(lis))) | n, m = list(map(int, input().split()))
i = 0
j = n + 1
for k in range(m):
ti, tj = list(map(int, input().split()))
if ti > i:
i = ti
if tj < j:
j = tj
if j == 0 and i == 0:
print((0))
else:
print((max(j - i + 1, 0))) | p03037 |
N,M=list(map(int, input().split()))
L,R=list(map(int, input().split()))
s=[i for i in range(L,R+1)]
t=[]
for i in range(M-1):
L,R=list(map(int, input().split()))
t=[j for j in range(L,R+1)]
s = set(s) & set(t)
#print(s)
print((len(s))) | 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)
ans=min(R)-max(L)+1
print(("0" if ans<0 else ans))
| p03037 |
N,M =list(map(int,input().split()))
L = [0]*M
R = [0]*M
ans = int(0)
for i in range(M):
L[i],R[i] = list(map(int,input().split()))
for i in range(N):
j = int(0)
while (R[j]>=i+1>=L[j]) :
j += 1
if j==M:
ans +=1
break
print(ans)
| N,M =list(map(int,input().split()))
L = [0]*M
R = [0]*M
ans = int(0)
for i in range(M):
L[i],R[i] = list(map(int,input().split()))
a1 = max(L)
a2 = min(R)
ans = a2-a1+1
if ans<0 : ans = int(0)
print((int(ans)))
| p03037 |
n, m = list(map(int,input().split()))
ans = [0]*n
for _ in range(m):
l, r = list(map(int,input().split()))
for i in range(l-1, r):
ans[i] += 1
print((ans.count(m))) | n, m = list(map(int,input().split()))
maxL, minR = 1, n
L = []
R = []
for i in range(m):
l, r = list(map(int,input().split()))
maxL = max(maxL, l)
minR = min(minR, r)
ans = minR - maxL + 1
print((max(ans, 0))) | p03037 |
N, M = list(map(int, input().split()))
count = [0]*N
for i in range(M):
L, R = list(map(int, input().split()))
for i in range(L, R+1):
count[i-1] += 1
ans = 0
for i in count:
if i == M:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
maxL = 0
minR = float('inf')
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(maxL, L)
minR = min(minR, R)
if minR - maxL >= 0:
print((minR - maxL + 1))
else:
print((0)) | p03037 |
N, M = list(map(int,input().split()))
LR = []
for i in range(M):
LR.append(list(map(int,input().split())))
cnt = 0
for i in range(1,N+1):
for lr in LR:
if i < lr[0] or i > lr[1]:
break
else:
cnt += 1
print(cnt)
| N, M = list(map(int,input().split()))
Nmin = 1
Nmax = N
for i in range(M):
L, R = list(map(int,input().split()))
Nmin = max(L,Nmin)
Nmax = min(R,Nmax)
print((max(Nmax-Nmin+1,0))) | p03037 |
n, m = list(map(int, input().split()))
L, R = [], []
for _ in range(m):
li, ri = list(map(int, input().split()))
L.append(li)
R.append(ri)
ans = 0
for i in range(1, n+1):
flag = True
for li, ri in zip(L, R):
if not (i >= li and i <= ri):
flag = False
break
if flag:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
L, R = [], []
for _ in range(m):
li, ri = list(map(int, input().split()))
L.append(li)
R.append(ri)
# ans = 0
# for i in range(1, n+1):
# flag = True
# for li, ri in zip(L, R):
# if not (i >= li and i <= ri):
# flag = False
# break
# if flag:
# ans += 1
# print(ans)
ans = min(min(R), n) - min(max(L), n) +1
if ans < 0:
ans = 0
print(ans)
| p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
S = set(range(l, r + 1))
for i in range(m - 1):
l, r = list(map(int, input().split()))
S &= set(range(l, r + 1))
print((len(S))) | n, m = list(map(int, input().split()))
maxl, minr = list(map(int, input().split()))
for i in range(m - 1):
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()))
count = 0
for i in range(M):
a,b = list(map(int,input().split()))
if count == 0:
set = {i for i in range(a,b+1)}
count = 1
else:
set = set & {i for i in range(a,b+1)}
print((len(set))) | N,M = list(map(int,input().split()))
count = 0
for i in range(M):
a,b = list(map(int,input().split()))
if count == 0:
L = a
R = b
count = 1
else:
if L < a:
L =a
if L>R:
break
if R > b:
R = b
if R < L:
break
if M == i+1:
print((R-L+1))
else:
print((0)) | p03037 |
n , m = list(map(int,input().split()))
a = [1] * n
ans = 0
for i in range(m):
l , r = list(map(int,input().split()))
for j in range(n):
if l > j + 1 or j + 1 > r:
a[j] = 0
for i in range(n):
ans += a[i]
print(ans) | n , m = list(map(int,input().split()))
a , b = 1 , 100000
for i in range(m):
l , r = list(map(int,input().split()))
if a <= l:
a = l
if b >= r:
b = r
c = b - a + 1
if c > 0:
print(c)
else:
print((0)) | p03037 |
import collections
n,m = list(map(int,input().split()))
r = []
ans = 0
for i in range(m):
ll,rr = list(map(int,input().split()))
for j in range(ll-1,rr):
r.append(j)
cnt = collections.Counter(r)
for i in list(cnt.values()):
if i == m:
ans += 1
print(ans) | import collections
n,m = list(map(int,input().split()))
r = []
l = []
for i in range(m):
ll,rr = list(map(int,input().split()))
r.append(rr)
l.append(ll)
ans = min(r) - max(l) +1
if ans > 0:
print(ans)
else :
print((0)) | p03037 |
N,M=list(map(int,input().split()))
result=0
LR=[]
for i in range(M):
LR.append(input().split())
for i in range(N+1):#0からNまで
counter=0
flag=False
if flag:
break
for j in LR:
L=int(j[0])
R=int(j[1])
if i<L or R<i:
flag=True
break
if L<=i and i<=R:
counter+=1
if counter==M:
result+=1
print(result)
|
N,M=list(map(int,input().split()))#ID,ゲート
LR=[]
for i in range(M):
LR.append(input().split())
numbers=[]
for i in range(N+1):
numbers.append(i)
Lmax=1
Rmax=100000
for j in LR:
L=int(j[0])
R=int(j[1])
if Lmax<L:
Lmax=L
if Rmax>R:
Rmax=R
result=0
for i in numbers:
if i>=Lmax:
if i<=Rmax:
result+=1
print(result)
| p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
cnt = [0]*n
for i in range(m):
for j in range(lr[i][0]-1, lr[i][1]):
cnt[j] += 1
ans = sum(i==m for i in cnt)
print(ans)
| n, m = list(map(int, input().split()))
left = 0
right = n+1
for i in range(m):
l, r = list(map(int, input().split()))
left = max(left, l)
right = min(right, r)
ans = 0
for i in range(left-1, right):
ans += 1
print(ans)
| p03037 |
n, m = list(map(int, input().split()))
cards = {i: False for i in range(1, n+1)}
for _ in range(m):
l, r = list(map(int, input().split()))
for i in cards:
if i < l or i > r:
cards[i] = True
sum = 0
for v in list(cards.values()):
if not v:
sum += 1
print(sum) | n, m = list(map(int, input().split()))
max_l = 1
min_r = n
for _ in range(m):
l, r = list(map(int, input().split()))
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = max(min_r - max_l + 1, 0)
print(ans) | p03037 |
N,M = list(map(int,input().split()))
key = [0]*N
x = [list(map(int,input().split())) for i in range(M)]
for i in range(M):
for j in range(x[i][0],x[i][1]+1):
key[j-1] += 1
count = 0
for k in range(N):
if key[k] == M:
count += 1
print(count) | N,M = list(map(int,input().split()))
X = [list(map(int,input().split())) for i in range(M)]
keymax = 10**6
keymin = 0
for i in range(M):
if X[i][0] > keymin:
keymin = X[i][0]
if X[i][1] < keymax:
keymax = X[i][1]
if keymax >= keymin:
print((keymax-keymin+1))
else:
print("0") | p03037 |
N, M = list(map(int, input().split()))
X = set(range(1,N+1))
for i in range(M):
L, R = list(map(int, input().split()))
Y = set(range(L,R+1))
X = X & Y
print((len(X)))
| N, M = list(map(int, input().split()))
min, max = list(map(int, input().split()))
for i in range(1, M):
L, R = list(map(int, input().split()))
if L > max or R < min:
print((0))
exit()
elif min < L <= max:
min = L
elif min <= R < max:
max = R
print((max-min+1))
| p03037 |
N, M = list(map(int, input().split()))
gates = []
for i in range(M):
gates.append(tuple(map(int, input().split())))
s = set(range(gates[0][0], gates[0][-1] + 1))
for g in gates[1:]:
tmp_s = set(range(g[0], g[-1] + 1))
s = s.intersection(tmp_s)
print((len(s))) | N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
l_max = max(L)
r_min = min(R)
if l_max <= r_min:
print((r_min - l_max + 1))
else:
print((0))
| p03037 |
n, m = list(map(int, input().split()))
a, b = list(map(int, input().split()))
k = set(range(a, b+1))
for i in range(m - 1):
a, b = list(map(int, input().split()))
k = k.intersection(set(range(a, b+1)))
print((len(k))) | n, m = list(map(int, input().split()))
L = set()
R = set()
for i in range(m):
l, r = list(map(int, input().split()))
L.add(l)
R.add(r)
if min(R) >= max(L):
num = min(R) - max(L) + 1
else:
num = 0
print(num)
| p03037 |
def main():
N, M = list(map(int, input().split()))
lr = [list(map(int, list(input().split()))) for i in range(M)]
# N, M = 4, 2
# lr = [[1, 3], [2, 4]]
all_set = set(range(1, N + 1))
for line in lr:
all_set = all_set & set(range(line[0], line[1] + 1))
print((len(all_set)))
if __name__ == '__main__':
main() | def main():
N, M = list(map(int, input().split()))
lr = [list(map(int, list(input().split()))) for i in range(M)]
# N, M = 4, 2
# lr = [[1, 1], [3, 4]]
ll = []
rl = []
for line in lr:
ll.append(line[0])
rl.append(line[1])
diff = min(rl) - max(ll)
if diff < 0:
print((0))
return
print((diff + 1))
if __name__ == '__main__':
main()
| p03037 |
N, M = list(map(int, input().split()))
result = [0]*N
for m in range(M):
L, R = list(map(int, input().split()))
for i in range(L, R+1):
result[i-1] += 1
counter = 0
for i in result:
if i == M:
counter += 1
print(counter) | N, M = list(map(int, input().split()))
for m in range(M):
L, R = list(map(int, input().split()))
if m==0:
l = L
r = R
else:
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()))
L, R = [0]*M, [0]*M
A = set(range(N))
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
A = A & set(range(L[i]-1, R[i]))
print((len(A))) | N, M = list(map(int, input().split()))
L, R = [0]*M, [0]*M
A = set(range(N))
lm, rm = 0, N
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
lm = max(lm, L[i])
rm = min(rm, R[i])
if lm <= rm:
print((rm-lm+1))
else:
print((0)) | p03037 |
N,M=list(map(int,input().split()))
ans=set([i for i in range(1,N+1)])
for i in range(M):
a,b=list(map(int,input().split()))
tmp=set([i for i in range(a,b+1)])
ans &=tmp
print((len(ans))) | N,M=list(map(int,input().split()))
s=1
m=N
for i in range(M):
a,b=list(map(int,input().split()))
if s<a:
s=a
if m>b:
m=b
#ans &=tmp
ans=m-s+1
if ans>0:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().strip().split()))
set_ = set()
for m in range(M):
s, e = list(map(int, input().strip().split()))
tmp = set()
for i in range(s, e+1):
tmp.add(i)
if m == 0:
set_ = tmp
else:
set_ = set_ & tmp
print((len(set_)))
| N, M = list(map(int, input().strip().split()))
s_list = list()
e_list = list()
for m in range(M):
s, e = list(map(int, input().strip().split()))
s_list.append(s)
e_list.append(e)
s_max = max(s_list)
e_min = min(e_list)
if s_max > e_min:
print((0))
else:
print((e_min-s_max+1))
| p03037 |
n,m=list(map(int,input().split()))
s=[0]*n
for _ in range(m):
b,c=list(map(int,input().split()))
for i in range(b-1,c):
s[i]+=1
print((s.count(m))) | n,m=list(map(int,input().split()))
s=[0]*n
max_=1
min_=n
for _ in range(m):
b,c=list(map(int,input().split()))
if b>max_:
max_=b
if c<min_:
min_=c
if min_<max_:
print('0')
else:
print((min_-max_+1)) | p03037 |
n,m = list(map(int,input().split()))
li=[list([int(x)+1 for x in input().split()]) for _ in range(m)]
s=set(range(li[0][0],li[0][1]+1))
for i in li:
s = s & set(range(i[0],i[1]+1))
print((len(s))) | n,m = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(m)]
l = s[0][0]
r = s[0][1]
for i,j in s:
if i>l:l=i
if j<r:r=j
print((max(0,r-l+1))) | p03037 |
import itertools
import math
import fractions
import functools
import copy
n, m = list(map(int, input().split()))
lr = []
for i in range(m):
l, r = list(map(int, input().split()))
lr.append([l,r])
result = list(range(lr[0][0],lr[0][1]+1))
for i in range(len(result)):
for pair in lr:
if not(pair[0] <= result[i] and pair[1] >= result[i]):
result[i] = -1
print((len(result)-result.count(-1)))
| import itertools
import math
import fractions
import functools
import copy
n, m = list(map(int, input().split()))
lr = []
for i in range(m):
l, r = list(map(int, input().split()))
lr.append([l,r])
result = list(range(lr[0][0],lr[0][1]+1))
maximum = lr[0][1]
minimum = lr[0][0]
for i in range(len(lr)):
maximum = min(maximum,lr[i][1])
minimum = max(minimum,lr[i][0])
if maximum < minimum:
print((0))
else:
print((maximum-minimum+1)) | p03037 |
n,m = list(map(int,input().split()))
li = []
counter = 0
for i in range(m):
l,r = list(map(int,input().split()))
for j in range(l,r+1):
li.append(j)
import collections
c = collections.Counter(li)
for k in list(c.values()):
if k == m:
counter += 1
print(counter)
| n,m = list(map(int,input().split()))
l,r = list(map(int,input().split()))
counter = 0
for i in range(m-1):
l1,r1 = list(map(int,input().split()))
if l < l1:
l = l1
if r > r1:
r = r1
if r < l:
print((0))
else:
print((r-l+1))
| p03037 |
# coding: utf-8
# Your code here!
N, M = list(map(int,input().split()))
li = [list(map(int,input().split())) for i in range(M)]
L = [li[j][0] for j in range(M)]
R = [li[k][1] for k in range(M)]
ctr = 0
for i in range(1, N + 1):
if i >= max(L) and i <= min(R):
ctr += 1
print(ctr) | # coding: utf-8
# Your code here!
N, M = list(map(int,input().split()))
li = [list(map(int,input().split())) for i in range(M)]
L = [li[j][0] for j in range(M)]
R = [li[k][1] for k in range(M)]
ctr = 0
if min(R) - max(L) >= 0:
print((min(R) - max(L) + 1))
else:
print((0)) | p03037 |
# coding: utf-8
# Your code here!
from itertools import chain
from collections import Counter
N, M = list(map(int,input().split()))
li = [list(map(int,input().split())) for i in range(M)]
arr = [[j for j in range(li[k][0], li[k][1] + 1)] for k in range(M)]
set_arr = list(chain.from_iterable(arr))
arr_duplicate = [l for l in list(Counter(set_arr).values()) if l == M]
print((len(arr_duplicate)))
| # coding: utf-8
# Your code here!
N, M = list(map(int,input().split()))
li = [list(map(int,input().split())) for i in range(M)]
L = [li[j][0] for j in range(M)]
R = [li[k][1] for k in range(M)]
ctr = 0
if min(R) - max(L) >= 0:
print((min(R) - max(L) + 1))
else:
print((0))
| p03037 |
N, M = list(map(int, input().split()))
LR = []
for _ in range(M):
L, R = list(map(int, input().split()))
LR.append({i for i in range(L, R + 1)})
x = LR[0]
for y in LR:
x &= y
print((len(x))) | N, M = list(map(int, input().split()))
L, R = [None] * M, [None] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
l = max(L)
r = min(R)
ans = r - l + 1
if ans < 0:
ans = 0
print(ans) | p03037 |
n, m = list(map(int, input().split()))
ids = [0 for _ in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l-1, r):
ids[j] += 1
ans = 0
for tmp_id in ids:
if tmp_id == m:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
l_tmp = 0
r_tmp = n+1
for i in range(m):
l, r = list(map(int, input().split()))
l_tmp = l if l > l_tmp else l_tmp
r_tmp = r if r < r_tmp else r_tmp
if r_tmp-l_tmp >= 0:
print((r_tmp-l_tmp+1))
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
lr = [list(map(int,input().split())) for i in range(m)]
wildcard = set(range(lr[0][0],lr[0][1]+1))
for i in range(1,len(lr)):
wildcard &= set(range(lr[i][0],lr[i][1]+1))
ans = len(wildcard)
print(ans)
| n,m = list(map(int,input().split()))
lr = [list(map(int,input().split())) for i in range(m)]
lp = 1
rp = n
for i in range(m):
if lp < lr[i][0]:
lp = lr[i][0]
if rp > lr[i][1]:
rp = lr[i][1]
else:
if rp - lp < 0:
ans = 0
else:
ans = rp-lp+1
print(ans) | p03037 |
L,M=list(map(int,input().split()))
MAX=0
MIN=L
for i in range(M):
A,B=list(map(int,input().split()))
MAX=max(MAX,A)
MIN=min(MIN,B)
print((max(0,MIN-MAX+1))) | L,M=list(map(int,input().split()))
MAX=0
MIN=10**5
for i in range(M):
A,B=list(map(int,input().split()))
MAX=max(MAX,A)
MIN=min(MIN,B)
print((max(0,MIN-MAX+1))) | p03037 |
#36
N,M = list(map(int,input().split()))
li = []
ri = []
x = []
y = [i for i in range(1,N+1)]
cou = 0
for i in range(M):
L,R = list(map(int,input().split()))
for i in y:
if L<=i and R>=i:
x.append(i)
y = x
x = []
cou = len(y)
print(cou)
| #36
N,M = list(map(int,input().split()))
li = []
ri = []
num = 0
for i in range(M):
L,R = list(map(int,input().split()))
li.append(L)
ri.append(R)
L = max(li)
R = min(ri)
num = R-L+1
if num <0:
num= 0
print(num)
| p03037 |
N,M = list(map(int,input().split()))
a,b=list(map(int,input().split()))
l_=[int(n) for n in range(a,b+1)]
for i in range(M-1):
c,d=list(map(int,input().split()))
l__=[n for n in range(c,d+1)]
l_=list(set(l_)&set(l__))
print((len(l_))) | n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
L=[]
R=[]
for i in range(m):
L.append(l[i][0])
R.append(l[i][1])
print((max(min(R)-max(L)+1,0))) | p03037 |
n,m = list(map(int,input().split()))
numSet = set(range(1,n+1))
for i in range(m):
l,r = list(map(int,input().split()))
numSet &= set(range(l,r+1))
print((len(numSet)))
| n,m = list(map(int,input().split()))
numSet = set(range(1,n+1))
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):
print((min(R)-max(L)+1))
else:
print((0)) | p03037 |
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
n, m = list(map(int, input().split()))
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x,y = list(map(int,input().split()))
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count) | # coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: list(map(int, sys.stdin.readline().split()))
readms = lambda: list(map(str, sys.stdin.readline().split()))
n, m = readmi()
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x,y = readmi()
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
card = set(range(l, r + 1))
for _ in range(1, m):
l, r = list(map(int, input().split()))
card &= set(range(l, r + 1))
print((len(card))) | n, m = list(map(int, input().split()))
lr = [tuple(map(int, input().split())) for _ in range(m)]
maxl = max(_[0] for _ in lr)
minr = min(_[1] for _ in lr)
if minr - maxl >= 0:
answer = minr - maxl + 1
else:
answer = 0
print(answer) | p03037 |
n, m = list(map(int, input().split()))
ans = set(range(1, n+1))
for i in range(m):
l, r = list(map(int, input().split()))
ans = ans & set(range(l, r+1))
print((len(ans))) | n, m = list(map(int, input().split()))
maxl = 0
minr = 10**5
for i 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()))
l, r = list(map(int, input().split()))
ans = set(range(l, r+1))
for i in range(m-1):
l, r = list(map(int, input().split()))
ans = ans & set(range(l, r + 1))
print((len(ans)))
| n, m = list(map(int, input().split()))
l, r = 0, 10 ** 6
for i in range(m):
tl, tr = list(map(int, input().split()))
l = max(tl, l)
r = min(tr, r)
print((len(list(range(l, r+1)))))
| p03037 |
n, m = map(int,input().split())
n_lis = [i+1 for i in range(n)]
for j in range(m):
l, r = map(int,input().split())
n_lis = [k for k in n_lis if k >= l and k <= r]
print(len(n_lis),flush=True)
| n, m = list(map(int,input().split()))
l_p = 1
r_p = n
for j in range(m):
l, r = list(map(int,input().split()))
if l > l_p:
l_p = l
if r < r_p:
r_p = r
a = r_p - l_p + 1
if a > 0:
print(a)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
hashset = None
for _ in range(M):
L, R = list(map(int, input().split()))
if hashset is None:
hashset = set(range(L, R+1))
else:
hashset = hashset & set(range(L, R+1))
print((len(hashset))) | N, M = list(map(int, input().split()))
left, right = 1, N
for _ in range(M):
L, R = list(map(int, input().split()))
left = max(L, left)
right = min(R, right)
ans = right - left + 1 if left <= right else 0
print(ans) | p03037 |
N, M = list(map(int,input().split()))
ans = 0
keylist = [[False]*M for _ in range(N)]
for i in range(M):
L, R = list(map(int,input().split()))
for j in range(L-1,R):
keylist[j][i] = True
for i in range(N):
if all(keylist[i]):
ans += 1
print(ans) | N, M = list(map(int,input().split()))
ans = 0
L,R = 0, 100000
for i in range(M):
Ltmp, Rtmp = list(map(int,input().split()))
L, R = max(L, Ltmp), min(R, Rtmp)
print((max(0,R-L+1))) | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
ans = []
for i in range(m):
res = []
for j in range(lr[i][0], lr[i][1] + 1):
res.append(j)
if i == 0:
ans = set(res)
else:
ans = set(ans) & set(res)
print((len(ans)))
| n, m = list(map(int, input().split()))
mi, ma = 1, n
for _ in range(m):
l, r = list(map(int, input().split()))
mi = max(l, mi)
ma = min(r, ma)
print((max(0, ma - mi + 1)))
| p03037 |
n, m = list(map(int, input().split()))
data = []
for i in range(m):
data.append(list(map(int, input().split())))
num = 1
count = 0
while num <= n:
flag = True
for i in range(m):
if data[i][0] > num or data[i][1] < num:
flag = False
num += 1
if flag:
count += 1
print(count) | n, m = list(map(int, input().split()))
data = []
data1 = []
data2 = []
for i in range(m):
data.append(list(map(int, input().split())))
for i in range(m):
data1.append(data[i][0])
data2.append(data[i][1])
if min(data2) - max(data1) + 1 > 0:
print((min(data2) - max(data1) + 1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
ID=[0 for i in range(n)]
for i in range(m):
l,r=list(map(int,input().split()))
for j in range(r-l+1):
ID[l-1+j]+=1
print((ID.count(m))) | n,m=list(map(int,input().split()))
L=[]
R=[]
for i in range(m):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
print((min(R)-max(L)+1 if min(R)-max(L)+1>0 else 0)) | p03037 |
N,M = list(map(int,input().split()))
lists = []
for i in range(M):
L,R = list(map(int,input().split()))
lists.append(list(range(L,R+1)))
if len(lists) == 1:
print((len(lists[0])))
exit()
for i in range(M-1):
lists[i+1] = set(lists[i]) & set(lists[i+1])
ans = lists[-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()))
#b = list(map(int, input().split()))
dic = {}
for i in range(m):
l, r = [int(j) for j in input().split()]
for j in range(l, r+1):
if str(j) in dic:
dic[str(j)] += 1
else:
dic[str(j)] = 1
count = 0
for i in list(dic.values()):
if i == m:
count += 1
print(count)
| n, m = list(map(int, input().split()))
#b = 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)
L = l[0]
R = r[0]
# print("--------")
for i in range(1, m):
if not((R < l[i] and R < r[i]) or (r[i] < L and l[i] < L)):
L = max(L, l[i])
R = min(R, r[i])
else:
print((0))
exit()
#print(L, R)
print((R-L+1))
| p03037 |
n, m = list(map(int, input().split()))
line = set(range(1, n + 1))
for i in range(m):
l, r = list(map(int, input().split()))
line &= set(range(l, r + 1))
print((len(line)))
| n, m = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 5
for i in range(m):
l, r = list(map(int, input().split()))
l_max = max(l, l_max)
r_min = min(r, r_min)
print((max(0, r_min - l_max + 1)))
| p03037 |
from collections import defaultdict
class Solution:
def main(self):
N, M = list(map(int, input().split()))
L = []
R = []
cards = set(list(range(1, N+1)))
for _ in range(M):
l, r = list(map(int, input().split()))
cands = set(list(range(l, r+1)))
cards = cards & cands
print((len(cards)))
if __name__ == '__main__':
Solution().main() | from collections import defaultdict
class Solution:
def main(self):
N, M = list(map(int, input().split()))
L = []
R = []
cards = set(list(range(1, N+1)))
left = 1
right = N
for _ in range(M):
l, r = list(map(int, input().split()))
if right < l or r < left:
print((0))
return 0
left = max(l, left)
right = min(r, right)
else:
print((right-left+1))
return
if __name__ == '__main__':
Solution().main() | p03037 |
import sys
def main():
sinputl = sys.stdin.readline
num_card, num_gate = [int(x) for x in sinputl().split()]
input = [[int(x) for x in sinputl().split()] for _ in range(num_gate)]
min_interval = [1, num_card]
for gate in input:
if (min_interval[1] - min_interval[0]) > (gate[1] - gate[0]):
min_interval = gate
cards = list(range(min_interval[0], min_interval[1] + 1))
for gate in input:
cards = list([x for x in cards if gate[0] <= x <= gate[1]])
print((len(cards)))
if __name__ == "__main__":
main()
| import sys
def main():
sinputl = sys.stdin.readline
num_card, num_gate = [int(x) for x in sinputl().split()]
input = [[int(x) for x in sinputl().split()] for _ in range(num_gate)]
card = [1, num_card]
for gate in input:
card[0] = max(card[0], gate[0])
card[1] = min(card[1], gate[1])
print((max(card[1] - card[0] + 1, 0)))
if __name__ == "__main__":
main()
| p03037 |
n, m = list(map(int, input().split()))
d = [0]*(10**5)
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l-1, r):
d[i] += 1
ans = 0
for i in d:
if i == m:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
for _ in range(1, m):
l_, r_ = list(map(int, input().split()))
l = max(l, l_)
r = min(r, r_)
if r-l<0:
print((0))
else:
print((r-l+1)) | p03037 |
n,m = list(map(int,input().split()))
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((len(ans)))
| n,m = list(map(int,input().split()))
la = 0
ra = n
for i in range(m):
l,r=list(map(int,input().split()))
la = max(la,l)
ra = min(ra,r)
print((max(0,ra-la+1)))
| p03037 |
(n, m) = list(map(int, input().split()))
counts = [0 for _ in range(n)]
for _ in range(m):
gate_i = list(map(int, input().split()))
for i in range(gate_i[0] - 1, gate_i[1]):
counts[i] += 1
counts.sort()
ans = 0
for count in counts:
ans += 1 if m == count else 0
print(ans)
| (n, m) = list(map(int, input().split()))
def intersect(lhs, rhs):
if lhs[1] < rhs[0] or rhs[1] < lhs[0]:
return [0, 0]
min_value = lhs[0] if lhs[0] > rhs[0] else rhs[0]
max_value = lhs[1] if lhs[1] < rhs[1] else rhs[1]
return [min_value, max_value]
ans = [-1, 2 * 10 ** 5]
for _ in range(m):
ans = intersect(ans, list(map(int, input().split())))
if 0 == ans[0] and 0 == ans[1]:
print((0))
exit(0)
print((ans[1] - ans[0] + 1))
| p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
hoge = set(list(range(L, R+1)))
for i in range(1, M):
L, R = list(map(int, input().split()))
hoge = hoge & set(list(range(L, R+1)))
print((len(hoge)))
| N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
for i in range(1, M):
hoge, fuga = list(map(int, input().split()))
L = max(L, hoge)
R = min(R, fuga)
if L > R:
print((0))
else:
print((R-L+1))
| p03037 |
N, M = list(map(int, input().split()))
imos = [0]*(N+1)
for _ in range(M):
# ゲートの情報が入ってくる
l, r = [int(x)-1 for x in input().split()]
imos[l] += 1
imos[r+1] -= 1 # rまでは有効であり、r+1以降が無向になる仕様であるのでr+1をデクリメントする
cumulative = [imos[0]]
for value in imos[1:]:
cumulative.append(cumulative[-1]+value)
ans = 0
for c in cumulative:
if c == M:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
left = -1
right = 10**10
for _ in range(M):
l, r = list(map(int, input().split()))
left = max(left, l)
right = min(right, r)
print((max(right-left+1, 0)))
| p03037 |
n, m = list(map(int, input().split()))
gates = []
for _ in range(m):
gates.append(tuple(map(int, input().split())))
gates.sort(key=lambda x: (x[0], x[1]), reverse=True)
count = 0
for i in range(1, n+1):
for gate in gates:
if i < gate[0] or gate[1] < i :
break
else:
count += 1
print(count)
| n, m = list(map(int, input().split()))
gates = []
start, end = 1, n
for _ in range(m):
L, R = list(map(int, input().split()))
if L > start:
start = L
if R < end:
end = R
print((len(list(range(start, end+1))))) | p03037 |
n,m=list(map(int,input().split(" ")))
l_init,r_init=list(map(int,input().split(" ")))
ans=list(range(l_init,r_init+1))
for i in range(m-1):
l,r=list(map(int,input().split(" ")))
ans=list(set(ans)&set(range(l,r+1)))
if len(ans)>n:
print(n)
else:
print((len(ans))) | n,m=list(map(int,input().split(" ")))
l_init,r_init=list(map(int,input().split(" ")))
ans_l=l_init
ans_r=r_init
isPossible=True
for i in range(m-1):
l,r=list(map(int,input().split(" ")))
isupdated=False
next_ans_l=ans_l
next_ans_r=ans_r
if ans_l <= l and l <= ans_r:
next_ans_l=l
isupdated=True
if ans_l <= r and r <= ans_r:
next_ans_r=r
isupdated=True
if l <= ans_l and ans_r <= r:
isupdated=True
if not isupdated:
isPossible=False
break
ans_l=next_ans_l
ans_r=next_ans_r
ans=ans_r-ans_l
if isPossible:
print((ans+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
data=[list(map(int,input().split())) for i in range(m)]
import sys
input = lambda: sys.stdin.readline()[:-1]
l,r=0,10**6
for i,j in data:
l=max(l,i)
r=min(r,j)
print((max(0,r-l+1)))
| #!/usr/bin/env python3
import sys
input = lambda: sys.stdin.readline()[:-1]
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7
n, m = list(map(int, input().split()))
data = [list(map(int, input().split())) for i in range(m)]
l, r = 0, 10**6
for i, j in data:
l = max(l, i)
r = min(r, j)
print((max(0, r-l+1)))
| p03037 |
#!/usr/bin/env python3
import sys
input = lambda: sys.stdin.readline()[:-1]
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7
n, m = list(map(int, input().split()))
data = [list(map(int, input().split())) for i in range(m)]
l, r = 0, 10**6
for i, j in data:
l = max(l, i)
r = min(r, j)
print((max(0, r-l+1)))
| #!/usr/bin/env python3
import sys
input = lambda: sys.stdin.buffer.readline()[:-1]
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7
n, m = list(map(int, input().split()))
data = [list(map(int, input().split())) for i in range(m)]
l, r = 0, 10**6
for i, j in data:
l = max(l, i)
r = min(r, j)
print((max(0, r-l+1)))
| p03037 |
from sys import stdin
def fetch_one_line():
return stdin.readline().rstrip()
def fetch_int_input():
return [int(s) for s in fetch_one_line().split()]
def fetch_inputs(times):
return [fetch_one_line() for _ in range(times)]
def fetch_int_inputs(times):
return [fetch_int_input() for _ in range(times)]
N, M = fetch_int_input()
gate_len = fetch_int_inputs(M)
range_card = [[False] * N for _ in range(M)]
for gl, rc in zip(gate_len, range_card):
l = gl[0] - 1
r = gl[1] - 1
rc[l: r + 1] = [True] * (r - l + 1)
range_card = list(zip(*range_card))
print((sum([all(r) for r in range_card])))
| from sys import stdin
def fetch_one_line():
return stdin.readline().rstrip()
def fetch_int_input():
return [int(s) for s in fetch_one_line().split()]
def fetch_inputs(times):
return [fetch_one_line() for _ in range(times)]
def fetch_int_inputs(times):
return [fetch_int_input() for _ in range(times)]
N, M = fetch_int_input()
gate_len = fetch_int_inputs(M)
# range_card = [[False] * N for _ in range(M)]
l, r = 0, N
for gl in gate_len:
if l < gl[0]:
l = gl[0]
if r > gl[1]:
r = gl[1]
# range_card = list(zip(*range_card))
# print(sum([all(r) for r in range_card]))
result = r - l + 1
if result < 0: result = 0
print(result)
| p03037 |
n, m = list(map(int, input().split()))
num = [list(map(int, input().split())) for _ in range(m)]
count = 0
for i in range(1, n+1):
ans = 0
for j in range(m):
if i >= num[j][0] and i <= num[j][1]:
ans += 1
else:
break
if ans == m:
count += 1
print(count) | n, m = list(map(int, input().split()))
num = [list(map(int, input().split())) for _ in range(m)]
num1 = 1
num2 = n
for j in range(m):
num1 = max(num[j][0], num1)
num2 = min(num[j][1], num2)
ans = num2 - num1 + 1
if ans > 0:
print(ans)
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
gate = [True for i in range(N+1)]
for i in range(M):
r, m = list(map(int, input().split()))
gate[:r] = [False] * r
gate[m+1:] = [False] * (N-m+1)
print((sum(gate))) | N, M = list(map(int, input().split()))
l = 1
r = 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 = 1
r = 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))) | 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()))
count = [0]*(n+1)
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
count[j] += 1
print((count.count(m))) | N, M = list(map(int, input().split()))
l, r = -1, N+1
for _ in range(M):
L, R = list(map(int, input().split()))
l = max(l, L)
r = min(r, R)
ans = max(0, r-l+1)
print(ans) | p03037 |
N,M = list(map(int, input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
gate_list = []
ans = set(range(LR[0][0], LR[0][1]+1))
for i in range(M):
gate_list = set(range(LR[i][0], LR[i][1]+1))
ans = gate_list & ans
print((len(ans))) | N,M = list(map(int, input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
sta = [LR[i][0] for i in range(M)]
gol = [LR[i][1] for i in range(M)]
ans = min(gol) -max(sta)
print((ans+1 if ans >= 0 else 0)) | p03037 |
import collections
n,m = list(map(int, input().split()))
cnt = [0 for _ in range(n)]
for i in range(m):
l,r = list(map(int, input().split()))
for i in range(l-1, r):
cnt[i] += 1
c = collections.Counter(cnt)
print((c[m])) | n,m = list(map(int, input().split()))
minn, maxn = 1, n
for i in range(m):
l, r = list(map(int,input().split()))
minn, maxn = max(minn, l), min(maxn, r)
print((max(maxn-minn+1, 0))) | p03037 |
N, M = list(map(int, input().split()))
gates = []
res = 0
for _ in range(M):
L, R = list(map(int, input().split()))
gates.append((L, R))
for i in range(1, N+1):
flag = True
for g in gates:
if g[0] <= i <= g[1]:
continue
else:
flag = False
break
if flag: res+=1
print(res) | N, M = list(map(int, input().split()))
res = 0
L_max = 0
R_min = 100000
for _ in range(M):
L, R = list(map(int, input().split()))
if L_max < L: L_max = L
if R < R_min: R_min = R
print((max(0, (R_min - L_max + 1)))) | p03037 |
n,m=list(map(int,input().split()))
l=[]
h=[]
count=0
for i in range(m):
a,b=list(map(int,input().split()))
l.append(a)
h.append(b)
for i in range(n):
judge=True
for j in range(m):
#if not (((i+1) >= l[j]) and ((i+1) <= h[j])):
if not ((i+1) >= l[j] and (i+1) <= h[j]):
judge^=True
break
if judge:
count+=1
print(count) | n,m=list(map(int,input().split()))
l=[]
h=[]
count=0
for i in range(m):
a,b=list(map(int,input().split()))
l.append(a)
h.append(b)
l_max=max(l)
h_min=min(h)
if (h_min-l_max)<0:
print((0))
else:
print((h_min-l_max+1))
| p03037 |
N, M = list(map(int, input().split()))
idcard = [[int(j) for j in input().split()] for i in range(M)]
ans = {}
if M == 1:
print((idcard[0][1] - idcard[0][0] + 1))
exit()
t = 0
for i in idcard:
for j in range(i[0], i[1] + 1):
if j in ans:
ans[j] += 1
else:
ans[j] = 1
t = max(ans.values())
w = 0
for i in list(ans.values()):
if i == t:
w += 1
print(w) | N, M = list(map(int, input().split()))
idcard = [[int(j) for j in input().split()] for i in range(M)]
L = 0
R = 10**10
for i in idcard:
L = max(L, i[0])
R = min(R, i[1])
if R >= L:
print((R - L + 1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
L = [0 for _ in range(M)]
R = [0 for _ in range(M)]
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
cards = list(range(N + 1))
u = set(cards[L[0]:R[0] + 1])
for i in range(1, M):
u = u & set(cards[L[i]:R[i] + 1])
print((len(u))) | N, M = list(map(int, input().split()))
L = [0 for _ in range(M)]
R = [0 for _ in range(M)]
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
l = max(L)
r = min(R)
print((r - l + 1 if l <= r else 0)) | p03037 |
n,m,*t=list(map(int,open(0).read().split()));a,c=[0]*-~n,0
for l,r in zip(t[::2],t[1::2]):a[l-1]+=1;a[r]-=1
for i in range(n):a[i+1]+=a[i];c+=a[i]==m
print(c) | n,m,*t=list(map(int,open(0).read().split()));print((max(0,min(t[1::2])-max(t[::2])+1))) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
tmp_l = [i for i in range(l, r + 1)]
tmp_set = set(tmp_l)
for _ in range(m - 1):
l, r = list(map(int, input().split()))
tmp_l = [i for i in range(l, r + 1)]
tmp_set = tmp_set.intersection(set(tmp_l))
print((len(tmp_set))) | n, m = list(map(int, input().split()))
l_lst = [0] * m
r_lst = [0] * m
for i in range(m):
l, r = list(map(int, input().split()))
l_lst[i] = l
r_lst[i] = r
if max(l_lst) <= min(r_lst):
print((min(r_lst) - max(l_lst) + 1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
l, r = list(map(int, input().split()))
cards = list(range(l, r+1))
for i in range(1, M):
l, r = list(map(int, input().split()))
cards_new = list(range(l, r+1))
cards = set(cards) & set(cards_new)
print((len(cards))) | N, M = list(map(int, input().split()))
l_max, r_min = 0, 100000000
for i in range(0, M):
l, r = list(map(int, input().split()))
if l > l_max:
l_max = l
if r < r_min:
r_min = r
print((max(0, r_min-l_max+1))) | p03037 |
def resolve():
n, m = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(m)]
ans = set(range(lst[0][0], lst[0][1] + 1))
for l in lst[1:]:
ans = ans.intersection(set(range(l[0], l[1] + 1)))
print((len(ans)))
resolve()
| def resolve():
n, m = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(m)]
prev = lst[0]
for new in lst[1:]:
prev = [max(prev[0], new[0]), min(prev[1], new[1])]
print((len(list(range(prev[0], prev[1]+1)))))
resolve() | p03037 |
import math
def main():
n, m = [int(x) for x in input().split(" ")]
gates = []
mi = n
ma = 0
for x in range(m):
l, r = [int(x) for x in input().split(" ")]
gates.append((l, r))
for gate in gates:
# print(gate)
if ma <= gate[0]:
ma = gate[0]
if mi >= gate[1]:
mi = gate[1]
res = 0
if mi < ma:
res = 0
else:
res = mi - ma + 1
print(res)
if __name__ == "__main__":
main() | import math
def main():
n, m = [int(x) for x in input().split(" ")]
gates = []
mi = n
ma = 0
for x in range(m):
l, r = [int(x) for x in input().split(" ")]
gates.append((l, r))
mi = gates[0][1]
ma = gates[0][0]
for gate in gates:
# print(gate)
if ma <= gate[0]:
ma = gate[0]
if mi >= gate[1]:
mi = gate[1]
res = 0
if mi < ma:
res = 0
else:
res = mi - ma + 1
print(res)
if __name__ == "__main__":
main() | p03037 |
N, M = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(M)]
print((len(set.intersection(*[set(range(l, r+1)) for l, r in LR]))))
| N, M = list(map(int, input().split()))
LR = list(list(map(int, input().split())) for _ in range(M))
L, R = list(map(list, list(zip(*LR))))
print((max(0, min(R)-max(L)+1))) | p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.