input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,m = list(map(int,input().split()))
card = [ set() for i in range(n+1) ]
for i in range(m):
l,r = list(map(int,input().split()))
for j in range(l,r+1):
card[j].add(i)
ans = 0
for i in card:
if len(i) == m:
ans += 1
print(ans)
| n,m = list(map(int,input().split()))
card = [ 0 for i in range(n+5) ]
for i in range(m):
l , r = list(map(int,input().split()))
card[l] += 1
card[r+1] -= 1
for i in range(1,n+1):
card[i] += card[i-1]
ans = 0
for i in card:
if i == m:
ans += 1
print(ans)
| p03037 |
n,m = list(map(int,input().split()))
k = [list(map(int,input().split())) for i in range(m)]
l,r = [list(i) for i in zip(*k)]
x = max(l)
y = min(r)
p = 0
for i in range(1,n+1):
if x <= i and i <= y:
p += 1
print(p) | n,m = list(map(int,input().split()))
k = [list(map(int,input().split())) for i in range(m)]
l,r = [list(i) for i in zip(*k)]
x = max(l)
y = min(r)
print((max(y-x+1,0))) | p03037 |
n,m = list(map(int,input().split()))
k = [list(map(int,input().split())) for i in range(m)]
l,r = [list(i) for i in zip(*k)]
x = max(l)
y = min(r)
print((max(y-x+1,0))) | n,m = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(m)]
l,r = [list(i) for i in zip(*a)]
print((max(0,min(r)-max(l)+1))) | p03037 |
def main():
n, m = list(map(int, input().split()))
lr_lst = [list(map(int, input().split())) for _ in range(m)]
ans = 0
for i in range(1, n + 1):
is_able = True
for j in range(m):
if not lr_lst[j][0] <= i <= lr_lst[j][1]:
is_able = False
break
if is_able:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
n, m = list(map(int, input().split()))
lr_lst = [list(map(int, input().split())) for _ in range(m)]
left = 0
right = n + 1
for i in range(m):
if left < lr_lst[i][0]:
left = lr_lst[i][0]
if lr_lst[i][1] < right:
right = lr_lst[i][1]
if right - left < 0:
print((0))
else:
print((right - left + 1))
if __name__ == "__main__":
main()
| p03037 |
def main():
N, M = list(map(int, input().split()))
A = [0] * (N + 1)
for _ in range(M):
L, R = list(map(int, input().split()))
A[L - 1] += 1
A[R] -= 1
c = 0
ans = 0
for a in A:
c += a
if c == M:
ans += 1
print(ans)
main()
| def main():
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)
if min(R) - max(L) >= 0:
print((min(R) - max(L) + 1))
else:
print((0))
main()
| p03037 |
N, M = list(map(int, input().split()))
A = set(x for x in range(1,N+1))
for i in range(M):
L, R = list(map(int, input().split()))
A &= {x for x in range(L,R+1)}
print((len(A)))
| N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
print((max(0, min(R)-max(L)+1)))
| p03037 |
import sys
import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = list(map(int, readline().split()))
LR = [[int(x) for x in readline().split()] for _ in range(M)]
se = set(range(LR[0][0], LR[0][1]+1))
for i in LR:
sa = set(range(i[0], i[1]+1))
se = se & sa
print((len(se)))
| import sys
import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = list(map(int, readline().split()))
A = [None]*M
B = [None]*M
for i in range(M):
A[i], B[i] = list(map(int, readline().split()))
ans = min(B) - max(A)
print((ans + 1 if ans >= 0 else 0))
| p03037 |
N, M = list(map(int, input().split()))
L = list(list(map(int,input().split())) for i in range(M))
A = [0]*N
for i in range(M):
for j in range(L[i][0],L[i][1]+1):
A[j-1] += 1
count = 0
for i in range(N):
if A[i] == M:
count +=1
print(count) | N, M = list(map(int, input().split()))
L = list(list(map(int,input().split())) for i in range(M))
l = 1
r = N
for i in range(M):
l = max(l,L[i][0])
r = min(r,L[i][1])
print((max(r-l+1,0)))
| p03037 |
n, m = list(map(int, input().split()))
c = [0]*n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l-1, r):
c[j] += 1
print((c.count(m))) | n, m = list(map(int, input().split()))
x, y = 1, n
for _ in range(m):
a, b = list(map(int, input().split()))
x = max(a, x)
y = min(b, y)
print((max(0, y-x+1))) | p03037 |
def resolve():
N, M = list(map(int, input().split()))
interval = []
for i in range(M):
L, R = list(map(int, input().split()))
interval.append(list(range(L, R + 1)))
# print(interval)
interval = [set(l) for l in interval]
interval = set.intersection(*interval)
print((len(set(range(1, N + 1)) & interval)))
return
resolve() | def resolve():
N, M = list(map(int, input().split()))
interval = []
l, r = 0, 10**5
for i in range(M):
L, R = list(map(int, input().split()))
l = max(l, L)
r = min(r, R)
interval = set(list(range(l, r + 1)))
interval = interval & set(range(1, N + 1))
print((len(interval)))
return
resolve() | p03037 |
n,m = list(map(int,input().split()))
A = set(range(1,n+1))
for _ in range(m):
l,r = list(map(int,input().split()))
S = set(range(l,r+1))
A = A & S
print((len(A))) | n,m = list(map(int,input().split()))
lmax, rmin = 0, n
for _ in range(m):
l,r = list(map(int,input().split()))
lmax = max(lmax, l)
rmin = min(rmin, r)
print(((rmin-lmax)+1 if (rmin-lmax)+1 > 0 else 0)) | p03037 |
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
sum = 0
for id in range(1, N+1):
for li, ri in zip(L, R):
if id < li or ri < id:
break
else:
sum += 1
print(sum)
| N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = [int(x)-1 for x in input().split()]
sum = 0
maxl = max(L)
minr = min(R)
for id in range(N):
if maxl <= id and id <= minr:
sum += 1
print(sum)
| p03037 |
n, m = [int(i) for i in input().split()]
l = []
r = []
for _ in range(m):
i, k = [int(i) for i in input().split()]
l.append(i)
r.append(k)
card = [0] * (n+1)
for i, j in zip(l, r):
for k in range(i, j+1):
card[k] += 1
print((card.count(m)))
| n, m = [int(i) for i in input().split()]
l = []
r = []
for _ in range(m):
i, k = [int(i) for i in input().split()]
l.append(i)
r.append(k)
res = min(r) - max(l) + 1 if min(r) >= max(l) else 0
print(res)
| p03037 |
n,m=list(map(int,input().split()))
lr=[]
result=0
gates=0
for i in range(m):
lr.append(input().split())
#print(lr[0])
for k in range(1,n+1):
gates=0
for h in range(m):
if int(k)>=int(lr[h][0]) and int(k)<=int(lr[h][1]):
gates+=1
#print(gates,k)
if gates==m:
result+=1
gates=0
#print('ID')
print(result) | n,m=list(map(int,input().split()))
l=1
r=n
lr=[]
for i in range(m):
lr.append(input().split())
for j in lr:
if l<int(j[0]):
l=int(j[0])
if r>int(j[1]):
r=int(j[1])
if r>=l:
print((int(r-l+1)))
else:
print((0)) | p03037 |
# -- coding:utf-8 --
n,m = list(map(int,input().split()))
lr = [list(map(int,input().split())) for ii in range(m)]
L = [lr[jj][0] for jj in range(m) ]
R = [lr[jj][1] for jj in range(m) ]
count = 0
for nn in range(1,n+1):
check = [0]*m
for kk in range(m):
if nn >= L[kk] and nn <= R[kk]:
check[kk] = 1
if sum(check) == m:
count += 1
print(count)
| # -- coding:utf-8 --
n,m = list(map(int,input().split()))
lr = [list(map(int,input().split())) for ii in range(m)]
L = [lr[jj][0] for jj in range(m) ]
R = [lr[jj][1] for jj in range(m) ]
if min(R)-max(L) < 0:
print((0))
else:
print((min(R)-max(L)+1))
| p03037 |
N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
ans = set(range(1, N + 1))
for lr in LR:
ans = ans & set(range(lr[0], lr[1] + 1))
print((len(ans))) | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
l = 0
r = 100001
for lr in LR:
l = max(lr[0], l)
r = min(r, lr[1])
print((r - l + 1 if r - l >= 0 else 0)) | p03037 |
N, M = list(map(int, input().split()))
LRs = None
for i in range(M):
l, r = list(map(int, input().split()))
if(LRs is None):
LRs = set(range(l, r+1))
else:
LRs = LRs.intersection(set(range(l, r+1)))
print((str(len(LRs)))) | N, M = list(map(int, input().split()))
l_max = 0
r_min = 10**5+1
for i in range(M):
l, r = list(map(int, input().split()))
l_max = max(l, l_max)
r_min = min(r, r_min)
if(l_max <= r_min):
print((str(r_min - l_max + 1)))
else:
print("0") | p03037 |
# -*- coding: utf-8 -*-
l = []
r = []
count = 0
N, M = list(map(int, input().split()))
l = [0] * M
r = [0] * M
for i in range(0,M):
l[i], r[i] = list(map(int, input().split()))
#idカードの生成
for i in range(1,N+1):
if max(l) <= i and i <= min(r):
count += 1
print(count) | # -*- coding: utf-8 -*-
l = []
r = []
count = 0
N, M = list(map(int, input().split()))
l = [0] * M
r = [0] * M
for i in range(0,M):
l[i], r[i] = list(map(int, input().split()))
#idカードの生成
ml = max(l)
mr = min(r)
for i in range(1,N+1):
if ml <= i and i <= mr:
count += 1
print(count) | p03037 |
n,m = list(map(int,input().split()))
l = [0]*100000
r = [0]*100000
for i in range(0,m):
l[i],r[i] = list(map(int,input().split()))
count = 0
num = 0
for key in range(1,n + 1):#鍵の番号
for i in range(0,m):#
if(key < l[i]):
break
if(key >= l[i] and key <= r[i]):
count += 1
if(count == m):
num += 1
count = 0
print(num)
| n,m = list(map(int,input().split()))
l = [0]*m
r = [0]*m
b = [0]*(n + 2)
count = 0
for i in range(0,m):
l[i],r[i] = list(map(int,input().split()))
l_max = max(l)
r_min = min(r)
for i in range(1,n+1):
if(i >= l_max and i <= r_min ):
count += 1
print(count)
| p03037 |
n,m = list(map(int,input().split()))
LR = [[int(i) for i in input().split()] for i in range(m)]
ans = set(range(1,n+1))
for i in range(m):
ans = ans & set(range(LR[i][0],LR[i][1]+1))
print((len(ans)))
| n,m = list(map(int,input().split()))
p,q = 1,n
for i in range(m):
l,r = list(map(int,input().split()))
p = max(p,l)
q = min(q,r)
if q>=p:
print((q-p+1))
else:
print((0))
| p03037 |
n,m = list(map(int,input().split()))
for i in range(m):
l,r = list(map(int,input().split()))
lst = [x for x in range(l,r+1)]
if i == 0:
sekishugo=set(lst)
else:
sekishugo = sekishugo.intersection(set(lst))
print((len(sekishugo)))
| n,m = list(map(int,input().split()))
ans_l = None
ans_r = None
for i in range(m):
l,r = list(map(int,input().split()))
if i == 0:
ans_l = l
ans_r = r
else:
ans_r = min(r,ans_r)
ans_l = max(l,ans_l)
if ans_r - ans_l < 0:
print((0))
exit()
print((ans_r-ans_l+1))
| p03037 |
n, m = list(map(int, input().split()))
can_through = ["1" for _ in range(n)]
# cnt = 0
for i in range(m):
l, r = list(map(int, input().split()))
# for j in range(1, n+1):
# if can_through[j-1]:
# if l <= j <= r:
# pass
# else:
# can_through[j-1] = False
# print(can_through[:2])
# print(can_through[2:])
can_through[:l-1] = "0"*(l-1)
# print(can_through)
can_through[r:n] = "0"*(n-r)
# print(can_through)
print((can_through.count("1"))) | 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()))
S = [None]*m
for i in range(m):
l, r = list(map(int, input().split()))
S[i] = set(range(l, r+1))
ans = S[0]
for i in range(1, m):
ans = ans & S[i]
print((len(ans)))
| n, m = list(map(int, input().split()))
S = [None]*m
L = 0
R = n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
ans = R-L+1
if ans < 0:
ans = 0
print(ans) | p03037 |
N, M = list(map(int, input().split()))
Ls = [0] * M
Rs = [0] * M
for i in range(M):
Ls[i], Rs[i] = list(map(int, input().split()))
count = 0
for i in range(N):
judge = True
for k in range(M):
L = Ls[k]
R = Rs[k]
if not (L <= i + 1 <= R):
judge = False
if judge:
count += 1
print(count)
| N, M = list(map(int, input().split()))
maxvL = 0
minvR = 1000000
for i in range(M):
L, R = list(map(int, input().split()))
if maxvL < L:
maxvL = L
if minvR > R:
minvR = R
count = 0
for i in range(N):
if maxvL <= i + 1 <= minvR:
count += 1
print(count) | p03037 |
cardNum,gate = list(map(int,input().split()))
lr = []
for i in range(gate):
lr.append(list(map(int,input().split())))
okCard = 0
for card in range(1,cardNum+1):
ok = True
for check in lr:
ok = ok and check[0] <= card <= check[1]
if not ok:
break
if ok:
okCard += 1
print(okCard) | cardNum,gate = list(map(int,input().split()))
l = []
r = []
for i in range(gate):
ll,rr = list(map(int,input().split()))
l.append(ll)
r.append(rr)
cnum = min(r)-max(l)+1
if cnum < 0:
print((0))
else:
print(cnum) | p03037 |
n,m=list(map(int,input().split()))
g=[]
for i in range(m):
l,r=list(map(int,input().split()))
g_list=[]
for j in range(l,r+1):
g_list.append(j)
g.append(g_list)
for k in range(m):
if k == 0:
unq=set(g[0])
else:
unq=unq&set(g[k])
print((len(list(unq))))
| n,m=list(map(int,input().split()))
l=[]
r=[]
for i in range(m):
li,ri=list(map(int,input().split()))
l.append(li)
r.append(ri)
l_max=max(l)
r_min=min(r)
if r_min < l_max:
print((0))
else:
print((r_min-l_max+1)) | 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()))
aa = [i for i in range(L, R+1)]
a = set(a) & set(aa)
print((len(a))) | N, M = list(map(int, input().split()))
maxL, minR = 0, N+1
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(L, maxL)
minR = min(R, minR)
ans = minR -maxL + 1
print((ans if ans>0 else 0)) | p03037 |
N, M = list(map(int, input().split()))
pass_num_set = {}
for i in range(M):
L, R = list(map(int, input().split()))
if i == 0:
pass_num_set = set(range(L, R + 1))
else:
pass_num_set = pass_num_set & set(range(L, R + 1))
ans = len(pass_num_set)
print(ans) | N, M = list(map(int, input().split()))
L_list = []
R_list = []
for i in range(M):
L, R = list(map(int, input().split()))
L_list.append(L)
R_list.append(R)
ans = max(min(R_list) - max(L_list) + 1, 0)
print(ans) | p03037 |
n, m = list(map(int, input().split()))
gate = []
for i in range(m):
gate.append(list(map(int, input().split())))
card = [0 for i in range(1, n+1)]
for l, r in gate:
for i in range(l, r+1):
card[i-1] += 1
print((card.count(m))) | n, m = list(map(int, input().split()))
L_max, R_min = list(map(int, input().split()))
for i in range(m-1):
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(" ")))
ans = 0
GATE_ID = []
for i in range(M):
GATE_ID1,GATE_ID2 = list(map(int,input().split(" ")))
GATE_ID.append([GATE_ID1,GATE_ID2])
#print(GATE_ID)
for i in range(N):
CARD_ID = i+1
#print("CARD_ID:",CARD_ID)
ALL_GATE_PASS_COUNT = 0
for j in range(M):
GATE_ID1,GATE_ID2 = GATE_ID[j][0],GATE_ID[j][1]
#print(GATE_ID1,GATE_ID2)
if CARD_ID >= GATE_ID1 and CARD_ID <= GATE_ID2:
ALL_GATE_PASS_COUNT += 1
#print(CARD_ID,":PASS")
else:
break
#print("ALL_GATE_PASS_COUNT:",ALL_GATE_PASS_COUNT)
if ALL_GATE_PASS_COUNT == M:
ans += 1
print(ans) | N,M = list(map(int,input().split(" ")))
L_list = []
R_list = []
for i in range(M):
L,R = list(map(int,input().split(" ")))
L_list.append(L)
R_list.append(R)
if min(R_list) - max(L_list) >= 0:
print((min(R_list) - max(L_list) +1))
else:
print((0)) | p03037 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32
def solve(N: int, M: int, L: "List[int]", R: "List[int]"):
ans = set(list(range(L[0], R[0]+1)))
for i in range(1, M):
ans = ans & set(list(range(L[i],R[i]+1)))
print((len(ans)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
L = [int()] * (M) # type: "List[int]"
R = [int()] * (M) # type: "List[int]"
for i in range(M):
L[i] = int(next(tokens))
R[i] = int(next(tokens))
solve(N, M, L, R)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32
def solve(N: int, M: int, L: "List[int]", R: "List[int]"):
lm = max(L)
rm = min(R)
print((max(0, rm-lm+1)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
L = [int()] * (M) # type: "List[int]"
R = [int()] * (M) # type: "List[int]"
for i in range(M):
L[i] = int(next(tokens))
R[i] = int(next(tokens))
solve(N, M, L, R)
if __name__ == '__main__':
main()
| p03037 |
N,M = list(map(int,input().split()))
L_list = []
R_list = []
count = 0
M_list = list(range(M))
for i in M_list:
L,R=list(map(int,input().split()))
L_list.append(L)
R_list.append(R)
for i in range(1,N+1):
for j in M_list:
if(i >= L_list[j] and i<=R_list[j]):
if j==M-1:
count+=1
else:
break
print(count) | N,M = list(map(int,input().split()))
L_list = []
R_list = []
count = 0
min_mn=float('inf')
max_mn=0
for i in range(M):
L,R=list(map(int,input().split()))
min_mn = min(min_mn,R)
max_mn = max(max_mn,L)
for i in range(1,N+1):
if(i>=max_mn and i<=min_mn):
count += 1
print(count) | p03037 |
N, M = list(map(int, input().split()))
ans = set()
for i in range(M):
L, R = list(map(int, input().split()))
if M == 1:
print((R-L+1))
break
else:
if i == 0:
ans = set(list(range(L, R + 1)))
else:
s = set(list(range(L, R + 1)))
ans = ans & s
else:
print((len(ans))) | N, M = list(map(int, input().split()))
l = 0
r = N
for i in range(M):
L, R = list(map(int, input().split()))
if L > l:
l = L
if R < r:
r = R
ans = r - l + 1
if ans < 0:
print((0))
break
else:
print(ans) | p03037 |
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, m = list(map(int, input().split()))
counts = [0] * n
for _ in range(m):
l, r = list(map(int, input().split()))
for i in range(l - 1, r):
counts[i] += 1
print((counts.count(m)))
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, m = list(map(int, input().split()))
l_max = 0
r_min = float('inf')
for _ 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 + 1 - l_max, 0)))
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| p03037 |
N,M = [int(i) for i in input().split()]
ans = [0]*N
for _ in range(M):
L,R = [int(i)-1 for i in input().split()]
for j in range(L,R+1):
ans[j] += 1
count = 0
for i in ans:
if i == M:
count += 1
print(count)
| import sys
input = sys.stdin.readline
N,M = [int(i) for i in input().split()]
L_max = 0
R_min = 10**9
for _ in range(M):
L,R = [int(i) for i in input().split()]
L_max = max(L_max,L)
R_min = min(R_min,R)
if R_min-L_max+1 > 0:
print((R_min-L_max+1))
else:
print((0))
| p03037 |
import collections
def main():
li = []
ans = 0
n,m = list(map(int,input().split()))
for _ in range(m):
l,r = list(map(int, input().split()))
for i in range(l,r+1):
li.append(i)
c = collections.Counter(li)
for i,v in list(c.items()):
if v >= m:
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
ll = []
rl = []
n,m = list(map(int,input().split()))
for _ in range(m):
l,r = list(map(int, input().split()))
ll.append(l)
rl.append(r)
l = max(ll)
r = min(rl)
print((max(0,r-l+1)))
if __name__ == '__main__':
main() | p03037 |
N, M = list(map(int, input().split()))
L = [None] * M
R = [None] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
l = [0] * N
for i in range(M):
for j in range(L[i], R[i] + 1):
l[j - 1] += 1
a = 0
for i in range(N):
if l[i] == M:
a += 1
print(a) | N, M = list(map(int, input().split()))
L = [None] * M
R = [None] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
l = [L[0], R[0]]
for i in range(1, M):
if L[i] > l[0]:
l[0] = L[i]
if R[i] < l[1]:
l[1] = R[i]
if l[0] <= l[1]:
ans = l[1] - l[0] + 1
else:
ans = 0
print(ans) | p03037 |
# indeednow_A_b
import sys
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
L = [0 for i in range(M)]
R = [0 for i in range(M)]
for i in range(M):
L[i], R[i] = [int(x) for x in stdin.readline().rstrip().split()]
# print(L, R)
ans = set()
for k in range(M):
temp = set()
for l in range(L[k], R[k]+1):
temp.add(l)
if len(ans) != 0:
ans = temp & ans
else:
ans = temp
print((len(ans)))
| # indeednow_A_b
import sys
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
L = [0 for i in range(M)]
R = [0 for i in range(M)]
for i in range(M):
L[i], R[i] = [int(x) for x in stdin.readline().rstrip().split()]
# print(L, R)
ans = set()
ans1 = 0
ans2 = 10**6
for k in range(M):
if ans2 < L[k]:
print("0")
sys.exit()
if ans1 < L[k]:
ans1 = L[k]
if ans2 > R[k]:
ans2 = R[k]
# temp = set()
# for l in range(L[k], R[k]+1):
# temp.add(l)
# if len(ans) != 0:
# ans = temp & ans
# else:
# ans = temp
print((ans2+1-ans1))
| p03037 |
N, M = list(map(int,input().split()))
LR = [list(map(int,input().split())) for i in range(M)]
ID = [1]*N #IDカードの配列を用意する
for i in range(M):
for j in range(N):
if LR[i][0]-1<=j and j<=LR[i][1]-1: #通過できる場合は1をかける
ID[j] = ID[j]*1
else: #通過できない場合は0をかける
ID[j] = ID[j]*0
print((sum(ID))) #全てのゲートをチェックした後、1のままのカードは全てのゲートを通過可能
| N, M = list(map(int,input().split()))
list_L = []
list_R = []
for i in range(M):
L, R = list(map(int,input().split()))
list_L.append(L)
list_R.append(R)
print((min(list_R)-max(list_L)+1 if min(list_R)>=max(list_L) else 0)) | p03037 |
import sys
args = sys.stdin.readlines()
n, m = list(map(int, args[0].split(' ')))
ids = set(range(1, n+1))
for gate in args[1:]:
l, r = list(map(int, gate.split(' ')))
ids = ids & set(range(l, r+1))
print((len(ids)))
| import sys
args = sys.stdin.readlines()
n, m = list(map(int, args[0].split(' ')))
l_1 = 1
r_1 = n
for gate in args[1:]:
l, r = list(map(int, gate.split(' ')))
if l > l_1:
l_1 = l
if r < r_1:
r_1 = r
ids = r_1 - l_1 + 1
if ids < 0:
print((0))
else:
print(ids) | p03037 |
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
ok = [int(i) for i in range(1, n+1)]
answer = 0
for i in range(m):
a, b = list(map(int, input().split()))
l = [int(n) for n in range(a, b+1)]
ok = list(set(ok) & set(l))
print((len(ok))) | # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
l = []
r = []
answer = 0
for i in range(m):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
min_ok = max(l)
max_ok = min(r)
answer = max_ok - min_ok + 1
if answer < 0:
answer = 0
print(answer)
| p03037 |
n, m = [int(x) for x in input().split()]
id_range = []
id_card = [0] * n
for x in range(m):
id_range.append([int(y) for y in input().split()])
for x in range(m):
for y in range(id_range[x][0], id_range[x][1] + 1):
id_card[y - 1] += 1
id_card.sort()
cnt = 0
for x in id_card:
if(x == m):
cnt += 1
print(cnt)
| n, m = [int(x) for x in input().split()]
min_num = 0
max_num = n
for x in range(m):
tmp_min, tmp_max = list(map(int, input().split()))
min_num = max(min_num, tmp_min)
max_num = min(max_num, tmp_max)
if max_num - min_num + 1 > 0:
print((max_num - min_num + 1))
else:
print((0)) | p03037 |
n,m = list(map(int,input().split()))
answers = [i for i in range(1,n+1)]
for i in range(m):
l,r = list(map(int,input().split()))
for ans in answers[:]:
if ans < l or ans > r:
answers.remove(ans)
print((len(answers)))
| n,m = list(map(int,input().split()))
gates = [list(map(int,input().split())) for _ in range(m)]
l = []
r = []
for gate in gates:
l.append(gate[0])
r.append(gate[1])
ans = min(r)+1 - max(l)
print((ans if ans > 0 else 0)) | p03037 |
N,M = list(map(int,input().split()))
L=[]
R=[]
Nlist = list(range(1,N+1))
for i in range(M):
L_n,R_n = list(map(int,input().split()))
L.append(L_n)
R.append(R_n)
for i in range(M):
Nlist = [k for k in Nlist if (k > (L[i]-1)) and (k < (R[i]+1))]
print((len(Nlist))) | N,M = list(map(int,input().split()))
L=[]
R=[]
Nlist = list(range(1,N+1))
for i in range(M):
L_n,R_n = list(map(int,input().split()))
L.append(L_n)
R.append(R_n)
Lmax=max(L)
Rmin=min(R)
if Rmin < Lmax:
print((0))
else:
print((Rmin-Lmax+1))
| p03037 |
n,m = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(m)]
l_max,r_min = 0,10**5
for l,r in src:
l_max = max(l_max,l)
for l,r in src:
r_min = min(r_min,r)
else:
if r_min-l_max < 0:
print((0))
else:
print((r_min-l_max+1)) | n,m = list(map(int,input().split()))
ll = 0
rr = 10**5+1
for i in range(m):
l,r = list(map(int,input().split()))
if l > ll:
ll = l
if r < rr:
rr = r
else:
#print(rr-ll+1)
if rr-ll+1>n:
print(n)
elif rr-ll+1<0:
print((0))
else:
print((rr-ll+1))
| p03037 |
N,M = list(map(int,input().split()))
L_list = []
R_list = []
for o in range(M):
L,R = list(map(int,input().split()))
L_list.append(L)
R_list.append(R)
count = set(range(L_list[0],R_list[0]+1))
for i in range(1,M):
count = count & set(range(L_list[i],R_list[i]+1))
ans = len(count)
print(ans) | N,M = list(map(int,input().split()))
L_list = []
R_list = []
for o in range(M):
L,R = list(map(int,input().split()))
L_list.append(L)
R_list.append(R)
L_max = max(L_list)
R_min = min(R_list)
if L_max <= R_min:
ans = R_min - L_max + 1
else:
ans = 0
print(ans) | p03037 |
n, m = list(map(int, input().split()))
g = [0] * n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l-1, r):
g[j] += 1
ans = 0
for i in range(n):
if g[i] == m:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
a = 1
b = n
for i in range(m):
l, r = list(map(int, input().split()))
if a < l:
a = l
if b > r:
b = r
if a > b:
print((0))
else:
print((b - a + 1)) | p03037 |
N,M=list(map(int,input().split()))
L = []
R = []
for i in range(M):
x1,y1=[int(i) for i in input().split()]
L.append(x1)
R.append(y1)
for i in range(M):
if i==0:
landl=set(range(L[i],R[i]+1))
else:
landl=landl & set(range(L[i],R[i]+1))
print((len(landl))) | N,M=list(map(int,input().split()))
L = []
R = []
for i in range(M):
x1,y1=[int(i) for i in input().split()]
L.append(x1)
R.append(y1)
L2=max(L)
R2=min(R)
if L2<=R2:
print((R2-L2+1))
else:
print((0)) | p03037 |
n,m = list(map(int, input().split()))
ans = 0
L = 1
R = n
for i in range(m):
l,r = list(map(int, input().split()))
L = max(l,L)
R = min(r,R)
if L <= R:
print((R-L+1))
else:
print((0)) | 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 |
n, m = list(map(int, input().split()))
left = 0
right = n
ls = list(range(1,n+1))
for i in range(m):
l,r = list(map(int, input().split()))
if l - 1 > left:
left = l - 1
if r < right:
right = r
print((len(ls[left:right]))) | n, m = list(map(int, input().split()))
left = 0
right = n
ls = list(range(n))
for i in range(m):
l, r = list(map(int, input().split()))
if left < l-1:
left = l-1
if right > r:
right = r
print((len(ls[left:right]))) | p03037 |
n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
s={j for j in range(l,r+1)}
for i in range(1,m):
l,r=list(map(int,input().split()))
s=s & {j for j in range(l,r+1)}
if len(s)==0:
break
print((len(s))) | n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
s=[l,r]
for i in range(1,m):
l,r=list(map(int,input().split()))
if s[0]<l:
s[0]=l
if s[1]>r:
s[1]=r
if s[1]-s[0]<0:
s=[0,-1]
break
print((s[1]-s[0]+1))
| p03037 |
N, M=list(map(int, input().split()))
lst=[list(map(int, input().split())) for _ in range(M)]
ans=set(i for i in range(N))
for L, R in lst:
L, R=L-1, R-1
ans-=set(i for i in range(L))
ans-=set(i for i in range(R+1, N))
print((len(ans))) | N, M=list(map(int, input().split()))
lst=[list(map(int, input().split())) for _ in range(M)]
maxL, minR=-1, N
for L, R in lst:
L, R=L-1, R-1
maxL=max(maxL, L)
minR=min(minR, R)
if minR>=maxL:
print((minR-maxL+1))
else:
print((0)) | p03037 |
import sys
sys.setrecursionlimit(10**7)
def judge(c,l,r,counter):
if counter == 0:
return c
elif len(c) == 0:
return c
else:
return judge(list([x for x in c if l[0]<=x<=r[0]]),l[1:],r[1:],counter-1)
def solve(c,l,r,m):
return len(judge(c,l,r,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()))
cards = list(range(1,N+1))
print((solve(cards,L,R,M)))
| def solve(l,r):
l_max = max(l)
r_min = min(r)
return max(r_min - l_max + 1, 0)
N,M = list(map(int,input().split()))
L = [0]*M
R = [0]*M
for i in range(M):
L[i],R[i] = list(map(int,input().split()))
print((solve(L,R)))
| p03037 |
import os, sys, re, math
(N, M) = [int(n) for n in input().split()]
cards = set([(i + 1) for i in range(N)])
for i in range(M):
(L, R) = [int(n) for n in input().split()]
if min(cards) > R or max(cards) < L:
cards = {}
break
cards -= set([(i + 1) for i in range(L - 1)])
cards -= set([(i + 1) for i in range(R, N)])
print((len(cards)))
| import os, sys, re, math
(N, M) = [int(n) for n in input().split()]
minC = 1
maxC = N
for i in range(M):
(L, R) = [int(n) for n in input().split()]
minC = max(minC, L)
maxC = min(maxC, R)
print((max((maxC - minC + 1), 0)))
| p03037 |
#!/usr/bin/env python3
def main():
N, M = list(map(int, input().split()))
Card = [[] for i in range(M)]
Diff = [i for i in range(1, N + 1)]
for i in range(0, M):
L, R = list(map(int, input().split()))
for j in range(L, R + 1):
Card[i].append(j)
Diff = list(set(Diff) & set(Card[i]))
print((len(Diff)))
main() | #!/usr/bin/env python3
def main():
N, M = list(map(int, input().split()))
Diff = [i for i in range(1, N + 1)]
for i in range(0, M):
L, R = list(map(int, input().split()))
Card = []
for j in range(L, R + 1):
Card.append(j)
Diff = list(set(Diff) & set(Card))
print((len(Diff)))
main() | p03037 |
N, M = [int(x) for x in input().split(' ')]
P = {}
for i in range(M):
l,r = [int(x) for x in input().split(' ')]
for s in range(l,r+1):
if s not in P:
P[s] = 0
P[s] += 1
#print(s)
cnt = 0
for k,v in list(P.items()):
if v == M:
cnt += 1
print(cnt) | N, M = [int(x) for x in input().split(' ')]
L = 0
R = N
for i in range(M):
l,r = [int(x) for x in input().split(' ')]
if L < l:
L = l
if r < R:
R = r
cnt = 0
if L <= R:
cnt = R - L + 1
print(cnt)
| 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()))
ans = 0
A = [0] * N
for i in range(M):
for j in range(L[i]-1,R[i]):
A[j] += 1
if A[j] == M:
ans += 1
print(ans) | N, M = list(map(int,input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int,input().split()))
ans = 0
A = [0] * N
L_max = max(L)
R_min = min(R)
if R_min >= L_max:
ans = R_min - L_max + 1
else:
ans = 0
print(ans) | p03037 |
N,M = list(map(int,input().split()))
L = []
R = []
count = 0
for j in range(M):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
for i in range(N+1):
if i >= max(L) and i <= min(R):
count += 1
print(count) | N,M = list(map(int,input().split()))
L = []
R = []
count = 0
for j in range(M):
l,r = list(map(int,input().split()))
L.append(l)
R.append(r)
print((max(0,min(R)-max(L)+1))) | p03037 |
N, M = list(map(int, input().split(" ")))
acc_gates = set([i for i in range(1, N+1)])
for m in range(M):
i, j = list(map(int, input().split(" ")))
tmp = set([n for n in range(i, j+1)])
acc_gates = acc_gates & tmp
print((len(set(acc_gates)))) | N, M = list(map(int, input().split(" ")))
min_l = 1
max_r = N
for m in range(M):
l, r = list(map(int, input().split(" ")))
if l > min_l:
min_l = l
if r < max_r:
max_r = r
ans = (max_r-min_l)+1
if ans < 0:
ans = 0
print(ans)
| p03037 |
n,m = list(map(int,input().split()))
lr = [[0]*2]*m
for i in range(m):
lr[i] = list(map(int,input().split()))
valid = set(range(1,n+1))
for i in range(m):
subleft = set(range(1,lr[i][0]))
subright = set(range(lr[i][1]+1,n+1))
valid.difference_update(subleft)
valid.difference_update(subright)
print((len(valid))) | n,m = list(map(int,input().split()))
lr = [[0]*2]*m
for i in range(m):
lr[i] = list(map(int,input().split()))
maxl = 0
minr = 10**5
for i in range(m):
maxl = max(maxl,lr[i][0])
minr = min(minr,lr[i][1])
if maxl>minr:
print((0))
else:
print((minr-maxl+1)) | p03037 |
import collections
N,M = list(map(int,input().split()))
s = []
count = 0
for _ in range(M):
a,b = list(map(int,input().split()))
if M==1:
print((b-a+1))
exit()
for i in range(a,b+1):
s.append(i)
k = collections.Counter(s)
for d in list(k.values()):
if d==M:
count+=1
print(count) | N,M = list(map(int,input().split()))
right = N
left = 1
for _ in range(M):
a,b = list(map(int,input().split()))
right = min(right,b)
left = max(left,a)
ans = right-left+1
print((max(0,ans))) | p03037 |
n, m = list(map(int, input().split()))
card_list = [1] * n
for i in range(m):
l, r = list(map(int, input().split()))
l -= 1
r -= 1
for j in range(n):
if l <= j <= r:
continue
card_list[j] = 0
print((sum(card_list)))
| n, m = list(map(int, input().split()))
card_list = [1] * n
minr = 10**9
maxl = 0
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 |
def main():
N, M = list(map(int, input().split()))
cards = list(range(1, N + 1))
for i in range(M):
L, R = list(map(int, input().split()))
cards = [x for x in cards if L <= x <= R]
print((len(cards)))
if __name__ == '__main__':
main()
| def main():
N, M = list(map(int, input().split()))
L, R = 0, 1001001
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)))
if __name__ == '__main__':
main()
| p03037 |
N,M=list(map(int,input().split()))
B=[0]*N
for i in range(M):
l,r=list(map(int,input().split()))
for j in range(l-1,r):
B[j]+=1
print((B.count(M))) | N,M=list(map(int,input().split()))
ml=0
mh=N
for i in range(M):
l,r=list(map(int,input().split()))
ml=max(ml,l)
mh=min(mh,r)
print((max(0,mh-ml+1))) | p03037 |
n, m = list(map(int, input().split()))
l_lst = list()
for i in range(m):
l_lst.append(input().split())
for i in range(0, len(l_lst)):
for j in range(0, len(l_lst[i])):
l_lst[i][j] = int(l_lst[i][j])
temp_cnt = 0
cnt = 0
for i in range(1, n+1):
# print(i)
for j in range(0, len(l_lst)):
if l_lst[j][0] <= i and i <= l_lst[j][1]:
temp_cnt += 1
if temp_cnt == len(l_lst):
cnt += 1
# temp_cnt = 0
temp_cnt = 0
print(cnt) | n, m = list(map(int, input().split()))
l_lst = list()
for i in range(m):
l_lst.append(input().split())
for i in range(0, len(l_lst)):
for j in range(0, len(l_lst[i])):
l_lst[i][j] = int(l_lst[i][j])
max_lst = list()
min_lst = list()
for i in range(0, len(l_lst)):
max_lst.append(l_lst[i][0])
min_lst.append(l_lst[i][1])
max_int = max(max_lst)
min_int = min(min_lst)
cnt = 0
for i in range(1, n+1):
if max_int <= i and i <= min_int:
cnt += 1
print(cnt) | p03037 |
from sys import stdin
N, G = list(map(int, stdin.readline().split()))
dic = {key: 0 for key in range(1, N + 1)}
left, right = N+1, -1
this, next = set(), set()
for i in range(G):
if i == 0:
l, r = list(map(int, stdin.readline().split()))
for j in range(l, r + 1):
this.add(j)
else:
l, r = list(map(int, stdin.readline().split()))
for j in range(l, r + 1):
if j in this:
next.add(j)
this = next
next = set()
print((len(this)))
| from sys import stdin, exit
N, G = list(map(int, stdin.readline().split()))
left, right = 1, N
for i in range(G):
l, r = list(map(int, stdin.readline().split()))
if l > left:
left = l
if r < right:
right = r
if right < left:
print((0))
exit()
print((right - left + 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()))
keys = list(range(1, N+1))
common = [x for x in keys if x>=max(L) and x<=min(R)]
print((len(common))) | N,M = list(map(int, input().split()))
L=[0]*M
R=[0]*M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
print((max(min(R)-max(L)+1,0))) | p03037 |
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(list(map(int,input().split())))
ans=n
for i in range(1,n+1):
for j in range(m):
if i<a[j][0] or a[j][1]<i:
ans=ans-1
break
print(ans)
| n,m=list(map(int,input().split()))
s=[]
l= 0
r = n
for i in range(m):
ln,rn=list(map(int,input().split()))
if ln>l:
l=ln
if rn<r:
r=rn
if r-l+1>0:
print((r-l+1))
else:
print((0))
| p03037 |
n,m=list(map(int,input().split()))
count=0
s=[0]*(n+1)
for i in range(m):
l,r=list(map(int,input().split()))
for j in range(l,r+1):
s[j]+=1
for i in range(n+1):
if s[i]==m:
count+=1
print(count) | n,m=list(map(int,input().split()))
count=0
s=[0]*(n+1)
L=0
R=10**5
for i in range(m):
l,r=list(map(int,input().split()))
L=max(l,L)
R=min(r,R)
if (R-L+1)>=0:
print((R-L+1))
else:
print((0)) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
gate = set(range(l, r+1))
for i in range(m-1):
l, r = list(map(int, input().split()))
gate = set(range(l, r+1)) & gate
print((len(gate))) | _, m = list(map(int, input().split()))
mi, mx = list(map(int, input().split()))
flag = False
for i in range(m-1):
l, r = list(map(int, input().split()))
if mi < l <= mx:
mi = l
if mi <= r < mx:
mx = r
if mx < l or r < mi:
flag = True
break
if flag:
print((0))
else:
print((mx - mi + 1))
| p03037 |
N, M = list(map(int, input().split()))
L, R = list(map(int, input().split()))
pool = set(range(L, R+1))
for i in range(M-1):
L, R = list(map(int, input().split()))
pool = set(range(L, R+1)).intersection(pool)
print((len(pool))) | N, M = list(map(int, input().split()))
L1, R1 = list(map(int, input().split()))
flag = 0
def find_key(L1,R1,L2,R2):
if R1 < L2 or R2 < L1:
return(False)
else:
a = [R1,L1,R2,L2]
a.sort()
return(a[1],a[2])
for i in range(M - 1):
L,R = list(map(int, input().split()))
if find_key(L1,R1,L,R) != False:
L1,R1 = find_key(L1,R1,L,R)
else:
flag = 1
print((0))
break
if flag == 0:
print((R1-L1+1)) | p03037 |
n,M=list(map(int,input().split()))
lr=[list(map(int,input().split())) for i in range(M)]
cnt=0
for i in range(1,n+1):
sub=0
for m in range(M):
if i>=lr[m-1][0] and i<=lr[m-1][1]:sub+=1
if sub==M:cnt+=1
# print('i:',i,'l:',lr[m-1][0],'r:',lr[m-1][1],'sub:',sub)
print(cnt)
| n,m=list(map(int,input().split()))
L,R=0,n
for _ in range(m):
l,r=list(map(int,input().split()))
L,R=max(L,l),min(R,r)
print((max(R-L+1,0))) | p03037 |
n,m =list(map(int,input().split()))
a=[1]*n
b=[0]*n
for i in range(m):
l,r=list(map(int,input().split()))
if l==1:
a[r:]=b[r:]
else:
a[:l-1]=b[:l-1]
a[r:]=b[r:]
print((sum(a))) | 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)
if l>r:
print((0))
else:
print((r-l+1))
| p03037 |
n, m = list(map(int, input().split()))
l = 0
r = n
for i in range(m):
lt, rt = list(map(int, input().split()))
l = max(l, lt)
r = min(r, rt)
if(l<=r):
print((r - l + 1))
else:
print((0))
| n, m = list(map(int, input().split()))
l = 0
r = n
for i in range(m):
lt, rt = list(map(int, input().split()))
if (lt > l):
l = lt
if (rt < r):
r = rt
if (r <l):
print((0))
else:
print((r-l+1))
| p03037 |
N,M=list(map(int,input().split()))
x={i for i in range(10**5+1)}
for _ in range(M):
L,R=list(map(int,input().split()))
tmp={i for i in range(L,R+1)}
x=x&tmp
print((len(x))) | 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)
Lm=max(L)
Rm=min(R)
print((Rm-Lm+1 if Rm-Lm>=0 else 0)) | p03037 |
n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
tmp = [0] * n
def add_one(x):
return x + 1
for i in range(m):
l = lr[i][0] - 1
r = lr[i][1] - 1
tmp[l: r+1] = list(map(add_one, tmp[l: r + 1]))
counter = 0
for j in range(n):
if tmp[j] == m:
counter += 1
print(counter)
| n, m = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
l_list = [_lr[0] for _lr in lr]
r_list = [_lr[1] for _lr in lr]
a = min(r_list)
b = max(l_list)
print((max(a - b + 1, 0)))
| p03037 |
n,m = list(map(int, input().split()))
keys = []
for i in range(m):
l,r = list(map(int, input().split()))
keys.append([l,r])
cnt = 0
for key in range(1, n+1):
for x, y in keys:
if key < x or key > y:
cnt -= 1
break
cnt += 1
print(cnt) | n,m = list(map(int, input().split()))
l_lst, r_lst = [], []
for i in range(m):
l,r = list(map(int, input().split()))
l_lst.append(l)
r_lst.append(r)
res = min(r_lst)-max(l_lst)+1
if res > 0:
print(res)
else:
print((0)) | p03037 |
n,m = list(map(int,input().split(" ")))
card = {i+1 for i in range(n)}
for i in range(m):
l,r = list(map(int,input().split(" ")))
tmp = set()
for j in range(l,r+1):
tmp.add(j)
card = card.intersection(tmp)
print((len(card))) | n,m = list(map(int,input().split(" ")))
x,y = list(map(int,input().split(" ")))
for i in range(m-1):
l,r = list(map(int,input().split(" ")))
x = max(x,l)
y = min(y,r)
if y-x >= 0:
print((y-x+1))
else:
print((0))
| p03037 |
n,m = list(map(int,input().split()))
key = [i+1 for i in range(n)]
for i in range(m):
l,r = list(map(int,input().split()))
new_key = [i for i in range(l,r+1)]
key = list(set(new_key) & set(key))
print((len(key)))
| n,m = list(map(int,input().split()))
key = [i+1 for i in range(n)]
lmax = 0
rmin = 10**5
for i in range(m):
l,r = list(map(int,input().split()))
lmax = max(l,lmax)
rmin = min(r,rmin)
num = rmin-lmax+1
print((num if num>0 else 0)) | p03037 |
inf = input().split()
N = int(inf[0])
M = int(inf[1])
ls = []
m = 0
for i in range(M):
inf = input().split()
L = int(inf[0])-1
R = int(inf[1])-1
x = max(L,R)
if x > m:
m = x
ls += [(L,R)]
ans = [True]*(m+1)
for s in ls:
ans[:s[0]] = [False]*len(ans[:s[0]])
ans[s[1]+1:] = [False]*len(ans[s[1]+1:])
print((sum(ans))) | inf = input().split()
N = int(inf[0])
M = int(inf[1])
ls = []
m = 0
pair = [0,N]
for i in range(M):
inf = input().split()
L = int(inf[0])
R = int(inf[1])
pair[0] = max(pair[0], L)
pair[1] = min(pair[1], R)
if pair[0]>pair[1]:
print((0))
break
else:
print((pair[1]-pair[0]+1)) | p03037 |
N,M=list(map(int,input().split()))
A=list(range(N))
ans=0
for i in range(M):
L,R=list(map(int,input().split()))
for j in range(N):
if A[j]+1<L or R<A[j]+1:
A[j]=-1
for k in range(N):
if A[k]!=-1:
ans=ans+1
print(ans) | N,M=list(map(int,input().split()))
ans,L,R=0,0,N
for i in range(M):
Ltmp,Rtmp=list(map(int,input().split()))
if L<Ltmp:
L=Ltmp
if R>Rtmp:
R=Rtmp
if L<=R:
ans=R-L+1
print(ans) | p03037 |
N,M = list(map(int,input().split()))
X = [list(map(int,input().split())) for n in range(M)]
L = [0]*N
for m in range(M):
for g in range(X[m][0],X[m][1]+1):
L[g-1]+=1
print((L.count(M))) | N,T = list(map(int,input().split()))
X = [list(map(int,input().split())) for n in range(T)]
M = N
m = 0
for a,b in X:
M = min(M,b)
m = max(m,a)
if M<m:
print((0))
else:
print((M-m+1)) | p03037 |
n, m = list(map(int, input().split()))
l = [nu for nu in range(1, n + 1)]
for i in range(m):
L, R = list(map(int, input().split()))
card = [nu for nu in range(L, R + 1)]
l = list(set(l) & set(card))
print((len(l)))
| n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
li = []
for _ in range(m - 1):
l_, r_ = list(map(int, input().split()))
l = max(l, l_)
r = min(r, r_)
print((max(r - l + 1, 0)))
| p03037 |
from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
data = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
for i in range(M):
id = list(range(data[i][0],data[i][1]+1))
if i == 0:
num = id
else:
num = set(num) & set(id)
print((len(num))) | from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
data = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
min_id =0
max_id = 100000
for i in range(M):
min_id = max(min_id,data[i][0])
max_id = min(max_id,data[i][1])
num = max_id - min_id + 1 if max_id - min_id >= 0 else 0
print(num) | p03037 |
def main():
n, m = list(map(int, input().split()))
l = []
r = []
ans = 0
for i in range(m):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
for i in range(1, n+1):
if i >= max(l) and i <= min(r):
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
l = []
r = []
ans = 0
for i in range(m):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
ml = max(l)
mr = min(r)
for i in range(1, n+1):
if i >= ml and i <= mr:
ans += 1
print(ans)
if __name__ == '__main__':
main() | p03037 |
from collections import defaultdict
n,m=list(map(int,input().split()))
d = defaultdict(int)
for i in range(m):
s, e = list(map(int,input().split()))
for j in range(s,e+1):
j = str(j)
d[j] += 1
#print(d)
count = 0
for k,v in list(d.items()):
if v==m:
count+=1
print(count) | n,m=list(map(int,input().split()))
mi = 0
ma = 10**5+1
for i in range(m):
s,e = list(map(int,input().split()))
if s > mi:
mi = s
# print('mi',mi)
if e < ma:
ma = e
# print('ma',ma)
print((max(ma-mi+1,0))) | p03037 |
n,m=list(map(int,input().split()))
mi = 0
ma = 10**5+1
for i in range(m):
s,e = list(map(int,input().split()))
if s > mi:
mi = s
# print('mi',mi)
if e < ma:
ma = e
# print('ma',ma)
print((max(ma-mi+1,0))) | n,m=list(map(int,input().split()))
mir = n
mal = 0
for _ in range(m):
l,r = list(map(int,input().split()))
if l > mal:
mal = l
if r < mir:
mir = r
print((0 if mir-mal < 0 else (mir-mal)+1)) | p03037 |
# -*- coding: utf-8 -*-
# import numpy as np
n, m = list(map(int, input().split()))
t = [0]*n
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(n):
if l<=j+1 and r>=j+1:
t[j] += 1
print((t.count(m))) | # -*- coding: utf-8 -*-
# import numpy as np
n, m = list(map(int, input().split()))
l_min = 1
r_max = n+1
for i in range(m):
l, r = list(map(int, input().split()))
l_min = max(l_min, l)
r_max = min(r_max, r)
ans = r_max - l_min + 1
if ans > 0:
print(ans)
else:
print((0))
| p03037 |
n,m=list(map(int,input().split()))
cards=set([i+1 for i in range(n)])
for j in range(m):
l,r = list(map(int,input().split()))
gates = set([j for j in range(l,r+1)])
cards = cards&gates
print((len(cards)))
| n,m=list(map(int,input().split()))
l = 1
r = n
for j in range(m):
l_i,r_i = list(map(int,input().split()))
l = max(l,l_i)
r = min (r,r_i)
if r>=l:
print((r-l+1))
else:
print((0))
| p03037 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
k = [0]*N
for i in range(M):
l, r = list(map(int, input().split()))
for q in range(l-1, r):
k[q] += 1
ans = 0
for k_ in k:
if k_ == M:
ans +=1
print(ans) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
ans = -1
l_min , r_max = list(map(int, input().split()))
for i in range(M-1):
l, r = list(map(int, input().split()))
if r_max < l or r < l_min:
ans = 0
break
if l_min <= l and l <= r_max:
l_min = l
if l_min <= r and r <= r_max:
r_max = r
if ans == 0:
print(ans)
else:
print((r_max - l_min + 1)) | p03037 |
import sys
input = sys.stdin.readline
N,M = list(map(int, input().split()))
cards = [1] * N
for _ in range(M):
l,r = list(map(int, input().split()))
for i in range(l-1):
cards[i] = 0
for i in range(r,N):
cards[i] = 0
print((sum(cards))) | N,M = list(map(int, input().split()))
l = 0
r = N
for m in range(M):
L,R = list(map(int, input().split()))
if L > l:
l = L
if R < r:
r = R
print((max(r-l+1,0))) | p03037 |
N,M = list(map(int, input().split()))
L,R = [],[]
for _ in range(M):
l,r = list(map(int, input().split()))
L.append(l)
R.append(r)
print((max(min(R)-max(L)+1,0))) | import sys
N,M = list(map(int, input().split()))
D = sys.stdin
L = []
R = []
for d in D:
l,r = list(map(int, d.split()))
L.append(l)
R.append(r)
print((max(min(R)-max(L)+1,0))) | p03037 |
import sys
N,M = list(map(int, input().split()))
D = sys.stdin
L = []
R = []
for d in D:
l,r = list(map(int, d.split()))
L.append(l)
R.append(r)
print((max(min(R)-max(L)+1,0))) | import sys
N,M = list(map(int, input().split()))
D = sys.stdin
l = 0
r = N
for d in D:
L,R = list(map(int, d.split()))
if L > l:
l = L
if R < r:
r = R
print((max(r-l+1,0))) | p03037 |
#ABC 127 C Prison
N,M= list(map(int,input().split()))
ans=None
for i in range(M):
L,R= list(map(int,input().split()))
tmp=set([i for i in range(L,R+1)])
if ans is None:
ans=tmp
else:
ans=ans & tmp
print((len(ans))) | #ABC 127 C Prison
N,M= list(map(int,input().split()))
MIN=0
MAX=N
for i in range(M):
L,R= list(map(int,input().split()))
MAX=min(MAX,R)
MIN=max(MIN,L)
ans =MAX-MIN+1
if ans <0:
print((0))
else:
print(ans) | p03037 |
N, M = list(map(int, input().split()))
for i in range(M):
L, R = list(map(int, input().split()))
pass_card = [i for i in range(L, R+1)]
if i == 0:
ans = pass_card
elif i > 0:
ans = set(ans) & set(pass_card)
print((len(ans))) | N, M = list(map(int, input().split()))
L_list = []
R_list = []
for i in range(M):
L, R = list(map(int, input().split()))
L_list.append(L)
R_list.append(R)
L = max(L_list)
R = min(R_list)
if R < L:
print((0))
else:
print((R - L + 1)) | p03037 |
N, M= list(map(int, input().split()))
L1, R1= list(map(int, input().split()))
Ans = set(range(L1, R1+1))
for x in range(M-1):
L, R = list(map(int, input().split()))
List = set(range(L, R+1))
Ans = (Ans) & (List)
print((len(Ans))) | N, M= list(map(int, input().split()))
L1, R1= list(map(int, input().split()))
for x in range(M-1):
L, R = list(map(int, input().split()))
if L > L1:
L1 = int(L)
if R < R1:
R1 = int(R)
if R1 == L1:
print("1")
if L1 > R1:
print("0")
if L1 < R1:
print((R1-L1+1)) | p03037 |
import sys
input = sys.stdin.readline
import collections
def main():
N, M = list(map(int, input().split()))
arr = []
for x in range(M):
L, R = list(map(int, input().split()))
for y in range(L, R+1):
arr.append(y)
arrcnt = list(collections.Counter(arr).values())
print((sum(i == M for i in arrcnt)))
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
import collections
def main():
N, M = list(map(int, input().split()))
for i in range(M):
L, R = list(map(int, input().split()))
if i == 0:
ori_arr = set(range(L, R+1))
continue
next_arr = set(range(L, R+1))
ori_arr = set(ori_arr & next_arr)
print((len(ori_arr)))
if __name__ == '__main__':
main() | p03037 |
import sys
input = sys.stdin.readline
import collections
def main():
N, M = list(map(int, input().split()))
for i in range(M):
L, R = list(map(int, input().split()))
if i == 0:
ori_arr = set(range(L, R+1))
continue
next_arr = set(range(L, R+1))
ori_arr = set(ori_arr & next_arr)
print((len(ori_arr)))
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
import collections
def main():
N, M = list(map(int, input().split()))
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
ans = (int(min(R)) - int(max(L)) + 1)
if ans < 0:
print('0')
else:
print(ans)
if __name__ == '__main__':
main() | p03037 |
N,M = list(map(int,input().split()))
tempL,tempR = list(map(int,input().split()))
gate_id = set(range(tempL,tempR+1))
for i in range(M-1):
tempL,tempR = list(map(int,input().split()))
temp_id = set(range(tempL,tempR+1))
gate_id = gate_id & temp_id
print((len(gate_id))) | N,M = list(map(int,input().split()))
gateid = [list(map(int,input().split())) for i in range(M)]
idleft = max(gateid,key=lambda x:x[0])
idright = min(gateid,key=lambda x:x[1])
ans = idright[1]-idleft[0]+1
if ans<0:
ans = 0
print(ans) | p03037 |
#C
n, m = list(map(int, input().split()))
l = []
r = []
for i in range(m):
lin = list(map(int, input().split()))
l.append(lin[0])
r.append(lin[1])
lma = max(l)
rmi = min(r)
if lma > rmi:
print((0))
else:
print((rmi - lma + 1)) | #C
n, m = list(map(int, input().split()))
l = []
r = []
for _ in range(m):
tmp=list(map(int,input().split()))
l.append(tmp[0])
r.append(tmp[1])
lmax = max(l)
rmin = min(r)
# print(lmax,rmin)
if rmin >= lmax:
print((rmin -lmax + 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.