problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s050186184 | Accepted | N,M=map(int,input().split())
L_max=0
R_min=10**9
for i in range(M):
L,R=map(int,input().split())
L_max=max(L_max,L)
R_min=min(R_min,R)
print(R_min-L_max+1 if R_min>=L_max else 0)
|
p03037 | s694521779 | Accepted | N, M = map(int, input().split())
tmp1, tmp2 = 0, 10**5
for i in range(M):
L, R = map(int, input().split())
tmp1, tmp2 = max(L, tmp1), min(R, tmp2)
if tmp2-tmp1 >= 0:
print(tmp2-tmp1+1)
else:
print(0)
|
p03037 | s868605481 | Accepted | n, m = map(int, input().split())
a = [ list(map(int, input().split())) for i in range(m) ]
print(max(min(a, key=lambda x: x[1])[1] - max(a, key=lambda x: x[0])[0] + 1, 0)) |
p03037 | s541800325 | Accepted | n,m = map(int,input().split())
lr = [list(map(int,input().split())) for i in range(m)]
max = 0
min = n+1
for i in range(m):
if lr[i][0] > max :
max = lr[i][0]
if lr[i][1] < min :
min = lr[i][1]
if min-max >= 0:
print(min-max+1)
else :
print(0)
|
p03037 | s389758585 | Accepted | n, m = map(int, input().split())
l_max = 0
r_min = float('inf')
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
if r_min >= l_max:
ans = int(r_min-l_max+1)
else :
ans = 0
print(ans) |
p03037 | s546568323 | Accepted | N,M = map(int, input().split())
LR = [[int(x) for x in input().split()] for _ in range(M)]
L = []
R = []
for i in range(M):
L.append(LR[i][0])
R.append(LR[i][1])
maxL = max(L)
minR = min(R)
if minR - maxL < 0:
print(0)
else:
print(minR-maxL+1) |
p03037 | s786295355 | Accepted | n, m = map(int, input().split())
id_card = [0] * (n + 1)
for i in range(m):
l, r = map(int, input().split())
l -= 1
id_card[l] += 1
id_card[r] -= 1
ans = 0
cnt = 0
for i in range(n):
cnt += id_card[i]
if cnt == m:
ans += 1
print(ans) |
p03037 | s085587143 | Accepted | N, M = 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 | s570476505 | Accepted | n,m = map(int,input().split())
left = 0
right = 1000000000
for _ in range(m):
a, b = (int(x) for x in input().split())
left = max(left, a)
right = min(right, b)
if right-left+1 < 0:
print(0)
else:
print(right-left+1) |
p03037 | s728349065 | Accepted | n,m = map(int,input().split())
L,R=0,n
for _ in range(m):
l,r = map(int,input().split())
L,R = max(L,l),min(R,r)
print(max(R-L+1,0)) |
p03037 | s493620076 | Accepted | n, m = map(int, input().split())
lr = [[int(i) for i in input().split()] for _ in range(m)]
mi, ma = 1, n
for l, r in lr:
mi, ma = max(mi, l), min(ma, r)
if mi <= ma:
print(ma - mi + 1)
else:
print(0) |
p03037 | s944618005 | Accepted | n,m = map(int,input().split())
l = 0
r = (10**5)+1
for i in range(m):
a,b = map(int,input().split())
l = max(l,a)
r = min(r,b)
ans = r-l+1
if ans>=0:
print(ans)
else:
print(0) |
p03037 | s419622705 | Accepted | n,m = list(map(int, input().split()))
gates = [0] * (n + 2)
for _ in range(m):
l,r = list(map(int, input().split()))
gates[l] += 1
gates[r+1] -= 1
from itertools import accumulate
gates = list(accumulate(gates))
print(gates.count(m)) |
p03037 | s373339994 | Accepted | n, m = map(int, input().split())
apple = []
for _ in range(m):
apple.append(list(map(int, input().split())))
cat = []
dog = []
for i in apple:
cat.append(i[0])
dog.append(i[1])
if min(dog) - max(cat) >= 0:
print(min(dog) - max(cat) + 1)
else:
print(0) |
p03037 | s918078186 | Accepted | N, M = map(int, input().split())
l = -float("inf")
r = float("inf")
for i in range(M):
l_i, r_i = map(int, input().split())
if l_i > l:
l = l_i
if r_i < r:
r = r_i
if (l <= r):
print(r-l+1)
else:
print(0) |
p03037 | s308840704 | Accepted | hoge = input().split()
N = int(hoge[0])
M = int(hoge[1])
mi = 0
ma = N
for j in range(M):
i = input().split(" ")
l = int(i[0])
r = int(i[1])
if l >= mi:
mi = l
if r <= ma:
ma = r
r = ma - mi + 1
if r > 0:
print(r)
else:
print(0) |
p03037 | s187095910 | Accepted | n,m = map(int,input().split())
li,lia = [],[]
for i in range(m):
a,b = map(int,input().split())
li.append(a)
lia.append(b)
if min(lia)-max(li)+1 <= 0:
print(0)
else:
print(min(lia)-max(li)+1) |
p03037 | s032601889 | Accepted | n,m=map(int,input().split())
l=0
r=99999999
for i in range(m):
a,b=map(int,input().split())
l=max(l,a)
r=min(r,b)
if r>=l:
print(r-l+1)
else:
print(0)
|
p03037 | s893646055 | Accepted | n, m = map(int, input().split())
L, R = 0, n
for i in range(m):
l, r = map(int, input().split())
if l > L:
L = l
if r < R:
R = r
if R-L+1 > 0:
print(R-L+1)
else:
print(0) |
p03037 | s332300693 | Accepted | N, M = map(int, input().split())
in_min = 1
in_max = N
for i in range(M):
l, r = map(int, input().split())
# 最小値(今の最小値と取得値のうち、大きいほう)
in_min = max([in_min, l])
# 最大値(今の最大値と取得値のうち、小さいほう)
in_max = min([in_max, r])
# 個数を出力
if(in_max < in_min):
# 最小値が大きくなった場合は、通らない
print(0)
else:
cnt = in_max - in_min +1
print(c... |
p03037 | s441192018 | Accepted | n, m = map(int, input().split())
L = 1
R = 10**5
ans = 1
for i in range(m):
l, r = 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 | s107347275 | Accepted | N, M = map(int, input().split())
l = 0
r = N
for i in range(M):
L, R = 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 | s517451431 | Accepted | N,M=map(int,input().split())
L=-10**9
R=+10**9
for _ in range(M):
l,r=map(int,input().split())
L=max(L,l)
R=min(R,r)
print(max(0,R-L+1)) |
p03037 | s113066181 | Accepted | N, M = map(int, input().split())
L = []
for i in range(M):
LR = list(map(int, input().split()))
L.append(LR)
res = [L[0][0], L[0][1]]
for i in range(M):
res = [max(res[0], L[i][0]), min(res[1], L[i][1])]
if res[1] < res[0]:
print(0)
else:
print(res[1] - res[0] + 1) |
p03037 | s403439532 | 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)
print(min(R)-max(L)+1 if min(R)-max(L)+1>0 else 0) |
p03037 | s155814339 | 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)
Lmax = max(L)
Rmin = min(R)
s = range(Lmax,Rmin+1)
print(len(s)) |
p03037 | s277382255 | Accepted | n, m = map(int, input().split())
l = list()
r = list()
for i in range(m):
tmp_l, tmp_r = map(int, input().split())
l.append(tmp_l)
r.append(tmp_r)
maxl = max(l)
minr = min(r)
if maxl > minr:
print(0)
elif maxl == minr:
print(1)
else:
print(minr - maxl + 1) |
p03037 | s790407218 | Accepted | n, m = map(int, input().split())
lmax = 1
rmin = n
for i in range(m):
l, r = map(int, input().split())
lmax = max(l, lmax)
rmin = min(r, rmin)
print(rmin - lmax + 1 if rmin - lmax + 1 >= 0 else 0) |
p03037 | s559340462 | 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(min(R)-max(L)+1)
else:
print(0) |
p03037 | s969022564 | Accepted | n,m = map(int,input().split())
l = []
r = []
while True:
try:
tl,tr = map(int,input().split())
l.append(tl)
r.append(tr)
except:
break
R = min(r)
L = max(l)
cnt = 0
for i in range(1,n+1):
if i>=L and i<=R:
cnt +=1
print(cnt)
|
p03037 | s647572699 | Accepted | n, m = map(int, input().split())
max_l = 0
min_r = n
for _ in range(m):
l, r = map(int, input().split())
max_l = max(l, max_l)
min_r = min(r, min_r)
print(max(min_r - max_l + 1, 0)) |
p03037 | s987237004 | 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)
m = min(r) - max(l)
if m < 0:
print(0)
else:
print(m + 1) |
p03037 | s702997040 | Accepted | n,m = map(int, input().split())
l = []
for _ in range(m):
data = list(map(int,input().split()))
l.append(data)
l_max=0
r_min=10**9
for tmp in l:
l=tmp[0]
r=tmp[1]
if l_max < l:
l_max=l
if r_min > r:
r_min=r
ans = r_min-l_max+1
if ans >= 0:
print(ans)
else:
print(0) |
p03037 | s222684037 | Accepted | n, m = map(int, input().split())
l_max = 0
r_min = float('inf')
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
if r_min >= l_max:
print(r_min - l_max + 1)
else:
print('0')
|
p03037 | s781690906 | Accepted | n,m = map(int,input().split())
lr = [list(map(int,input().split())) for _ in range(m)]
l = 0
r = 10**10
for l1,r1 in lr:
l = max(l, l1)
r = min(r, r1)
print(max(0, r - l + 1))
|
p03037 | s286696536 | Accepted | n, m = map(int, input().split())
L = 1
R = n
for _ in range(m):
l, r = map(int, input().split())
L = max(L, l)
R = min(R, r)
if (L <= R):
print(R - L + 1)
else:
print(0)
|
p03037 | s608694819 | Accepted | n,m=map(int,input().split())
left=1
right=n
for i in range(m):
p,q=map(int,input().split())
left=max(left,p)
right=min(right,q)
print(max(right-left+1,0)) |
p03037 | s142562796 | Accepted | N, M = map(int, input().split())
imos = [0] * (N + 1)
for i in range(M):
l, r = map(int, input().split())
imos[l - 1] += 1
imos[r] -= 1
for i in range(N):
imos[i + 1] = imos[i] + imos[i + 1]
# print(imos)
print(imos[:-1].count(M))
|
p03037 | s818606786 | Accepted | A, B = map(int, input().split())
L = 0
R = A
for i in range(B):
x,y = map(int, input().split())
L = max(L,x)
R = min(R,y)
ans = R-L+1 if R>=L else 0
print(ans) |
p03037 | s790755091 | Accepted | N,M = map(int,input().split())
MAXL = -1
MINR = float("inf")
for _ in range(M):
L,R = map(int,input().split())
MAXL = max(MAXL, L)
MINR = min(MINR, R)
print(max(0, MINR - MAXL + 1)) |
p03037 | s015555166 | Accepted | A = list(map(int , input().split()))
sc = [list(map(int, input().split())) for i in range(A[1])]
a = []
b = []
for i in sc:
a.append(i[0])
b.append(i[1])
if max(a) <= min(b):
ans = min(b) - max(a) + 1
else:
ans = 0
print(ans) |
p03037 | s410589803 | Accepted | import sys
n, m = map(int, input().split())
min_id = 1
max_id = n
for i in range(m):
l, r = map(int, input().split())
if min_id < l <= max_id:
min_id = l
elif max_id < l:
print(0)
sys.exit()
if min_id <= r < max_id:
max_id = r
elif r < min_id:
print(0)
... |
p03037 | s314544426 | Accepted | n,m=map(int,input().split())
L=1
R=10**5
for i in range(m):
l,r=map(int,input().split())
L,R = max(l,L), min(r,R)
if L>R:
print(0)
exit()
print(R-L+1) |
p03037 | s291533181 | Accepted | n,m=map(int,input().split())
l,r=map(int,input().split())
l_max,r_min=l,r
for i in range(m-1):
l,r=map(int,input().split())
if l_max<l: l_max=l
if r_min>r: r_min=r
print(max(r_min-l_max+1,0)) |
p03037 | s220533090 | Accepted | n,m=map(int,input().split())
a=[]
for x in range(m):
s=list(map(int,input().split()))
a.append(s)
min1=1
max1=n
for y in range(m):
l=a[y][0]
r=a[y][1]
if min1<l:
min1=l
if max1>r:
max1=r
if max1-min1>=0:
print(max1-min1+1)
else:
print(0) |
p03037 | s729870765 | Accepted | n, m = map(int, input().split())
l_max = 0
r_min = 100001
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
ans = max(r_min - l_max + 1, 0)
print(ans)
|
p03037 | s504150431 | Accepted | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
L, R = [list(i) for i in zip(*LR)]
l = 0
r = N+1
for i in range(M):
l = max(l, L[i])
r = min(r, R[i])
print(max(0, r-l+1)) |
p03037 | s675379420 | Accepted | def solve():
N, M = map(int, input().split())
Count = [0] * (N + 1)
for i in range(M):
l, r = map(int, input().split())
Count[l-1] += 1
Count[r] -= 1
ans = 0
if Count[0] == M: ans = 1
for i in range(1, N):
Count[i] += Count[i-1]
if Count[i] == M: ans += 1
... |
p03037 | s314222358 | Accepted | N, M = 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)
high=N
low=0
ans = [True for i in range(N)]
for i in range(M):
for c,k in enumerate(range(L[i]-2, low-1, -1)):
if(low < k):
low=k
ans[k]=Fa... |
p03037 | s285298183 | Accepted | def main():
N, M = (int(i) for i in input().split())
A = [[int(i) for i in input().split()] for j in range(M)]
S = [0]*(N+2)
for le, ri in A:
S[le] += 1
S[ri+1] += -1
ans = 0
for i in range(N):
S[i+1] += S[i]
if S[i+1] == M:
ans += 1
# print(S)
... |
p03037 | s409114741 | Accepted | N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
l,r = 1, N
for i,j in permit:
l = max(l, i)
r = min(r, j)
print(max(r-l+1,0)) |
p03037 | s626240846 | Accepted | n, m = map(int, input().split())
L = 0
R = 100000
for i in range(m):
l, r = map(int, input().split())
if l > L:
L = l
if r < R:
R = r
if L <= R:
print(R - L + 1)
else:
print(0) |
p03037 | s639726552 | 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 | s335466255 | Accepted | #C
n, m = 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) |
p03037 | s997087994 | Accepted | n, m = map(int, input().split())
ok = [0] * (n + 2)
ans = 0
for _ in range(m):
l, r = map(int, input().split())
ok[l] += 1
ok[r + 1] -= 1
for i in range(1, n + 2):
ok[i] += ok[i - 1]
if ok[i] == m:
ans += 1
print(ans) |
p03037 | s310692548 | Accepted | N,M=map(int,input().split())
Lmax = 0
Rmin = 1e8
for _ in range(M):
L,R=map(int,input().split())
if L > Lmax:
Lmax = L
if R < Rmin:
Rmin = R
print(max(0, Rmin - Lmax + 1)) |
p03037 | s718166316 | Accepted | n,m=map(int,input().split())
l=0;r=10**6
for i in range(m):
ln,rn=map(int,input().split())
l=max(l,ln);r=min(r,rn)
if l>r:
print(0)
else:
print(r-l+1) |
p03037 | s245626296 | Accepted | N, M = list(map(int, input().split()))
min_num = 1
max_num = N
for i in range(M):
min_input, max_input = list(map(int, input().split()))
if min_input > min_num:
min_num = min_input
if max_input < max_num:
max_num = max_input
output = max_num- min_num + 1
if output <= 0:
print(0)
els... |
p03037 | s023774858 | Accepted | n,m = map(int,input().split())
ans = [1, n]
for i in range(m):
l,r = map(int,input().split())
if r < ans[0] or ans[1] < l:
print(0)
exit()
elif ans[0] <= l and r <= ans[1]:
ans = [l,r]
else:
ans = [max(ans[0], l), min(ans[1], r)]
print(ans[1]-ans[0] + 1)
|
p03037 | s344919895 | 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=0
if max(L)>min(R):
print(0)
else:
print(min(R)-max(L)+1) |
p03037 | s633238946 | Accepted | import numpy as np
N,M=map(int,input().strip().split())
LR=np.array([list(map(int,input().strip().split())) for _ in range(M)])
print(max(min(LR[:,1])-max(LR[:,0])+1,0))
|
p03037 | s684893946 | 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 | s956889642 | Accepted | import sys
n,m=(int(i) for i in input().split())
l = [None]*m
r = [None]*m
for i in range(m):
l[i],r[i]=(int(j) for j in input().split())
rangel=l[0]
ranger=r[0]
for i in range(1,m):
if rangel < l[i]:
rangel = l[i]
if ranger > r[i]:
ranger = r[i]
if rangel > ranger:
ans =0
... |
p03037 | s022015516 | Accepted | n,m=map(int,input().split())
l=1;ma=n
te=set(range(1,n+1))
for i in range(m):
x,y=map(int,input().split())
l=max(x,l)
ma=min(ma,y)
print(abs(l-ma)+1 if l<=ma else 0)
|
p03037 | s508714222 | Accepted | N, M = map(int,input().split())
LR = [list(map(int,input().split())) for _ in range(M)]
L = [x[0] for x in LR]
R = [x[1] for x in LR]
if min(R) - max(L)>=0:
print(min(R)-max(L)+1)
else:
print(0)
|
p03037 | s223779118 | Accepted | n,m=[int(x) for x in input().split()]
L=0
R=1000000
for i in range(m):
l,r=[int(x) for x in input().split()]
L=max(L,l)
R=min(R,r)
ans=R-L+1
if ans<=0:
print(0)
else:
print(ans) |
p03037 | s843040197 | Accepted | import numpy as np
n,m=map(int,input().split())
X=1
Y=n
for i in range(m):
L,R=map(int,input().split())
X=max(X,L)
Y=min(Y,R)
print(max(0,Y-X+1)) |
p03037 | s984547203 | Accepted | a = input().split()
N = int(a[1])
mini = []
maxi = []
for i in range(N):
b = input().split()
mini.append(b[0])
maxi.append(b[1])
c = [int(s) for s in mini]
d = [int(s) for s in maxi]
c = sorted(c)
d = sorted(d, reverse=True)
e = min(d) - max(c)
if e >= 0:
print(e + 1)
else:
print(0) |
p03037 | s885166562 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Sat May 16 19:11:36 2020
@author: Kanaru Sato
"""
n,m = list(map(int,input().split()))
currentl,currentr = list(map(int,input().split()))
flag = 1
for i in range(m-1):
l,r = list(map(int,input().split()))
if currentl <= l and l <= currentr:
currentl = l
if ... |
p03037 | s044386420 | Accepted | N, M = map(int, input().split())
left = 1
right = N
for i in range(M):
l, r = map(int, input().split())
if l > left:
left = l
if r < right:
right = r
if left > right:
print(0)
else:
print(right - left + 1) |
p03037 | s683263623 | Accepted | n,m = map(int,input().split())
li=[list(map(int,input().split())) for i in range(m)]
max_l,min_r=0,10**9
for i in li:
max_l = max(max_l,i[0])
min_r = min(min_r,i[1])
if min_r >= max_l:
print(min_r-max_l+1)
else:
print(0) |
p03037 | s063762380 | Accepted | n, m = map(int, input().strip().split())
max_left = 0
min_right = n
for _ in range(m):
l_tmp, r_tmp = map(int, input().strip().split())
if max_left < l_tmp:
max_left = l_tmp
if r_tmp < min_right:
min_right = r_tmp
if min_right < max_left:
print(0)
else:
print(min_right - max_left +... |
p03037 | s905431912 | Accepted | n,m = map(int,input().split())
a = 1
b = n
for i in range(m):
l,r = map(int,input().split())
if ( a < l and b < l ) or ( a > r and b > r):
a = 1
b = 0
break
a = max(a,l)
b = min(b,r)
print(b-a+1) |
p03037 | s822638220 | Accepted | import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
L = [None] * M
R = [None] * M
for i in range(M):
L[i], R[i] = map(int, input().split())
L_max = max(L)
R_min = min(R)
if L_max > R_min:
print(0)
else:
print(R_min - L_max + 1)
... |
p03037 | s695025304 | Accepted | 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_1=max(l_list)
ans_2=min(r_list)
print(max(ans_2-ans_1+1,0))
|
p03037 | s264462090 | Accepted | import math
def py():
print("Yes")
def pn():
print("No")
def iin():
x = int(input())
return x
neko = 'None'
n,m = map(int,input().split())
l = 1
r = n
for i in range(m):
a,b = map(int,input().split())
if a > l:
l = a
if b < r:
r = b
x = r-l+1
if x < 0:
x = 0
print(x) |
p03037 | s440304123 | Accepted | N,M = map(int,input().split())
L_max,R_min = 0,10000000
for i in range(M):
L,R = map(int,input().split())
L_max = max(L_max,L)
R_min = min(R_min,R)
if R_min < L_max:
print(0)
else:
print(R_min - L_max + 1) |
p03037 | s940637443 | Accepted | from itertools import accumulate
n, m = [int(x) for x in input().split()]
a = [0 for i in range(n + 2)]
for i in range(m):
l, r = [int(x) for x in input().split()]
a[l] += 1
a[r + 1] -= 1
a = list(accumulate(a))
print(a.count(m))
|
p03037 | s981005336 | Accepted | N,M=map(int,input().split())
gate=[list(map(int,input().split())) for _ in range(M)]
a=gate[0][0]
b=gate[0][1]
for i in range(1,M):
a=max(a,gate[i][0])
b=min(b,gate[i][1])
if b>=a:
print(b-a+1)
else:
print(0) |
p03037 | s892053265 | Accepted | _, __, *d = map(int, open(0).read().split())
print(max(min(d[1::2]) - max(d[::2]) + 1, 0)) |
p03037 | s058407966 | Accepted | N,M=map(int,input().split())
l=list()
r=list()
for n in range(M):
L,R=map(int,input().split())
l.append(L)
r.append(R)
if min(r)>=max(l):
print(min(r)-max(l)+1)
else:
print('0') |
p03037 | s257329546 | Accepted | n,m=map(int,input().split())
lh=0
rh=10**9
for i in range(m):
l,r=map(int,input().split())
if lh<=l:
lh=l
if rh>=r:
rh=r
if rh-lh<0:
print(0)
else:
print(rh-lh+1) |
p03037 | s594264110 | Accepted | n, m = map(int, input().split())
max = float("INF")
min = 0
for i in range(m):
l, r = map(int, input().split())
if max > r:
max = r
if min < l:
min = l
if max - min + 1 >= 0:
print(max - min + 1)
else:
print(0) |
p03037 | s439738415 | Accepted | N, M = map(int, input().split())
LR = []
for _ in range(M):
l, r = map(int, input().split())
LR.append((l, r))
L_max = 1
R_min = N
for lr in LR:
if (L_max < lr[0]):
L_max = lr[0]
if (R_min > lr[1]):
R_min = lr[1]
result = R_min - L_max + 1
if(result <= 0):
print(0)
else:
print(result)
|
p03037 | s490366553 | Accepted |
def myAnswer(N,M,L,R) -> int:
total = 0
MAXL=max(L)
MINR =min(R)
for i in range(1,N+1):
if(MAXL<= i and MINR >= i):
total += 1
return total
def modelAnswer():
tmp=1
def main():
N, M = map(int,input().split())
L =[]
R = []
for _ in range(M):
l,r = map(int,input().spl... |
p03037 | s258152716 | Accepted |
N , M =(int(a) for a in input().split())
num = []
for i in range(M) :
L,R =(int(a) for a in input().split())
num.append((L , R))
a = 0
b = 10 ** 5
for i in range(M) :
a = max(a , num[i][0])
b = min(b , num[i][1])
x = b - a + 1
if x < 0 :
print(0)
else : print(x)
|
p03037 | s963993986 | Accepted | n,m = map(int,input().split())
mi = 0
ma = 200000
for i in range(m):
l,r = map(int,input().split())
mi = max(mi,l)
ma = min(ma,r)
if ma-mi>=0:
print(ma-mi+1)
else:
print(0) |
p03037 | s573032907 | Accepted | n, m = map(int, input().split())
gates = [0] * (n + 2)
for _ in range(m):
l, r = map(int, input().split())
gates[l] += 1
gates[r + 1] -= 1
for i in range(n):
gates[i + 1] += gates[i]
ans = 0
for i in range(n + 1):
if gates[i] == m:
ans += 1
print(ans) |
p03037 | s049626129 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
n, m = map(int, input().split())
left = -1
right = n + 1
for _ in range(m):
l, r = map(int, input().split())
if r < left or l > right:
print(0)
sys.exit()
left = max(left, l)
right = min(right, r)
print(right - left + 1) |
p03037 | s579605684 | Accepted | N,M=map(int,input().split())
LR=[]
for i in range(M):
LR.append(list(map(int,input().split())))
l,r=LR[0][0],LR[0][1]
for i in range(M):
if LR[i][1]<=r:
r=LR[i][1]
if l<=LR[i][0]:
l=LR[i][0]
ans=r-l+1
if ans>0:
print(ans)
else:
print(0) |
p03037 | s013208793 | Accepted | N,M = map(int,input().split())
L_list = []
R_list = []
count = 0
min_mn=float('inf')
max_mn=0
for i in range(M):
L,R=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 | s491739023 | 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)
x=max(l_list)
y=min(r_list)
z=y-x
if z>=0:
print(z+1)
else:
print(0) |
p03037 | s625103945 | Accepted | N,M=map(int,input().split())
L=0
R=N
for i in range(M):
l,r=map(int,input().split())
if L<l:
L=l
if r<R:
R=r
print(max(0,R-L+1)) |
p03037 | s470522437 | Accepted | import numpy as np
i = list(map(int, input().split()))
N = i[0]
M = i[1]
l = np.array([list(map(int, input().split())) for i in range(M)])
limit1 = max(l[:, 0])
limit2 = min(l[:, 1])
print(max(limit2 - limit1 + 1, 0)) |
p03037 | s060456196 | 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_SORT = sorted(L)
R_SORT = sorted(R)
#print(L_SORT)
#print(R_SORT)
L_MAX = L_SORT[M-1]
R_MIN = R_SORT[0]
#print(L_MAX)
#print(R_MIN)
if (R_MIN - L_MAX) < 0:
print(0)
else:
print(R_MIN-L_MAX + 1) |
p03037 | s967533388 | Accepted | n, m = map(int, input().split())
lr = [list(map(int, input().split())) for _ in range(m)]
INF = float('inf')
ans_l, ans_r = -INF, INF
for l, r in lr:
ans_l = max(ans_l, l)
ans_r = min(ans_r, r)
print(max(0, ans_r-ans_l+1)) |
p03037 | s073552851 | Accepted | N, M = map(int, input().split())
l, r = 1, N
for i in range(M):
L, R = map(int, input().split())
l, r = max(l, L), min(r, R)
if r - l >= 0:
print(r - l + 1)
else:
print(0) |
p03037 | s075251961 | Accepted | # C - Prison
n, m = map(int, input().split())
ansl = 1
ansr = n
for i in range(m):
l, r = map(int, input().split())
if l>ansl:
ansl = l
if r<ansr:
ansr = r
print(max(ansr-ansl+1,0))
|
p03037 | s192948327 | Accepted | N, M = map(int, input().split())
min, max = map(int, input().split())
for i in range(1, M):
L, R = map(int, input().split())
if L > max or R < min:
print(0)
exit()
elif min < L <= max:
min = L
elif min <= R < max:
max = R
print(max-min+1)
|
p03037 | s835020459 | Accepted | n,m=map(int,input().split())
L,R=0,10**18
for i in range(m):
l,r=map(int,input().split())
L=max(L,l)
R=min(R,r)
if R<L:
print(0)
else:
print(R-L+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.