input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def i_input(): return int(eval(input()))
def s_input(): return list(map(int,input().split()))
def l_input(): return list(map(int, input().split()))
N, M = s_input()
L, R = [], []
cards = []
for i in range(M):
Li, Ri = s_input()
L.extend([Li])
R.extend([Ri])
cards.extend(list(range(Li, Ri+1)))
cards = set(cards)
ng_cards = set()
for card in cards:
for i in range(M):
if card < L[i] or card > R[i]:
ng_cards.add(card)
break
print((len(cards - ng_cards)))
| def i_input(): return int(eval(input()))
def s_input(): return list(map(int,input().split()))
def l_input(): return list(map(int, input().split()))
N, M = s_input()
L, R = [], []
for i in range(M):
Li, Ri = s_input()
L.extend([Li])
R.extend([Ri])
L_max = max(L)
R_min = min(R)
num = R_min - L_max
if num >= 0:
print((num + 1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(m)]
if len(a) == 1:
print((a[0][1] - a[0][0] + 1))
else:
ans = n
for i in range(1, n + 1):
for j in range(m):
if a[j][0] <= i <= a[j][1]:
continue
else:
ans -= 1
break
print(ans)
| n, m = list(map(int, input().split()))
left = []
right = []
for i in range(m):
a, b = list(map(int, input().split()))
left.append(a)
right.append(b)
if min(right) >= max(left):
print((min(right) - max(left) + 1))
else:
print((0))
| p03037 |
N,M=list(map(int,input().split()))
A=[]
for I in range(M):
x,y=list(map(int,input().split()))
A.append(list(range(x,y+1)))
F=set(A[0]).intersection(*A[1:])
print((len(F))) | 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+1)
F=list(range(max(L),min(R)))
print((len(F))) | p03037 |
N, M = list(map(int, input().split()))
L_R = [list(map(int, input().split())) for i in range(M)]
L = [L_R[i][0] for i in range(M)]
R = [L_R[i][1] for i in range(M)]
ans = [j+1 for j in range(N)]
for i in range(M):
ans = [ans[j] for j in range(len(ans)) if L[i] <= ans[j] and ans[j] <= R[i]]
print((len(ans))) | N, M = list(map(int, input().split()))
L_R = [list(map(int, input().split())) for i in range(M)]
L = [L_R[i][0] for i in range(M)]
R = [L_R[i][1] for i in range(M)]
L_max = max(L)
R_min = min(R)
if L_max <= R_min:
ans = R_min - L_max + 1
else:
ans = 0
print(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 t in range(L-1,R):
A[t]+=1
cnt=A.count(M)
print(cnt) | 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)
big=min(r)
small=max(l)
print((big-small+1 if big-small>=0 else 0)) | p03037 |
N,M=list(map(int,input().split()))
cards=[1]*N
for i in range(M):
l,r=list(map(int,input().split()))
if l!=1:
cards[:l-1]=[0]*(l-1)
if r!=N:
cards[r:]=[0]*(N-r)
print((sum(cards))) | N,M=list(map(int,input().split()))
cards_l=1
cards_r=N
for i in range(M):
l,r=list(map(int,input().split()))
cards_l=max(cards_l,l)
cards_r=min(cards_r,r)
#print(r,cards_r)
print((max(0,cards_r-cards_l+1))) | p03037 |
N, M = list(map(int, input().split()))
haba = list()
max_L = 0
min_R = 10 ** 5 + 1
for i in range(M):
L, R = list(map(int, input().split()))
haba.append([L, R])
max_L = max(max_L, L)
min_R = min(min_R, R)
min_haba = set(range(max_L, min_R + 1))
ids = set()
for L, M in haba:
h = set(range(L, R + 1))
ids = ids.union(h.intersection(min_haba))
print((len(ids))) | N, M = list(map(int, input().split()))
haba = list()
max_L = 0
min_R = 10 ** 5 + 1
for i in range(M):
L, R = list(map(int, input().split()))
haba.append([L, R])
max_L = max(max_L, L)
min_R = min(min_R, R)
print((max(min_R + 1 - max_L, 0))) | p03037 |
N,M=[int(x) for x in input().rstrip().split()]
l=[]
for i in range(M):
b=input().rstrip().split()
l.append(b)
count=0
ans=0
for i in range(1,N+1):
for x,y in l:
if int(x)<=i and i<=int(y):
count+=1
else:
break
if count==M:
ans+=1
count=0
print(ans)
| N,M=[int(x) for x in input().rstrip().split()]
l=[]
r=[]
for i in range(M):
b=input().rstrip().split()
l.append(int(b[0]))
r.append(int(b[1]))
L=max(l)
R=min(r)
if R<L:
print((0))
else:
print((R-L+1))
| p03037 |
n,m=list(map(int,input().split()))
lr=[list(map(int,input().split())) for _ in range(m)]
card=[0]*n
for i in range(m):
l,r=lr[i]
for j in range(l-1,r):
card[j]+=1
print((card.count(m))) | n,m=list(map(int,input().split()))
l=1
r=n
for i in range(m):
ll,rr = list(map(int,input().split()))
l=max(l,ll)
r=min(r,rr)
if l<=r:
print((r-l+1))
else:
print((0)) | p03037 |
n,m = list(map(int, input().split()))
s = {_ for _ in range(1,n+1)}
for i in range(m):
l,r = list(map(int, input().split()))
s &= {_ for _ in range(l,r+1)}
print((len(s))) | n,m = list(map(int, input().split()))
left = set()
right = set()
for i in range(m):
l,r = list(map(int, input().split()))
left.add(l)
right.add(r)
mini = max(left)
maxi = min(right)
print((len(list(range(mini,maxi+1))))) | p03037 |
n,m = (int(x) for x in input().split())
l = [0]*m
r = [0]*m
hoge = [m]*n
for i in range(m):
l[i],r[i] = (int(x) for x in input().split())
for i in range(m):
for f in range(l[i]-1,r[i]):
hoge[f] -= 1
count = 0
for j in hoge:
if j == 0:
count+= 1
print(count)
| n, m = (int(x) for x in input().split())
l = [0]*m
r = [0]*m
for i in range(m):
l[i], r[i] = [int(x) for x in input().split()]
lmax = max(l)
rmin = min(r)
if rmin >= lmax:
print((rmin-lmax+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
a=[0]*n
for i in range(m):
l,r=list(map(int,input().split()))
for k in range(l-1,r):
a[k]+=1
ans=0
for i in range(n):
if a[i]==m:
ans+=1
print(ans) | n,m=list(map(int,input().split()))
low=1
high=n
for i in range(m):
l,r=list(map(int,input().split()))
if l>low:
low=l
if r<high:
high=r
if high>=low:
print((high-low+1))
else:
print((0)) | p03037 |
from sys import stdin
n, m = list(map(int, stdin.readline().split()))
ans = set(range(1, n+1))
for i in range(m):
l, r = list(map(int, stdin.readline().split()))
ans = list([x for x in ans if l<=x<=r])
print((len(ans))) | from sys import stdin
n, m = list(map(int, stdin.readline().split()))
mn = 1
mx = n
for i in range(m):
l, r = list(map(int, stdin.readline().split()))
mn = max(mn, l)
mx = min(mx, r)
print((max(0, mx-mn+1))) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
result = 0
for i in range(1, N+1):
for j in range(M):
if not(L[j] <= i <= R[j]):
break
if j == M-1:
result += 1
print(result) | 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()))
result = min(R) - max(L) + 1
if result > 0:
print(result)
else:
print('0') | 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):
if max(L) <= i+1 <= min(R):
ans += 1
print(ans) | N, M = list(map(int, input().split()))
L = []
R = []
ans = 0
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
L_max = max(L)
L_min = min(R)
for i in range(N):
if L_max <= i+1 <= L_min:
ans += 1
print(ans) | p03037 |
import math
s = input().split()
n=int(s[0])
m=int(s[1])
d={}
for i in range(1,n+1):d[i]=0
for i in range(m):
s = list(map(int,input().split()))
for j in range(s[0],s[1]+1):
d[j]+=1
print((list(d.values()).count(m)))
| import math
s = input().split()
n=int(s[0])
m=int(s[1])
l=0
r=float('inf')
for i in range(m):
s = list(map(int,input().split()))
l=max(l,s[0])
r=min(r,s[1])
a=r-l
if a>=0:
print((a+1))
else:
print((0))
| p03037 |
import sys
N, M = list(map(int, sys.stdin.readline().split()))
L = []
R = []
for i in range(M):
temp_l, temp_r = list(map(int, sys.stdin.readline().split()))
L.append(temp_l)
R.append(temp_r)
master_list = list(range(1, N+1))
master_set = set(master_list)
ans = master_set
for i in range(M):
current_set = set(list(range(L[i], R[i]+1)))
ans = ans & current_set
print((len(ans))) | import sys
N, M = list(map(int, sys.stdin.readline().split()))
L = []
R = []
for i in range(M):
temp_l, temp_r = list(map(int, sys.stdin.readline().split()))
L.append(temp_l)
R.append(temp_r)
temp = min(R) - max(L) + 1
if temp > 0:
print(temp)
else:
print((0))
| p03037 |
from collections import Counter
n,m = list(map(int, input().split()))
lr = []
for i in range(m):
l,r = list(map(int, input().split()))
lr += list(range(l,r+1))
lr = Counter(lr).most_common()
num = 0
for h in range(len(lr)):
if lr[h][1] == m:
num += 1
else:
break
print(num) | n,m = list(map(int, input().split()))
lr = []
for i in range(m):
l,r = list(map(int, input().split()))
lr.append((l,r))
num = 0
for h in range(1,n+1):
t = 0
for j in lr:
if j[0] <= h <= j[1]:
t += 1
else:
break
if t == m:
num += 1
print(num) | p03037 |
n,m = list(map(int, input().split()))
lr = []
for i in range(m):
l,r = list(map(int, input().split()))
lr.append((l,r))
num = 0
for h in range(1,n+1):
t = 0
for j in lr:
if j[0] <= h <= j[1]:
t += 1
else:
break
if t == m:
num += 1
print(num) | n,m = list(map(int, input().split()))
mini = 0
maxi = 10**9
for i in range(m):
l,r = list(map(int, input().split()))
if mini < l:
mini = l
if r < maxi:
maxi = r
t = maxi -mini + 1
if maxi < mini:
print((0))
else:
print(t) | p03037 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
_, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ans = [i for i in range(l, r+1)]
for _ in range(m-1):
l, r = list(map(int, input().split()))
ans = [i for i in ans if l <= i <= r]
print((len(ans)))
if __name__ == '__main__':
main()
| import sys
def input(): return sys.stdin.readline().rstrip()
def main():
_, m = list(map(int, input().split()))
max = -1
min = 10 ** 5 + 1
for _ in range(m):
l, r = list(map(int, input().split()))
if l > max:
max = l
if r < min:
min = r
if min - max < 0:
print((0))
else:
print((min - max + 1))
if __name__ == '__main__':
main()
| p03037 |
N,M = list(map(int,input().split()))
a,b = list(map(int, input().split()))
former_set = { i for i in range(a,b+1)}
for i in range(M-1):
a,b = list(map(int, input().split()))
tmp_set = { i for i in range(a,b+1)}
former_set = tmp_set & former_set
print((len(former_set))) | N,M = list(map(int,input().split()))
a = list()
b = list()
for i in range(M):
tmp_a,tmp_b = list(map(int, input().split()))
a.append(tmp_a)
b.append(tmp_b)
print((min(b)-max(a)+1 if min(b)-max(a) >= 0 else 0)) | p03037 |
import sys
nm = input().split()
n = int(nm[0])
m = int(nm[1])
lr = [input().split() for i in range(m)]
l = [int(lr[i][0]) for i in range(m)]
r = [int(lr[i][1]) for i in range(m)]
card = [i for i in range(n + 1)]
if m == 1:
print((len(card[l[0]:r[0]]) + 1))
sys.exit()
card2 = []
card_duplicate = []
for i in range(m):
#card2 = card_duplicate
card2.extend(card[l[i]-1:r[i]])
card_duplicate = [x for x in set(card2) if card2.count(x) == m]
print((len(card_duplicate))) | nm = input().split()
n = int(nm[0])
m = int(nm[1])
lr = [input().split() for i in range(m)]
l = [int(lr[i][0]) for i in range(m)]
r = [int(lr[i][1]) for i in range(m)]
a = min(r) -max(l) + 1
if a >= 0:
print(a)
else:
print((0)) | p03037 |
n, m = [int(x) for x in input().split()]
lst = []
for _ in range(m):
l, r = [int(x) for x in input().split()]
lst.append(set(range(l, r+1)))
uni = lst[0].intersection(*lst[1:])
print((len(uni))) | n, m = [int(x) for x in input().split()]
l_lst = []
r_lst = []
for _ in range(m):
l, r = [int(x) for x in input().split()]
l_lst.append(l)
r_lst.append(r)
l_max = max(l_lst)
r_min = min(r_lst)
if l_max <= r_min:
num = r_min - l_max + 1
else:
num = 0
print(num) | p03037 |
# 2019-11-13 08:30:54(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np
def main():
n, m = [int(x) for x in sys.stdin.readline().split()]
l, r = [], []
for _ in range(m):
li, ri = [int(x) for x in sys.stdin.readline().split()]
l.append(li)
r.append(ri)
all_mighty_cards = set(range(1,n+1))
for i in range(m):
all_mighty_cards &= set(l[i:] + r[:i+1])
print((max(all_mighty_cards) - min(all_mighty_cards) + 1 if all_mighty_cards else 0))
if __name__ == "__main__":
main()
| # 2019-11-13 08:30:54(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np
def main():
n, m = [int(x) for x in sys.stdin.readline().split()]
l, r = [], []
for _ in range(m):
li, ri = [int(x) for x in sys.stdin.readline().split()]
l.append(li)
r.append(ri)
print((min(r) - max(l) + 1 if min(r) >= max(l) else 0))
if __name__ == "__main__":
main()
| p03037 |
import sys
n, m, *lr = list(map(int, sys.stdin.read().split()))
lr = list(zip(*[iter(lr)] * 2))
def main():
cnt = [0] * (n + 1)
for l, r in lr:
cnt[l-1] += 1
cnt[r] -= 1
for i in range(n):
cnt[i+1] += cnt[i]
res = 0
for i in range(n):
res += (cnt[i] == m) & 1
return res
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, m, *lr = list(map(int, sys.stdin.read().split()))
l, r = lr[::2], lr[1::2]
def main():
ans = max(min(r) - max(l) + 1, 0)
return ans
if __name__ == '__main__':
ans = main()
print(ans) | p03037 |
N,M = [int(i) for i in input().split()]
L=[]
R=[]
for n in range(M):
temp = [int(i) for i in input().split()]
L.append(temp[0])
R.append(temp[1])
init_set = set(range(L[0],R[0]+1))
for n in range(M-1):
now_set = set(range(L[n+1],R[n+1]+1))
init_set = (init_set & now_set)
print((len(init_set))) | N,M = [int(i) for i in input().split()]
L_max ,R_min = [int(i) for i in input().split()]
for _ in range(M-1):
temp = [int(i) for i in input().split()]
if L_max < temp[0]:
L_max = temp[0]
if R_min > temp[1]:
R_min = temp[1]
print((max(R_min - L_max + 1,0))) | 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.append(a)
r.append(b)
ans = 0
for j in range(n):
flag = 1
for k in range(m):
if j < l[k]-1 or j > r[k]-1:
flag = 0
break
if flag == 1:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
l = list()
r = list()
for i in range(m):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
if min(r) >= max(l):
print((min(r) - max(l) + 1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
s=0
for i in range(m):
l,r=list(map(int,input().split()))
temp=list(range(l,r+1))
if i==0:
s=set(temp)
else:
s&=set(temp)
print((len(s)))
| n,m=list(map(int,input().split()))
li=[list(map(int,input().split())) for i in range(m)]
maxl=0
minr=1000000
for i in range(m):
maxl=max(li[i][0],maxl)
minr=min(minr, li[i][1])
if maxl<=minr:
print((minr-maxl+1))
else:
print((0)) | p03037 |
n,m=list(map(int,input().split()))
l=[]
for _ in range(m):
l.append(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(m):
for j in range(l[i][0],l[i][1]+1):
d[j]+=1
print((d.count(m)))
| n,m=list(map(int,input().split()))
l=0;r=10**6
for i in range(m):
ln,rn=list(map(int,input().split()))
l=max(l,ln);r=min(r,rn)
if l>r:
print((0))
else:
print((r-l+1)) | p03037 |
n,m = list(map(int, input().split()))
ans = 0
for i in range(m):
l,r = list(map(int, input().split()))
tmp = set(range(l,r+1))
if i == 0:
ans = tmp
else:
ans = ans & tmp
print((len(ans))) | n,m = list(map(int, input().split()))
ans = 0
L = -100000000
R = 100000000
for i in range(m):
l,r = list(map(int, input().split()))
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()))
id = set(i for i in range(1, n + 1))
for i in range(m):
l, r = list(map(int, input().split()))
check = set(i for i in range(l, r + 1))
id = id & check
print((len(id))) | n, m = list(map(int, input().split()))
id = set(i for i in range(1, n + 1))
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()))
L, R = [0]*M, [0]*M
for i in range(M):
L[i],R[i] = list(map(int, input().split()))
cnt = 0
LR = list(zip(L,R))
res = set(range(1,N+1))
for l,r in LR:
res &= set(range(l,r+1))
print((len(res))) | N, M = list(map(int, input().split()))
L, R = [0]*M, [0]*M
for i in range(M):
L[i],R[i] = list(map(int, input().split()))
a, b = max(L), min(R)
if a<=b:
print((b-a+1))
else:
print((0)) | p03037 |
def two_input():
return list(map(int, input().split()))
N, M = two_input()
LR = [list(two_input()) for i in range(M)]
cnt = 0
for i in range(1, N+1):
cnt += 1
for j in range(M):
if LR[j][0] > i or LR[j][1] < i:
cnt -= 1
break
print(cnt) | def two_input():
return list(map(int, input().split()))
N, M = two_input()
L, R = [], []
for i in range(M):
l, r = two_input()
L.append(l)
R.append(r)
maxl = max(L)
minr = min(R)
ans = 0
for i in range(N):
if maxl <= i+1 <= minr:
ans += 1
print(ans) | p03037 |
n, m = list(map(int, input().split()))
row1 = list(map(int, input().split()))
lis = list(range(row1[0], row1[1]+1))
#print(lis)
for i in range(m-1):
rowi = list(map(int, input().split()))
rowi = list(range(rowi[0], rowi[1]+1))
newlis = []
for j in lis:
#print(j)
if j in rowi:
newlis.append(j)
#print(newlis)
lis = newlis
print((len(lis))) | n, m = list(map(int, input().split()))
low =[]
high=[]
for i in range(m):
temp = list(map(int, input().split()))
low.append(temp[0])
high.append(temp[1])
maxlow= max(low)
minhigh=min(high)
if minhigh-maxlow >= 0:
print((minhigh-maxlow+1))
else:
print((0)) | p03037 |
from collections import Counter
N, M = list(map(int, input().split()))
range_dict = Counter()
for _ in range(M):
l, r = list(map(int, input().split()))
for i in range(l, r+1):
range_dict[i] += 1
print((len([v for k, v in range_dict.most_common() if v==M])))
| from collections import Counter
N, M = list(map(int, input().split()))
max_l = 1
min_r = N
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
print((min_r - max_l + 1 if min_r - max_l >= 0 else 0))
| p03037 |
# input
N, M = list(map(int, input().split()))
check = []
c_append = check.append
for i in range(1, M + 1):
L, R = list(map(int, input().split()))
c = set(list(range(L, R + 1)))
if c not in check:
c_append(c)
# check
mastar_keys = set(list(range(1, N + 1)))
for c in sorted(check, key=lambda x: len(x)):
mastar_keys = mastar_keys & c
if len(mastar_keys) == 0:
break
print((len(mastar_keys))) | # input
N, M = list(map(int, input().split()))
mastar_keys = set(list(range(1, N + 1)))
check = []
c_append = check.append
for i in range(1, M + 1):
L, R = list(map(int, input().split()))
c = set(list(range(L, R + 1)))
mastar_keys = mastar_keys & c
print((len(mastar_keys)))
| p03037 |
# input
N, M = list(map(int, input().split()))
mastar_keys = set(list(range(1, N + 1)))
check = []
c_append = check.append
for i in range(1, M + 1):
L, R = list(map(int, input().split()))
c = set(list(range(L, R + 1)))
mastar_keys = mastar_keys & c
print((len(mastar_keys)))
| # input & check
N, M = list(map(int, input().split()))
x, y = 0, N
for i in range(1, M + 1):
L, R = list(map(int, input().split()))
x = max(x, L)
y = min(y, R)
print((len(list(range(x, y + 1))))) | p03037 |
n,m = list(map(int,input().split()))
l = list(list(map(int,input().split())) for _ in range (m))
p = set(i for i in range(1,n+1))
for i in l:
s,t = i
a = set(q for q in range(s,t+1))
p = p&a
print((len(p))) | n,m = list(map(int,input().split()))
l = list(list(map(int,input().split())) for _ in range (m))
a = l[0][0]
b = l[0][1]
for s,t in l:
a = max(a,s)
b = min(b,t)
print((max(b-a+1,0)))
| p03037 |
# -*- Coding: utf-8 -*-
N,M = list(map(int,input().split()))
list_in = []
for i in range(M):
list_in.append(list(map(int,input().split())))
count = 0
for i in range(N):
flag = 0
for j in range(M):
if ((i+1)<list_in[j][0]) | ((i+1)>list_in[j][1]):
flag = 1
break
if flag==1:
flag = 0
else:
count += 1
print(count) | # -*- Coding: utf-8 -*-
N,M = list(map(int,input().split()))
L = 0
R = N
for i in range(M):
li,ri = list(map(int,input().split()))
L = max(L,li)
R = min(R,ri)
print(max(0,R-L+1)) | p03037 |
n,m = list(map(int,input().split()))
tmp = set()
for val in range(m):
l,r = list(map(int,input().split()))
tmp = set(list(range(l,r+1)))
if val ==0:
seki = tmp
else:
seki = seki & tmp
print((len(list(seki))))
| n,m = list(map(int,input().split()))
l_L,r_L = [],[]
for val in range(m):
l,r = list(map(int,input().split()))
l_L.append(l)
r_L.append(r)
r = min(r_L)
l = max(l_L)
if r-l >= 0:
print((r-l+1))
else:
print((0))
| p03037 |
def main():
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)
key_set = {i for i in range(L[0], R[0]+1)}
for i in range(1, M):
key_set = key_set & {i for i in range(L[i], R[i]+1)}
print((len(key_set)))
if __name__ == '__main__':
main() | N, M = list(map(int, input().split()))
L, R = [], []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
ans = min(R) - max(L) + 1
if ans >= 0:
print(ans)
else:
print((0))
| p03037 |
n,m = list(map(int,input().split()))
ans = [0 for _ in range(n)]
for i in range(m):
l,r = list(map(int,input().split()))
l-=1;r-=1
for j in range(l,r+1):
ans[j] += 1
print((ans.count(m))) | n,m = list(map(int,input().split()))
ans = [i+1 for i in range(n+1)]
l = []
r = []
for i in range(m):
l1,r1 = list(map(int,input().split()))
l.append(l1)
r.append(r1)
left = max(l)
right = min(r)
print((len(ans[left:right+1]))) | p03037 |
N, M = list(map(int, input().split()))
cards = [0 for x in range(N)]
sum = 0
for x in range(M):
l, m = list(map(int, input().split()))
for y in range(l - 1, m):
cards[y] = cards[y] + 1
if x == M - 1 and cards[y] == M:
sum = sum + 1
print(sum) | N, M = list(map(int, input().split()))
maxL = 0
minM = N
for x in range(M):
l, m = list(map(int, input().split()))
maxL = max(maxL, l)
minM = min(minM, m)
print((max(minM - maxL + 1, 0))) | p03037 |
N, M = list(map(int,input().split()))
cards = [1 for i in range(N)]
for i in range(M):
L, R = list(map(int,input().split()))
for i in range(0,L-1):
cards[i] = 0
for i in range(R,N):
cards[i] = 0
print((sum(cards)))
| N, M = list(map(int,input().split()))
minL = 1
maxR = N
for i in range(M):
L, R = list(map(int,input().split()))
if L > minL:
minL = L
if R < maxR:
maxR = R
if maxR-minL+1 > 0:
print((maxR-minL+1))
else:
print((0))
| p03037 |
N,M=list(map(int,input().split()))
L=[]
R=[]
for _ in range(M):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
L.sort()
R.sort()
print((0 if R[0]<L[-1] else R[0]-L[-1]+1)) | N,M=list(map(int,input().split()))
L=0
R=10**9
for _ in range(M):
l,r=list(map(int,input().split()))
L=max(L,l)
R=min(R,r)
print((0 if R<L else R-L+1)) | p03037 |
N,M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
arr = [0 for i in range(M)]
seki = set(range(LR[0][0],LR[0][1]+1))
for i in range(M):
arr[i] = set(range(LR[i][0],LR[i][1]+1))
seki = seki & arr[i]
print((len(seki)))
| N,M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
seki = set(range(LR[0][0],LR[0][1]+1))
for i in range(M):
seki = seki & set(range(LR[i][0],LR[i][1]+1))
print((len(seki)))
| p03037 |
N,M= list(map(int, input().split()))
li=[list(map(int,input().split())) for _ in range(M)]
id = [0]*N
for i in li:
for j in range(i[0]-1,i[1]):
id[j]+=1
print((len([i for i,x in enumerate(id) if x==M]))) | N,M= list(map(int, input().split()))
li=[list(map(int,input().split())) for _ in range(M)]
mi=0
ma=N
for i in li:
mi=max(mi,i[0])
ma=min(ma,i[1])
if ma>=mi:
print((ma-mi+1))
else:
print((0)) | p03037 |
N, M =list(map(int, input().split()))
L = [0 for i in range(N+1)]
R = [0 for i in range(N+1)]
for i in range(M):
l,r = list(map(int, input().split()))
L[l] += 1
R[r] += 1
cnt = 0
tmp = 0
for i in range(N+1):
tmp += L[i]
if tmp == M:
cnt += 1
tmp -= R[i]
print(cnt)
| n,m = list(map(int, input().split()))
ll = 1
rr = n
for i in range(m):
l,r = list(map(int,input().split()))
if l > ll:
ll = l
if r < rr:
rr = r
print((max(rr - ll + 1, 0)))
| p03037 |
N, M =list(map(int, input().split()))
li = []
l, r = list(map(int, input().split()))
for j in range(r-l+1):
li.append(j + l)
for i in range(M-1):
l, r = list(map(int, input().split()))
# for j in range(r-l+1):
li = [s for s in li if l <= s and s <= r]
print((len(li))) | N, M =list(map(int, input().split()))
l, r = list(map(int, input().split()))
for i in range(M-1):
l2, r2 = list(map(int, input().split()))
if l2 > l:
l = l2
if r > r2:
r = r2
if r - l + 1 > 0:
print((r - l + 1))
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
a = [k for k in range(1,10**5+1)]
s = set(a)
for i in range(m):
l,r = list(map(int,input().split()))
ml = [p for p in range(l,r+1)]
newset = set(ml)
s = s&newset
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)
ans = min(R)-max(L)+1
print((ans if ans >0 else "0")) | p03037 |
def solve():
# dp = [1]*(N)
dp = [0] * N
for i in range(M):
# for j in range(0, LR[i][0]-1):
# dp[j] = 0
# for j in range(LR[i][1], N):
# dp[j] = 0
for j in range(LR[i][0]-1,LR[i][1]):
dp[j] += 1
# print(dp)
print((dp.count(M)))
# print(sum(dp))
if __name__ == "__main__":
N,M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
solve()
|
def solve():
dp = [0] * N
L = max(l)
R = min(r)
if L <= R:
i = list(range(L,R+1))
ans = len(i)
else:
ans = 0
print(ans)
if __name__ == "__main__":
N,M = list(map(int, input().split()))
# LR = [list(map(int, input().split())) for _ in range(M)]
l,r = [0]*M, [0]*M
for c in range(M):
tmp = list(map(int, input().split()))
l[c] = tmp[0]
r[c] = tmp[1]
solve()
| p03037 |
N,M=list(map(int,input().split()))
S=set()
for i in range(N):
S.add(i+1)
for i in range(M):
L,R=list(map(int,input().split()))
T=set()
for i in range(L,R+1):
T.add(i)
S=S&T
print((len(S)))
| N,M=list(map(int,input().split()))
L=1
R=100000
for i in range(M):
l,r=list(map(int,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()))
L,R = list(map(int,input().split()))
a = []
for i in range(L,R+1):
a.append(i)
for i in range(1,M):
b = []
l,r = list(map(int,input().split()))
for j in range(l,r+1):
b.append(j)
a = list(set(a) & set(b))
print((len(a)))
| N,M = list(map(int,input().split()))
l_max = 1
r_min = N
for i in range(0,M):
l,r = list(map(int,input().split()))
if l_max < l:
l_max = l
if r_min > r:
r_min = r
if l_max > r_min:
print((0))
else:
print((r_min-l_max+1))
| p03037 |
N, M = list(map(int, input().split()))
list1 = []
ss = set(x for x in range(1,N+1))
for i in range(M):
ar = []
L, R = list(map(int, input().split()))
st = set(x for x in range(L, R+1))
list1.append(st)
for s in list1:
ss = ss & s
print((len(ss)))
| N, M = list(map(int, input().split()))
ss = set(x for x in range(1,N+1))
for i in range(M):
L, R = list(map(int, input().split()))
st = set(x for x in range(L, R+1))
ss = ss & st
print((len(ss))) | p03037 |
N, M = list(map(int, input().split()))
set1 = set([x for x in range(1, N+1)])
for i in range(M):
L, R = list(map(int, input().split()))
lr = set([x for x in range(L, R+1)])
set1 =set1 & lr
print((len(set1))) | N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
for i in range(M-1):
L1, R1 = list(map(int, input().split()))
if R1 < L or R < L1:
print((0))
exit()
else:
if L <= L1 <= R:
L = L1
elif L <= R1 <= R:
R = R1
print((R-L+1)) | p03037 |
n , m = list(map(int,input().split()))
p = {i+1 for i in range(n)}
for i in range(m):
l , r = list(map(int,input().split()))
s = {l+i for i in range(r-l+1)}
p = p & s
print((len(p)))
| 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)
a = max(l)
b = min(r)
if a > b:
print((0))
else:
print((b-a+1)) | p03037 |
n, m = list(map(int, input().split()))
a = []
for i in range(m):
l, r = list(map(int, input().split()))
if i == 0: a = set([int(i) for i in range(l, r+1)])
else:
a &= set([int(i) for i in range(l, r+1)])
print((len(a))) | n, m = list(map(int, input().split()))
a = []
flag = True
for i in range(m):
l, r = list(map(int, input().split()))
if i == 0:
l1 = l
r1 = r
else:
if r < l1 or r1 < l:
flag = False
elif l1 < l:
l1 = l
elif r1 > r:
r1 = r
if flag: print((r1-l1+1))
else: print((0)) | p03037 |
# スペース区切りの整数の入力
N,M = list(map(int, input().split()))
LR_list=[]
Card_list=[]
#LR読み込み
for i in range(M):
LR_list.append([int(e) for e in input().split()])
#初期化
for i in range(N):
Card_list.append(0)
#LRをCardListに適用
for i in range(M):
#print("")
for j in range(LR_list[i][0],LR_list[i][1]+1,1):
Card_list[j-1]+=1
#print(j,end="")
ans=0
for i in range(N):
if Card_list[i]==M:
ans+=1
print(ans) | # スペース区切りの整数の入力
N,M = list(map(int, input().split()))
LR_list=[]
Card_list=[]
Min_L = 1
Max_R = N
#LR読み込み
for i in range(M):
L,R = list(map(int, input().split()))
if L>Min_L:
Min_L=L
if Max_R>R:
Max_R=R
if Max_R >= Min_L:
print((Max_R - Min_L + 1))
else:
print((0)) | p03037 |
N,M = list(map(int, input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
passable = [1]*(N+1)
for l,r in LR:
for i in range(l):
passable[i]=0
for i in range(r+1, N+1):
passable[i]=0
print((passable.count(1))) | 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 = max(L)
r = min(R)
print((max(r-l+1,0))) | p03037 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
N, M = LI()
LR = []
for _ in range(M):
LR.append(LI())
SE = None
for l, r in LR:
se = set(range(l, r + 1))
if SE is None:
SE = se
else:
SE = SE & se
ans = len(SE)
return ans
print((main()))
| import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
N, M = LI()
LR = []
for _ in range(M):
LR.append(LI())
left = 0
right = INF
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = max(right - left + 1, 0)
return ans
print((main()))
| p03037 |
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
gates={}
s={}
n,m = list(map(int,input().split()))
gates=[list(map(int,input().split())) for _ in range(m)]
for gate in gates:
if len(s)==0:
s = set([i for i in range(gate[0],gate[1]+1)])
else:
s = s & set([i for i in range(gate[0],gate[1]+1)])
print((len(s)))
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
gates=[]
n,m = list(map(int,input().split()))
gates=[list(map(int,input().split())) for _ in range(m)]
min_data=0
max_data=10**5+1
for gate in gates:
if min_data < gate[0]:
min_data=min(gate)
if max_data > gate[1]:
max_data=max(gate)
print((len(list(range(min_data,max_data+1)))))
if __name__=="__main__":
main() | p03037 |
n,m = list(map(int,input().split()))
l = []
r = []
low = 0
high = 10 ** 5 + 1
for i in range(m):
ll,rr = list(map(int,input().split()))
l.append(ll)
r.append(rr)
low = max(low,ll)
high = min(high,rr)
if high>=low:
print((high-low+1))
else:
print((0))
| n,m = list(map(int,input().split()))
low = 0
high = 10 ** 5 + 1
for i in range(m):
ll,rr = list(map(int,input().split()))
low = max(low,ll)
high = min(high,rr)
if high>=low:
print((high-low+1))
else:
print((0))
| p03037 |
data=input().split()
N=int(data[0])
M=int(data[1])
data_gate=[input().split() for i in range(M)]
ans=0
for i in range(1,N+1):
for j in range(M):
minimum=int(data_gate[j][0])
maximum=int(data_gate[j][1])
if j<=M-2:
if minimum<=i<=maximum:
continue
else:
break
else:
if minimum<=i<=maximum:
ans+=1
else:
break
print(ans) | data=input().split()
N=int(data[0])
M=int(data[1])
data_gate=[input().split() for i in range(M)]
data_min=[]
data_max=[]
for i in range(M):
data_min.append(int(data_gate[i][0]))
data_max.append(int(data_gate[i][1]))
m=max(data_min)
M=min(data_max)
if M>=m:
ans=M-m+1
else:
ans=0
print(ans) | p03037 |
data=input().split()
N=int(data[0])
M=int(data[1])
data_gate=[input().split() for i in range(M)]
data_min=[]
data_max=[]
for i in range(M):
data_min.append(int(data_gate[i][0]))
data_max.append(int(data_gate[i][1]))
m=max(data_min)
M=min(data_max)
if M>=m:
ans=M-m+1
else:
ans=0
print(ans) | r=input().split()
N=int(r[0])
M=int(r[1])
data=[[int(s) for s in input().split()] for i in range(M)]
left=[]
right=[]
for i in range(M):
left.append(data[i][0])
right.append(data[i][1])
if min(right)-max(left)+1<=0:
print((0))
else:
print((min(right)-max(left)+1)) | p03037 |
n, m = list(map(int, input().split()))
cnt = [0]*(n+1)
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
cnt[j] += 1
print((cnt.count(m)))
| n, m = list(map(int, input().split()))
l = [0]*m
r = [0]*m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
print((max(min(r) - max(l) + 1, 0)))
| p03037 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
ans = 0
card = [1] * N
for _ in range(M):
L, R = list(map(int, input().split()))
for i in range(N):
if i < L-1 or R-1 < i:
card[i] = 0
print((card.count(1))) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
max_L = 1
min_R = 100000
for _ in range(M):
L, R = list(map(int, input().split()))
if max_L < L:
max_L = L
if R < min_R:
min_R = R
if min_R - max_L + 1 < 0:
print((0))
else:
print((min_R - max_L + 1)) | p03037 |
n, m = list(map(int, input().split()))
l = [0 for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
for i in range(b-a+1):
l[a+i] += 1
print((l.count(m))) | n, m = list(map(int, input().split()))
l = []
r = []
for _ in range(m):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
l_max = max(l)
r_min = min(r)
if l_max <= r_min:
print((r_min - l_max + 1))
else:
print((0)) | p03037 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
------------------------
author : iiou16
------------------------
'''
def main():
N, M = list(map(int, input().split()))
L = []
R = []
id = list(range(N+1))
id_set = set(id)
for _ in range(M):
if len(id) == 0:
break
l, r = list(map(int, input().split()))
id_set = id_set & set(id[l:r+1])
print((len(id_set)))
if __name__ == '__main__':
main() | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
------------------------
author : iiou16
------------------------
'''
def main():
N, M = list(map(int, input().split()))
L = []
R = []
id = list(range(N+1))
for _ in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
max_l = max(L)
min_r = min(R)
if min_r < max_l:
print("0")
else:
print((min_r - max_l + 1))
if __name__ == '__main__':
main() | p03037 |
N,M = (int(i) for i in input().split())
e = [[int(i) for i in input().split()] for i in range(M)]
hoge = set()
zenbu = {int(i + 1) for i in range(N)}
for i in e:
konkaino = {int(i) for i in range(i[0],i[1] + 1)}
zenbu = zenbu & konkaino
print((len(zenbu))) | N,M = (int(i) for i in input().split())
e = [[int(i) for i in input().split()] for i in range(M)]
right = N
left = 0
for i in e:
if left < i[0]:
left = i[0]
if right > i[1]:
right = i[1]
if right >= left:
print((right - left + 1))
else:
print("0") | p03037 |
N, M = list(map(int, input().split()))
dict = {}
for _ in range(M):
L, R = list(map(int, input().split()))
for x in range(L, R+1):
if x in dict:
dict[x] += 1
else:
dict[x] = 1
print((sum([1 for k, v in list(dict.items()) if v == M]))) | n, m = list(map(int, input().split()))
L, R = 1, n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(L, l)
R = min(R, r)
print((max(R-L+1, 0))) | p03037 |
nm = list(map(int, input().split()))
n = nm[0]
m = nm[1]
gates = [list([int(x) for x in input().split()]) for i in range(m)]
keys = [i+1 for i in range(n)]
key_count = [0 for i in range(n)]
for gate in gates:
new_key = keys.copy()
for key in keys:
if (key >= gate[0] and key <= gate[1]):
key_count[key-1] += 1
else:
new_key.remove(key)
keys = new_key
print((len(keys))) | nm = list(map(int, input().split()))
n = nm[0]
m = nm[1]
gates = [list([int(x) for x in input().split()]) for i in range(m)]
first_max = 0
second_min = 100001
for gate in gates:
first_max = max(first_max, gate[0])
second_min = min(second_min, gate[1])
answer = second_min - first_max + 1
if (answer <= 0):
print((0))
else:
print(answer) | p03037 |
N,M=list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
IDlist=[i for i in range(N)]
for l,r in LR:
LRlist=[i for i in range(l-1,r)]
IDlist=set(IDlist)&set(LRlist)
print((len(IDlist))) | N,M=list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(M)]
L=0
R=N
for l,r in LR:
if L<l:
L=l
if R>r:
R=r
#print(str(L)+str(R))
if R-L+1<0:
print((0))
else:
print((str(R-L+1)))
| p03037 |
N, M = list(map(int, input().split()))
sub = set(i for i in range(1, N + 1))
for _ in range(M):
L, R = list(map(int, input().split()))
sub &= set(i for i in range(L, R + 1))
print((len(sub))) | N, M = list(map(int, input().split()))
st = 1
en = N
for _ in range(M):
L, R = list(map(int, input().split()))
st = max(st, L)
en = min(en, R)
ans = en - st
if ans < 0:
print((0))
else:
print((ans + 1))
| p03037 |
n,m = list(map(int,input().split()))
x = [[int(i) for i in input().split()] for i in range(m)]
cnt = 0
for i in range(1,n+1):
cnt_1 = 0
for j in range(m):
if i < x[j][0] or i > x[j][1]:
cnt_1 = 1
break
if cnt_1 == 0:
cnt += 1
print(cnt) | n,m = list(map(int,input().split()))
l = []
r = []
for i in range(m):
l_x,r_x = list(map(int,input().split()))
l.append(l_x)
r.append(r_x)
if min(r[0::])-max(l[0::])+1 >= 1:
print((min(r[0::])-max(l[0::])+1))
else:
print((0)) | p03037 |
# -*- coding: utf-8 -*-
inputs = input().split(' ')
N = int(inputs[0])
M = int(inputs[1])
inputs = input().split(' ')
L = int(inputs[0])
R = int(inputs[1])
res = {x for x in range(L, R+1)}
for _ in range(M-1):
inputs = input().split(' ')
L = int(inputs[0])
R = int(inputs[1])
tmp = {x for x in range(L, R+1)}
res = res & tmp
print((len(res))) | # -*- coding: utf-8 -*-
inputs = input().split(' ')
N = int(inputs[0])
M = int(inputs[1])
maxL = 1
minR = 100000
for _ in range(M):
inputs = input().split(' ')
L = int(inputs[0])
R = int(inputs[1])
if L > maxL:
maxL = L
if R < minR:
minR = R
if minR < maxL:
print((0))
else:
print((minR - maxL + 1)) | p03037 |
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
n,m = list(map(int, input().split()))
l = [list(map(int,input().split())) for i in range(m)]
# n,mが10^5なのでO(n)は間に合わない
ans = 0
for i in range(1,n+1):
flg = True
for j in range(m):
if i < l[j][0] or i > l[j][1]:
flg = False
if (flg):
ans+=1
print(ans)
| #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
n,m = list(map(int, input().split()))
l = [list(map(int,input().split())) for i in range(m)]
# n,mが10^5なのでO(n^2)は間に合わない
"""
ans = 0
for i in range(1,n+1):
flg = True
for j in range(m):
if i < l[j][0] or i > l[j][1]:
flg = False
if (flg):
ans+=1
print(ans)
"""
#lをO(m)で走査して上限、下限をあらかじめ確定しておく
up = 10**5+1
lo = 0
for i in range(m):
if lo < l[i][0]:
lo = l[i][0]
if up > l[i][1]:
up = l[i][1]
ans = 0
for i in range(1,n+1):
if i >= lo and i <= up:
ans+=1
print(ans)
| p03037 |
n, m = list(map(int, input().split()))
gate_cond = [[int(x) for x in input().split()] for _ in range(m)]
each_valid_keys = [[x for x in range(l[0],l[1]+1)] for l in gate_cond]
all_valid_key = each_valid_keys[0]
for keys in each_valid_keys[1:]:
all_valid_key = list(set(all_valid_key) & set(keys))
print((len(all_valid_key))) | n, m = list(map(int, input().split()))
gate_cond = [[int(x) for x in input().split()] for _ in range(m)]
max_under_th = max([l[0] for l in gate_cond])
min_upper_th = min([l[1] for l in gate_cond])
if min_upper_th - max_under_th >= 0:
print((min_upper_th - max_under_th + 1))
else:
print((0)) | p03037 |
N, M = list(map(int, input().split()))
left = []
right= []
for i in range(M):
L, R = list(map(int, input().split()))
left.append(L)
right.append(R)
l = max(left)
r = min(right)
if l <= r:
print((r-l+1))
else:
print((0)) | N, M = list(map(int, input().split()))
left=0
right=N
for i in range(M):
L, R = list(map(int, input().split()))
if L > left:
left = L
if R < right:
right = R
if left <= right:
print((right-left+1))
else:
print((0)) | p03037 |
# -*- coding utf-8 -*-
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
ids = [1] * N
for i in range(M):
ids[:LR[i][0]-1] = [0] * len(ids[:LR[i][0]-1])
ids[(LR[i][1]):] = [0] * len(ids[(LR[i][1]):])
print((sum(ids)))
| # -*- coding utf-8 -*-
N, M = list(map(int, input().split()))
max_L, min_R = 0, N+1
for i in range(M):
L, R = list(map(int, input().split()))
max_L = max(max_L, L)
min_R = min(min_R, R)
ans = max(min_R - (max_L - 1), 0)
print(ans)
| p03037 |
N, M = list(map(int, input().split()))
L=[0]*M
R=[0]*M
cnt=0
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
for i in range(N+1):
if max(L)<=i<=min(R):
cnt+=1
print(cnt) | N, M = list(map(int, input().split()))
L=[0]*M
R=[0]*M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
#print(min(R))
#print(max(L))
print((max(min(R)-max(L)+1,0))) | p03037 |
n, m = list(map(int,input().split()))
l,r=list(map(int, input().split()))
test = set([j for j in range(l,r+1)])
for i in range(1, m):
l,r=list(map(int, input().split()))
test_1 = set([j for j in range(l,r+1)])
test = test & test_1
print((len(list(test)))) | n, m = list(map(int,input().split()))
list_left = []
list_right = []
for i in range(m):
l,r=list(map(int, input().split()))
list_left.append(l)
list_right.append(r)
test=[i for i in range(max(list_left),min(list_right)+1)]
print((len(test))) | p03037 |
N,M=list(map(int,input().split()))
gate=[i for i in range(N)]
l,r=list(map(int,input().split()))
ans=gate[l-1:r]
for i in range(M-1):
l,r=list(map(int,input().split()))
new_ans=gate[l-1:r]
ans=list(set(ans)&set(new_ans))
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)
L.sort(reverse=True)
R.sort()
if R[0]>=L[0]:
print((R[0]-L[0]+1))
else:
print((0)) | p03037 |
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
import collections
N,M = [int(x) for x in input().split()]
idls =[]
for i in range(N):
idls.append(i+1)
ans =[]
LR =[]
for i in range (M):
L,R = [int(x) for x in input().split()]
LR.append((L,R))
for i in range (M):
iidls = idls[LR[i][0]-1:LR[i][1]]
ans+=iidls
c= collections.Counter(ans)
a = c.most_common()
count = 0
for i in a:
if i[1] == M:
count+= 1
print(count)
| #! /usr/bin/env python3
# -*- coding: utf-8 -*-
import collections
N,M = [int(x) for x in input().split()]
ans =[0]*N
for i in range (M):
L,R = [int(x) for x in input().split()]
ans[L-1:R] = [x+1 for x in ans[L-1:R]]
count = 0
for i in ans:
if i == M :
count+= 1
print(count)
| p03037 |
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
import collections
N,M = [int(x) for x in input().split()]
ans =[0]*N
for i in range (M):
L,R = [int(x) for x in input().split()]
ans[L-1:R] = [x+1 for x in ans[L-1:R]]
print((ans.count(M)))
| #! /usr/bin/env python3
# -*- coding: utf-8 -*-
N,M = [int(x) for x in input().split()]
Llist =[]
Rlist =[]
for i in range (M):
L,R = [int(x) for x in input().split()]
Llist.append(L)
Rlist.append(R)
lmax = max(Llist)
Rmax = min(Rlist)
if lmax > Rmax:
print((0))
else:
print((Rmax-lmax+1))
| p03037 |
n, m = list(map(int, input().split()))
card = list(range(1, n+1))
delete = set()
for i in range(m):
l,r = list(map(int, input().split()))
delete.update(card[:(l-1)])
delete.update(card[r:])
card = set(card)
print((len(card^delete))) | n,m = list(map(int, input().split()))
l = []
r = []
for i in range(m):
L,R = list(map(int, input().split()))
l.append(L)
r.append(R)
ans = min(r) - max(l) + 1
print((max(ans, 0))) | p03037 |
n, m = list(map(int, input().split(" ")))
r = [""] * m
for c in range(m):
r[c] = list(map(int, input().split(" ")))
ac = 0
for c in range(n):
num = c + 1
for co in range(m):
if r[co][0] <= num <= r[co][1]:
pass
else:
break
else:
ac += 1
print(ac) | N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for c in range(M):
L[c], R[c] = list(map(int, input().split()))
L_max = max(L)
R_min = min(R)
ans = R_min - L_max
ans += 1
if ans < 0:
print((0))
else:
print(ans) | p03037 |
n, m = list(map(int,input().split()))
for i in range(m):
s,t = list(map(int,input().split()))
if i == 0:
ans2 = [s,t+1]
try:
ans2 = [j for j in range(max(min(ans2),s),min(max(ans2)+1,t+1)) if s <= j <= t]
except:
break
print((len(ans2)))
| n,m = list(map(int,input().split()))
left_max = -1
right_min = n+1
for i in range(m):
s,t = list(map(int,input().split()))
left_max = max(left_max,s)
right_min = min(right_min, t)
print((max(0, right_min - left_max +1))) | p03037 |
# -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
# 文字列の入力
# 出力
gate = [[0,0]]*m
for i in range(m):
gate[i]=input().split()
cnt = 0
c = 0
for j in range(n):
j = j+1
for i in range(m):
if j >= int(gate[i][0]) and int(gate[i][1]) >= j:
c += 1
if c == m:
cnt = cnt+1
c = 0
print(cnt) | # -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
# 文字列の入力
# 出力
gate = [[0,0]]*m
for i in range(m):
gate[i]=input().split()
cnt = 0
min_r = n
max_l = 0
for i in range(m):
g0 = int(gate[i][0])
g1 = int(gate[i][1])
if max_l < g0:
max_l = g0
if min_r > g1:
min_r = g1
for j in range(n):
j=j+1
if j >= max_l and min_r >= j:
cnt += 1
print(cnt) | p03037 |
n,m=list(map(int,input().split()))
ans = set(range(1,n+1))
for i in range(m):
l,r=list(map(int,input().split()))
ans &= set(range(l,r+1))
print((len(ans))) | n,m=list(map(int,input().split()))
ansl = 1
ansr = n
for i in range(m):
l,r=list(map(int,input().split()))
ansl = max(ansl,l)
ansr = min(ansr,r)
print((max(0,ansr-ansl+1))) | p03037 |
n, m = list(map(int, input().split()))
gate = []
for i in range(m):
l, r = list(map(int, input().split()))
gate.append({j for j in range(l, r + 1)})
ID = gate[0]
for i in range(1, m):
ID = ID & gate[i]
print((len(ID))) | n, m = list(map(int, input().split()))
gate = []
l, r = list(map(int, input().split()))
ID = {i for i in range(l, r + 1)}
for i in range(1, m):
l, r = list(map(int, input().split()))
gate = {j for j in range(l, r + 1)}
ID = ID & gate
print((len(ID))) | p03037 |
n, m = list(map(int, input().split()))
gate = []
l, r = list(map(int, input().split()))
ID = {i for i in range(l, r + 1)}
for i in range(1, m):
l, r = list(map(int, input().split()))
gate = {j for j in range(l, r + 1)}
ID = ID & gate
print((len(ID))) | n, m = list(map(int, input().split()))
gate = []
l, r = list(map(int, input().split()))
for i in range(1, m):
m, s = list(map(int, input().split()))
if l < m:
l = m
if s < r:
r = s
print((len([i for i in range(l, r + 1)]))) | p03037 |
n, m = list(map(int, input().split()))
gate = []
l, r = list(map(int, input().split()))
for i in range(1, m):
m, s = list(map(int, input().split()))
if l < m:
l = m
if s < r:
r = s
print((len([i for i in range(l, r + 1)]))) | n, m = list(map(int, input().split()))
l, r = [0] * m, [0] * m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
print((max(min(r) - max(l) + 1, 0))) | p03037 |
n, m = list(map(int, input().split()))
t = [1] * n
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(0, l - 1):
t[i] = 0
for i in range(r, n):
t[i] = 0
print((sum(t)))
| n, m = list(map(int, input().split()))
x = 0
y = n - 1
for _ in range(m):
l, r = list(map(int, input().split()))
x = max(x, l - 1)
y = min(y, r - 1)
print((max(y - x + 1, 0)))
| p03037 |
N, M = list(map(int, input().split()))
cs = [0] * N
for _ in range(M):
L, R = list(map(int, input().split()))
cs[L - 1] += 1
if R != N:
cs[R] -= 1
for i in range(1, N):
cs[i] += cs[i - 1]
print((sum(1 for i in range(N) if cs[i] == M)))
| # imos 法
N, M = list(map(int, input().split()))
cs = [0] * N
for _ in range(M):
L, R = list(map(int, input().split()))
cs[L - 1] += 1
if R != N:
cs[R] -= 1
for i in range(1, N):
cs[i] += cs[i - 1]
print((cs.count(M)))
| p03037 |
N,M=list(map(int,input().split()))
l=[0]*N
for i in range(M):
L,R=list(map(int,input().split()))
for j in range(L,R+1):
l[j-1]+=1
print((l.count(M))) | N,M=list(map(int,input().split()))
l=0
r=0
for i in range(M):
L,R=list(map(int,input().split()))
if l<L:
l=L
if r==0:
r=R
else:
if r>R:
r=R
if r>=l:
print((r-l+1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(m)]
ans = 0
for j in range(1, n+1):
flag = True
for k in range(m):
if l[k][0] <= j <= l[k][1]:
continue
else:
flag = False
break
if flag:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
L = 1
R = 10**5
ans = 1
for i in range(m):
l, r = list(map(int, input().split()))
if L <= l <= R:
L = l
if L <= r <= R:
R = r
if R < l or r < L:
ans = 0
break
if ans != 0:
ans = R - L + 1
print(ans) | p03037 |
N, M = list(map(int, input().split()))
gates = list(range(1, N + 1))
for m in range(M):
L, R = list(map(int, input().split()))
gates = [g for g in gates if L <= g and g <= R]
if len(gates) < 1:
break
print((len(gates)))
| N, M = list(map(int, input().split()))
gates = [[1, N]]
for m in range(M):
L, R = list(map(int, input().split()))
updated = []
for gate in gates:
if L <= gate[0]:
if gate[0] <= R:
updated.append([gate[0], min(gate[1], R)])
else:
if L <= gate[1]:
updated.append([L, min(gate[1], R)])
gates = updated
print((sum([g[1] - g[0] + 1 for g in gates])))
| p03037 |
import sys
fin = sys.stdin.readline
N, M = [int(elem) for elem in fin().split()]
conditions = [tuple(int(elem) for elem in fin().split()) for _ in range(M)]
current_set = set(range(1, 100001))
for l, r in conditions:
new_set = set(range(l, r+1))
current_set = new_set & current_set
print((len(current_set)))
| import sys
fin = sys.stdin.readline
N, M = [int(elem) for elem in fin().split()]
conditions = [tuple(int(elem) for elem in fin().split()) for _ in range(M)]
l_list = [x[0] for x in conditions]
r_list = [x[1] for x in conditions]
print((max(0, min(r_list) - max(l_list) + 1)))
| p03037 |
N , M = list(map(int,input().split()))
L = []
R = []
cnt = 0
flag = True
for i in range(M):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
for i in range(N+1):
flag = True
for j in range(M):
if i < L[j] or i > R[j]:
flag = False
break
if flag == True:
cnt+=1
print(cnt) | N , M = list(map(int,input().split()))
L = []
R = []
cnt = 0
flag = True
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)
for i in range(N+1):
flag = True
if i >= L_max and i <= R_min:
cnt+=1
print(cnt) | p03037 |
n, m = list(map(int, input().split()))
lr = []
l1 = []
l2 = []
for i in range(m):
l,r = list(map(int,input().split()))
lr.append([l,r])
for i in range(0, lr[0][1] - lr[0][0]+1):
l1.append(lr[0][0] + i)
for i in range(1, m):
for j in range(0, lr[i][1] - lr[i][0]+1):
l2.append(lr[i][0]+j)
l1 = list(set(l1) & set(l2))
l2 = []
print((len(l1)))
| n, m = list(map(int, input().split()))
L = []
R = []
for i in range(m):
l,r = list(map(int, input().split()))
L.append(l)
R.append(r)
if min(R) - max(L) + 1 >= 0:
print((min(R) - max(L) + 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.