problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s770539167 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
L = []
R = []
L_append = L.append
R_append = R.append
for l, r in LR:
L.append(l)
R.append(r)
min_R = min(R)
max_L = max(L)
if min_R >= max_L:
ans = min_R +1 - max_L
else:
ans = 0
print(ans) |
p03037 | s241127908 | Accepted | N,M=map(int,input().split())
LR=[list(map(int,input().split())) for _ in range(M)]
l=1
r=N
for i in LR:
#print(i)
if i[0]>l:
l=i[0]
if i[1]<r:
r=i[1]
if r>=l:
print(r-l+1)
else:
print(0) |
p03037 | s110688910 | Accepted | def main():
N, M = list(map(int, input().split(' ')))
max_l, min_r = 1, N
for _ in range(M):
L, R = list(map(int, input().split(' ')))
max_l = max([max_l, L])
min_r = min([min_r, R])
print(max([min_r - max_l + 1, 0]))
if __name__ == '__main__':
main()
|
p03037 | s935102471 | Accepted | #
import sys
input=sys.stdin.readline
def main():
N,M=map(int,input().split())
lr=[tuple(map(int,input().split())) for i in range(M)]
imos=[0]*(N+2)
cnt=0
for i in lr:
imos[i[0]]+=1
imos[i[1]+1]-=1
for j in range(N+1):
imos[j+1]+=imos[j]
for i in imos:
if i ... |
p03037 | s777147520 | Accepted | if __name__ == "__main__":
n, m = map(int, input().split())
l = 1
r = n
for _ in range(m):
li, ri = map(int, input().split())
if l < li:
l = li
if r > ri:
r = ri
print(max(r-l+1,0)) |
p03037 | s256523544 | Accepted | l = input().split(" ")
n = int(l[0])
m = int(l[1])
r = []
l = []
for i in range(m):
gatei = input().split(" ")
li = int(gatei[0])
ri = int(gatei[1])
l.append(li)
r.append(ri)
l.sort()
r.sort()
count = r[0] - l[m-1] + 1
if count >= 0:
print(count)
else:
print(0) |
p03037 | s313309034 | Accepted | n, m = map(int,input().split())
l_lis = []
r_lis = []
for _ in range(m):
tmp = list(map(int,input().split()))
l_lis.append(tmp[0])
r_lis.append(tmp[1])
ll = max(l_lis)
rr = min(r_lis)
count = rr - ll + 1
if count <= 0:
print(0)
else:
print(count) |
p03037 | s460245600 | Accepted | def main():
N, M = map(int, input().split())
L, R = 0, 1001001
for i in range(M):
l, r = map(int, input().split())
L = max(L, l)
R = min(r, R)
print(max(0, R - L + 1))
if __name__ == '__main__':
main()
|
p03037 | s623539718 | Accepted | n,m=map(int,input().split())
low=1
high=n
for _ in range(m):
l,r=map(int,input().split())
low=max(l,low)
high=min(r,high)
if high-low+1>=0:
print(high-low+1)
else:
print(0) |
p03037 | s200998623 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = map(int, input().split())
L, R = 0, float('inf')
for _ in range(M):
l, r = map(int, input().split())
L = max(L, l)
R = min(R, r)
print(max(R - L + 1, 0))
if __name__ == "__main__":
main()
|
p03037 | s904034846 | Accepted | import sys
sys.setrecursionlimit(10**6)
n, m = map(int, input().split())
L = []; R = []
for _ in range(m):
l, r = map(int, input().split())
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
ans = max(0, minR-maxL+1)
print(ans) |
p03037 | s512375451 | Accepted | n ,m = map(int, input().split())
L = []
R = []
for i in range(m):
l, r = input().split()
L.append(int(l))
R.append(int(r))
x = min(R) - max(L) + 1
print(x if x > 0 else "0") |
p03037 | s340972242 | Accepted | N,M=map(int,input().split())
LR=set(range(N+1))
l=[]
r=[]
for i in range(M):
L,R=map(int,input().split())
l.append(L)
r.append(R)
ans=min(r)-max(l)+1
if ans<0:
ans=0
print(ans) |
p03037 | s614326702 | Accepted | def myAnswer(N,M,L,R) -> int:
MAXL=max(L)
MINR =min(R)
ans = [i for i in range(1,N+1) if(MAXL<= i and MINR >= i)]
return len(ans)
def modelAnswer():
tmp=1
def main():
N, M = map(int,input().split())
L =[]
R = []
for _ in range(M):
l,r = map(int,input().split())
L.append(l)
... |
p03037 | s243663792 | Accepted | n,m=map(int,input().split())
l,r=1,n
for i in range(m):
L,R=map(int,input().split())
l=max(l,L)
r=min(r,R)
if l>r:
print(0)
else:
print(r-l+1)
|
p03037 | s223819882 | Accepted | n,m = map(int, input().split())
min_ = 1
max_ = 10**5
for i in range(m):
l,r = map(int, input().split())
min_ = max(min_, l)
max_ = min(max_, r)
ans = max(0, max_ - min_ + 1)
print(ans) |
p03037 | s229728915 | Accepted | N,M = map(int,input().split())
L = [0] * (M)
R = [0] * (M)
for i in range(M):
L[i],R[i] = map(int,input().split())
l = max(L)
r = min(R)
if l <= r:
ans = r-l+1
else:
ans = 0
print(ans) |
p03037 | s849336630 | Accepted | #!/usr/bin/env python3
def main():
N, M = map(int, input().split())
L =[0 for i in range(M)]
R = [0 for i in range(M)]
for i in range(0, M):
L[i], R[i] = map(int, input().split())
print(max(min(R) - max(L) + 1, 0))
main() |
p03037 | s378863547 | Accepted | n,m = map(int,input().split())
llist = []
rlist = []
for i in range(m):
l,r = map(int,input().split())
llist += [l]
rlist += [r]
print(max(0,min(rlist)-max(llist)+1))
|
p03037 | s482388298 | Accepted | n,m = map(int,input().split())
ans = [1, n]
for _ in range(m):
l,r = map(int,input().split())
ans[0] = max(l, ans[0])
ans[1] = min(r, ans[1])
if ans[1] - ans[0] >= 0:
print(ans[1] - ans[0] + 1)
else:
print(0)
|
p03037 | s697581843 | Accepted | N,M = map(int,input().split())
min = 0
max = N
for _ in range(M):
L_i,R_i = map(int,input().split())
if L_i > min:
min = L_i
if R_i < max:
max = R_i
if min > max:
print(0)
else:
print(max - min + 1)
|
p03037 | s098675673 | Accepted | n,m = map(int, input().split())
left = 1
right = n
for i in range(m):
a, b = map(int, input().split())
left = max(left, a)
right = min(right,b)
print(max(right - left +1 , 0))
|
p03037 | s235030464 | Accepted | n,m = 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 | s568450890 | Accepted | n,m=map(int,input().split())
L=[0]*m
R=[0]*m
ans=0
for i in range(m):
L[i],R[i]=map(int,input().split())
print(max(0,(min(R)-max(L)+1)))
|
p03037 | s005166147 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[7]:
N,M = map(int, input().split())
lr = []
l_max = 1
r_min = N
for _ in range(M):
lr.append(list(map(int, input().split())))
l_max = max(l_max, lr[-1][0])
r_min = min(r_min, lr[-1][1])
print(max(0, r_min - l_max +1))
# In[ ]:
|
p03037 | s710807441 | Accepted | n,m=map(int,input().split())
ll,rr=0,n
for i in range(m):
l,r=map(int,input().split())
ll=max(l,ll)
rr=min(r,rr)
print(max(rr-ll+1,0)) |
p03037 | s326702519 | Accepted | N, M = map(int, input().split())
L_list = []
R_list = []
for i in range(M):
L, R = map(int, input().split())
L_list.append(L)
R_list.append(R)
if min(R_list) - max(L_list) < 0:
print("0")
else:
print(min(R_list) - max(L_list) + 1) |
p03037 | s374924764 | Accepted | n,m = map(int,input().split())
lScope = []
rScope = []
ans = 0
for i in range(m):
l,r = map(int,input().split())
lScope.append(l)
rScope.append(r)
# k in keyScope[i] (i= 0~m) を確かめたい
if min(rScope) >= max(lScope):
print(min(rScope) - max(lScope) + 1)
else:
print(0) |
p03037 | s572815732 | Accepted | n,m = map(int,input().split())
count = 0
lmax = 0
rmin = 100000
for i in range(m):
l,r = map(int,input().split())
lmax = max(l,lmax)
rmin = min(r,rmin)
print(max(rmin-lmax+1,0)) |
p03037 | s883358450 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
ans =[0] * (n + 1)
for l, r in LR:
ans[l - 1] += 1
ans[r] -= 1
accu =[0] * (n + 1)
for i in range(n):
accu[i + 1] += ans[i] + accu[i]
ans = accu.count(m)
print(ans) |
p03037 | s654569871 | Accepted | N, M = map(int, input().split())
L = []
R = []
for _ in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
l = max(L)
r = min(R)
print(r-l+1 if r-l+1 > 0 else 0) |
p03037 | s905008875 | Accepted | n, m = map(int, input().split())
start = 1
end = n
for i in range(m):
l, r = map(int, input().split())
if start < l:
start = l
if r < end:
end = r
print(max(end - start + 1, 0)) |
p03037 | s365219385 | Accepted | n, m = map(int, input().split())
left = 1
right = n
for _ in range(m):
l, r = map(int, input().split())
left = max(left, l)
right = min(right, r)
if left <= right:
print(right - left + 1)
else:
print("0")
|
p03037 | s312548596 | Accepted | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = right - left
print(ans + 1 if ans >= 0 else 0)
|
p03037 | s294713097 | Accepted | n,m=map(int,input().split())
l=[]
r=[]
for i in range(m):
templ,tempr=map(int,input().split())
l.append(templ)
r.append(tempr)
l_max=max(l)
r_min=min(r)
if l_max<=r_min:
print(r_min-l_max+1)
else:
print(0)
|
p03037 | s992914631 | Accepted | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: map(str, sys.stdin.buffer.readline().split())
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(... |
p03037 | s217704345 | Accepted | n,m=map(int,input().split())
count=0
s=[0]*(n+1)
L=0
R=10**5
for i in range(m):
l,r=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 | s783677797 | Accepted |
N, M=map(int, input().split()) #複数数値入力 「A B」みたいなスペース空いた入力のとき
LR=[[int(i) for i in input().split()] for i in range(M)] # 二次元配列入力 二次元マップみたいな入力のとき
mi, ma = 0, 10**5
for i in LR:
mi = max(mi, i[0])
ma = min(ma, i[1])
if ma-mi < 0:
print(0)
else:
print(ma-mi + 1) |
p03037 | s513914508 | Accepted | 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(inter... |
p03037 | s134888377 | Accepted | n = list(map(int, input().split()))
N = n[0]
M = n[1]
X = []
Y = []
for i in range(M):
a = list(map(int, input().split()))
X.append(a[0])
Y.append(a[1])
v=0
w=0
x=max(X)
y=min(Y)
if y>=x:
print(y-x+1)
else:
print(0)
|
p03037 | s126727966 | Accepted | N, M = map(int, input().split())
maxL = 0
minR = N
for i in range(M):
L, R = map(int, input().split())
maxL = max(maxL, L)
minR = min(minR, R)
if minR - maxL >= 0:
print(minR - maxL + 1)
else:
print(0) |
p03037 | s381741186 | Accepted | N, M = map(int, input().split())
table = [[int(i) for i in input().split()] for _ in range(M)]
ans = [table[0][0], table[0][1]]
cnt = 0
for i in table[1:]:
if ans[0] <= i[0] <= ans[1]:
ans[0] = i[0]
if ans[0] <= i[1] <= ans[1]:
ans[1] = i[1]
if ans[1] < i[0] or i[1] < ans[0]:
cnt +... |
p03037 | s609734010 | Accepted | N, M = map(int, input().split())
L = list()
R = list()
for i in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
num = 0
for j in range(maxL,minR+1):
num +=1
print(num) |
p03037 | s915136437 | Accepted |
def main():
n,m = map(int,input().split())
lm = 1
rm = n
for i in range(m):
l,r = map(int,input().split())
lm = max(lm,l)
rm = min(rm,r)
print(max(0,rm-lm+1))
if __name__ == "__main__":
main()
|
p03037 | s090087159 | Accepted | N, M = map(int, input().split())
for m in range(M):
L, R = map(int, input().split())
if m==0:
l = L
r = R
else:
if l<L:
l = L
if R<r:
r = R
print(len(list(range(l,r+1)))) |
p03037 | s925627359 | Accepted | N,M=map(int,input().split())
ans=0
L,R=0,(10**5)+1
for i in range(M):
l,r=map(int,input().split())
L=max(L,l); R=min(R,r)
if r<l: break
R=min(R,N)
print(abs((L-1)-R) if 0<=R-L else 0) |
p03037 | s407850478 | Accepted | n, m = map(int, input().split())
left = 1
right = n
for _ in range(m):
l, r = map(int, input().split())
if l > left:
left = l
if r < right:
right = r
print(max(0, right - left + 1)) |
p03037 | s060204003 | Accepted | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
list_LR = [list(map(int, input().split())) for i in range(M)]
... |
p03037 | s342142975 | Accepted | N, M = map(int, input().split())
L, R = [0]*M, [0]*M
for i in range(M):
L[i],R[i] = map(int, input().split())
a, b = max(L), min(R)
if a<=b:
print(b-a+1)
else:
print(0) |
p03037 | s806518452 | Accepted | n,m=map(int,input().split())
r=[0]*m
l=[0]*m
for i in range(m):
l[i],r[i]=map(int,input().split())
p=min(r)-max(l)+1
if p>0:
print(p)
else:
print(0) |
p03037 | s403249419 | Accepted | N, M = map(int, input().split())
Lmi, Lma = [], []
for i in range(M):
mi, ma = map(int, input().split())
Lmi.append(mi)
Lma.append(ma)
r = max(min(Lma) - max(Lmi) + 1, 0)
print(r)
|
p03037 | s693187808 | Accepted | N, M = list(map(int,input().rstrip().split()))
Amin = 1
Amax = N
for i in range(M):
L, R = list(map(int,input().rstrip().split()))
Amin = max(Amin,L)
Amax = min(Amax,R)
if Amin>Amax:
print(0)
break
else:
print(Amax-Amin+1) |
p03037 | s897969323 | Accepted | import sys
import numpy as np
n, m, *lr = map(int, sys.stdin.read().split())
l, r = np.array(lr).reshape(-1, 2).T
def main():
res = max(0, r.min() - l.max() + 1)
print(res)
if __name__ == '__main__':
main() |
p03037 | s955203037 | Accepted | n,m=map(int,input().split())
p=[0]*(n+1)
for _ in range(m):
l,r=map(int,input().split())
p[l-1]+=1
p[r]-=1
for i in range(n):
p[i+1]+=p[i]
print(p.count(m)) |
p03037 | s103417483 | Accepted | N, M = map(int, input().split())
maxL = 0
minR = N-1
LR = [0, N-1]
for i in range(M):
LR = [int(i)-1 for i in input().split()]
maxL = max(maxL, LR[0])
minR = min(minR, LR[1])
if minR-maxL>=0:
print(minR-maxL+1)
else:
print(0)
|
p03037 | s680045052 | Accepted | N, M = map(int,input().split())
maxL = 0
minR = 10 ** 9
for i in range(M):
L, R = map(int,input().split())
maxL = max(maxL,L)
minR = min(minR,R)
print(max(0,minR - maxL + 1)) |
p03037 | s884765755 | Accepted | n, m = map(int, input().split())
inf = 0
sup = 100001
for i in range(m) :
l, r = map(int, input().split())
inf = max(inf, l)
sup = min(sup, r)
if sup >= inf :
print(sup-inf+1)
else :
print("0")
|
p03037 | s174935187 | Accepted | n,m = map(int,input().split())
left = 0
right = n
for i in range(m):
l,r = map(int,input().split())
left = max(left,l)
right = min(right,r)
print(max(0,right-left+1)) |
p03037 | s409470862 | Accepted | n, m = map(int, input().split())
l, r = [], []
for i in range(m):
tmpa, tmpb = map(int, input().split())
l.append(tmpa)
r.append(tmpb)
print(min(r) - max(l) + 1 if min(r) >= max(l) else 0)
|
p03037 | s804011658 | Accepted | import numpy as np
N,M = map(int,input().split())
A = (N+2)*[0]
for m in range(M):
L,R = map(int,input().split())
A[L]+=1
A[R+1]-=1
A = np.cumsum(A)
print(sum(a==M for a in A)) |
p03037 | s370400997 | Accepted | n,m=map(int,input().split())
l=1
r=n
for i in range(m):
li,ri=map(int,input().split())
l = max(l,li)
r = min(r,ri)
print(max(r-l+1,0)) |
p03037 | s231701016 | Accepted | N, M = map(int, input().split())
max_L, min_R = 1, N
for i in range(M):
L, R = map(int, input().split())
if L > max_L:
max_L = L
if R < min_R:
min_R = R
ans = min_R - max_L + 1
if ans < 0:
ans = 0
print(ans) |
p03037 | s459072431 | Accepted | N, M = map(int, input().split())
ID = list()
for i in range(M):
ID.append(list(map(int, input().split())))
nega = 0
posi = N
check = 1
for (L, R) in ID:
if L > nega:
nega = L
if R < posi:
posi = R
if R < nega or posi < L:
check = 0
if check == 1:
print(posi-nega+1)
else:
... |
p03037 | s666281920 | Accepted | def solve(l,r):
l_max = max(l)
r_min = min(r)
return max(r_min - l_max + 1, 0)
N,M = map(int,input().split())
L = [0]*M
R = [0]*M
for i in range(M):
L[i],R[i] = map(int,input().split())
print(solve(L,R))
|
p03037 | s543265318 | Accepted | n,m = map(int,input().split())
gate_list = [ list(map(int,input().split())) for i in range(m)]
#print(gate_list)
ans1 = gate_list[0][0]
ans2 = gate_list[0][1]
for i in range(1,m):
ans1 = max(ans1,gate_list[i][0])
for i in range(1,m):
ans2 = min(ans2,gate_list[i][1])
ans = ans2 - ans1
if ans < 0:
print(0)
el... |
p03037 | s110294811 | Accepted | n,m = 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 | s394140633 | Accepted | import numpy as np
def main():
N, M = map(int, input().split())
maxl = -float('inf')
minr = float('inf')
for _ in range(M):
l, r = map(int, input().split())
if l >= maxl:
maxl = l
if r <= minr:
minr = r
val = minr - maxl + 1
if val >= 0:
pr... |
p03037 | s483293368 | Accepted | n,m = map(int, input().split())
ls = []
rs = []
for _ in range(m):
l,r = map(int, input().split())
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0: print(ans)
else: print(0) |
p03037 | s178663260 | Accepted | n,m = map(int,input().split())
l = [list(map(int,input().split())) for i in range(m)]
left = [i[0] for i in l]
right = [i[1] for i in l]
max_left = max(left)
min_right = min(right)
ans = min_right - max_left
if ans < 0:
print(0)
else:
print(ans+1) |
p03037 | s320463885 | Accepted | n,m = map(int,input().split())
l,r = map(int,input().split())
for i in range(m-1):
nl,nr = map(int,input().split())
if l<nl :
l = nl
if r > nr:
r = nr
print(max(r-l + 1, 0))
|
p03037 | s841639948 | Accepted | n,m = map(int, input().split())
lmax = 0
rmin = int(1e10)
for _ in range(m):
l,r = map(int, input().split())
lmax = max(l, lmax)
rmin = min(r, rmin)
ans = max(0, rmin - lmax + 1)
print(ans)
|
p03037 | s773277253 | Accepted | N, M = map(int,input().split())
left = 1
right = N
for _ in range(M):
L, R = map(int,input().split())
if L > left:
left = L
if R < right:
right = R
a = right - left
print(max(0, a + 1)) |
p03037 | s316676347 | Accepted | N, M = map(int, input().split())
LL = 0
RR = N
for i in range(M):
L, R = map(int, input().split())
if LL < L:
LL = L
if RR > R:
RR = R
print(max(0, RR - LL + 1))
|
p03037 | s264922113 | Accepted | n,m=map(int,input().split())
s,t=map(int,input().split())
for i in range(m-1):
x,y=map(int,input().split())
if s<x:
s=x
if t>y:
t=y
print(max(0,t-s+1)) |
p03037 | s375609155 | Accepted | n,m = map(int,input().split())
l = [0]*m
r = [0]*m
for i in range(m):
l[i],r[i] = map(int,input().split())
if min(r)-max(l) < 0:
print(0)
else:
print(min(r)-max(l)+1) |
p03037 | s714107802 | Accepted | n,m,*a=map(int,open(0).read().split())
b=min(a[1::2])-max(a[::2])+1
print(b if b>0 else 0) |
p03037 | s909413910 | Accepted | n, m = map(int, input().split())
list_score = [ list(map(int,input().split(" "))) for i in range(m)]
left = 1
right = n
for i in range(m):
k = list_score[i]
if left < k[0]:
left = k[0]
if right > k[1]:
right = k[1]
if left > right:
print(0)
else:
print(right-left+1)
|
p03037 | s392007411 | Accepted | n,m=map(int,input().split())
hidari=-10**100
migi=10**100
keep=1
for i in range(m):
l,r=map(int,input().split())
if l>migi or r<hidari:
keep=0
break
elif hidari<=l<=r<=migi:
hidari=l
migi=r
elif l<=hidari<=migi<=r:
pass
elif l<=hidari<=r<=migi:
migi=r
elif hidari<=l<=migi<=r:
hid... |
p03037 | s613051123 | Accepted | # coding: utf-8
(N, M) = map(int, input().split(" "))
ids = list(range(1, N+1))
L_max = 0
R_min = 10000000000000000000
for _ in range(M):
(L, R) = map(int, input().split(" "))
if L > L_max:
L_max = L
if R < R_min:
R_min = R
ids = [i for i in ids if L_max <= i <= R_min]
print(len(ids))
|
p03037 | s907052635 | Accepted | n,m = map(int,input().split())
l_max,r_min = 0,n
for i in range(m):
l,r = map(int,input().split())
l_max = max(l,l_max)
r_min = min(r,r_min)
print(max(r_min - l_max +1 , 0))
|
p03037 | s911516772 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
L = 0; R = 10 ** 6
for _ in range(M):
l, r = lr()
if l > L:
L = l
if r < R:
R = r
answer = max(0, R - L + 1)
print(answer)
|
p03037 | s670091486 | Accepted | N, M = map(int, input().split())
left = 1
right = N
for _ in range(M):
L, R = map(int, input().split())
left = max(left, L)
right = min(right, R)
if left > right:
print(0)
else:
print(right - left + 1)
|
p03037 | s798264799 | Accepted | def main():
n, m = map(int,input().split())
startlis = []
endlis = []
for i in range(m):
a, b = map(int, input().split())
startlis.append(a)
endlis.append(b)
start = max(startlis)
end = min(endlis)
print(max(0,end - start + 1))
if __name__ == "__main... |
p03037 | s036972005 | Accepted | N, M = [int(a) for a in input().split()]
L = []
R = []
for _ in range(M):
l, r = [int(a) for a in input().split()]
L.append(l)
R.append(r)
mingate = max(L)
maxgate = min(R)
ans = max(maxgate - mingate + 1, 0)
print(ans) |
p03037 | s441472130 | Accepted | #!/usr/bin/env python3
def main():
n, m = map(int, input().split())
range_list = [list(map(int, input().split())) for _ in range(m)]
min_list = [x[0] for x in range_list]
max_list = [x[1] for x in range_list]
min_id = max(min_list)
max_id = min(max_list)
answer = max_id - min_id + 1
an... |
p03037 | s707953472 | Accepted | n, m = map(int, input().split())
Authority = [list(map(int, input().split())) for _ in range(m)]
cards = list(range(1, n + 2))
l_list = []
r_list = []
for i in range(m):
l_list.append(Authority[i][0])
r_list.append(Authority[i][1])
print(len(cards[max(l_list):min(r_list) + 1]))
|
p03037 | s956321786 | Accepted |
n, m = map(int, input().split())
L = [0] * m
R = [0] * m
for i in range(m):
L[i], R[i] = map(int, input().split())
print(min(R) - max(L) + 1 if min(R) >= max(L) else 0) |
p03037 | s227643629 | Accepted | _, _, *lst = map(int, open(0).read().split())
l, r = max(lst[::2]), min(lst[1::2])
print(0 if l > r else r - l + 1) |
p03037 | s807336851 | Accepted | N, M = list(map(int, input().split()))
L = 0
R = float('inf')
for i in range(M):
l, r = list(map(int, input().split()))
L = max(L, l)
R = min(R, r)
print(max(R-L+1, 0)) |
p03037 | s374052800 | Accepted | def solve(n, m, LR):
maxl = 0
minr = n
for l, r in LR:
if maxl < l:
maxl = l
if minr > r:
minr = r
return minr - maxl + 1 if maxl <= minr else 0
_n, _m = map(int, input().split())
_LR = [list(map(int, input().split())) for _ in range(_m)]
print(solve(_n, _m, _LR)... |
p03037 | s825279567 | Accepted | N, M = map(int, input().split())
mn = 0
mx = 10**6
for i in range(M):
l, r = map(int, input().split())
mn = max(l, mn)
mx = min(r, mx)
result = max(0, mx - mn + 1)
print(result)
|
p03037 | s075479070 | Accepted | n, m = map(int, input().split())
L = []
R = []
for i in range(m):
l, r = map(int, input().split())
L.append(l)
R.append(r)
count = min(R) - max(L) + 1
if count <= 0:
print(0)
else:
print(count) |
p03037 | s231949424 | Accepted | N, M = map(int, input().split())
L = 1
R = N
for n in range(M):
l, r = map(int, input().split())
L = max(l, L)
R = min(r, R)
print(max(0, R - L + 1)) |
p03037 | s143929860 | Accepted | n,m=map(int,input().split())
max_ = 0
min_ = n+1
for i in range(m):
a,b=map(int, input().split())
max_ = max(max_, a)
min_ = min(min_, b)
#print(max_, min_)
if(min_ < max_):print(0)
else:print(min_-max_+1) |
p03037 | s053275937 | Accepted | N,M = map(int,input().split())
L = [0 for _ in range(N)]
for i in range(M):
l,r = map(int,input().split())
l-=1;r-=1 #0index
L[l] += 1
if r+1 < N:
L[r+1] -= 1
S = [0]
for i in range(N):
temp = L[i] + S[-1]
S.append(temp)
#print(S)
ans = 0
for i in range(1,N+1):
if S[i] == M:
ans += 1
print(ans) |
p03037 | s594213277 | Accepted | N,M = map(int,input().split())
mi = 0
ma = 10 ** 6
for i in range(M):
L,R = map(int,input().split())
mi = max(mi,L)
ma = min(ma,R)
if(ma - mi + 1 <= 0):
print("0")
else:
print(str(ma - mi + 1)) |
p03037 | s129241236 | Accepted | k,m=map(int,input().split())
l=[0 for i in range(k+1)]
for i in range(m):
a,s=map(int,input().split())
l[a-1]+=1;l[s]-=1
ans=0
f=0
for j in range(k):
l[j]+=f
f=l[j]
print(len([1 for i in l if i==m])) |
p03037 | s172914147 | Accepted | import sys
n,m = map(int,input().split())
ls = [list(map(int,input().split())) for i in range(m)]
a = ls[0][0]
b = ls[0][1]
for j in range(1,m):
a = max(a,ls[j][0])
b = min(b,ls[j][1])
if b-a<0:
print(0)
sys.exit()
print(b-a+1) |
p03037 | s733735115 | Accepted | n,m = map(int,input().split())
l = [list(map(int,input().split())) for i in range(m)]
max_l = -1*float('INF')
min_r = float('INF')
for i in range(m):
max_l = max(max_l,l[i][0])
min_r = min(min_r,l[i][1])
ans = min_r - max_l + 1
if(ans < 0):
print(0)
exit()
if(ans <= n):
print(ans)
else:
pri... |
p03037 | s141298679 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
L_max = 0
R_min = 10 ** 5 + 1
for L, R in LR:
L_max = max(L_max, L)
R_min = min(R_min, R)
ans = R_min - L_max + 1
if ans < 0:
print(0)
else:
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.