problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s794973619 | Accepted | N,M = map(int, input().split())
L,R = map(int, input().split())
for _ in range(M-1):
l,r = map(int, input().split())
if R>r:
R = r
if L<l:
L = l
if (R-L+1)>0:
print(R-L+1)
else:
print(0) |
p03037 | s844861001 | 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(max(min(r) - max(l) + 1, 0))
|
p03037 | s085989806 | Accepted | N, M = map(int, input().split())
A = [1, N]
for i in range(M):
L, R = map(int, input().split())
A = [max(A[0], L), min(A[1], R)]
print(max(0, (A[1] - A[0] + 1))) |
p03037 | s059375827 | 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 min(R)-max(L)+1>=0:
print(min(R)-max(L)+1)
else:
print(0) |
p03037 | s690316606 | Accepted | N,M=map(int,input().split())
G=[list(map(int,input().split())) for _ in range(M)]
mi=0
ma=float("inf")
for i in range(M):
if G[i][0]>mi:
mi=G[i][0]
if G[i][1]<ma:
ma=G[i][1]
#print(mi,ma)
print(max(ma-mi+1,0)) |
p03037 | s515608372 | Accepted | n,m = map(int, input().split())
Lmin = 0
Rmax = n
for i in range(m):
L,R = map(int, input().split())
Lmin = max(L-1, Lmin)
Rmax = min(R, Rmax)
if Lmin < Rmax:
ans = Rmax - Lmin
else:
ans = 0
print(ans) |
p03037 | s181686791 | Accepted | def main():
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
CARD=[0]*(n+1)
for i in range(m):
L,R=map(int,input().split())
CARD[L-1]+=1
CARD[R]-=1
ans=0
for i in range(n):
if CARD[i]==m:ans+=1
CARD[i+1]=CARD[i+1]+CARD[i]
print(... |
p03037 | s407023137 | Accepted | N,M=map(int,input().split())
diff=[0 for _ in range(N+1)]
for _ in range(M):
L,R=map(int,input().split())
diff[L-1]+=1
diff[R]-=1
ans=0
x=0
for i in range(N):
x+=diff[i]
if x==M:
ans+=1
print(ans)
|
p03037 | s125937380 | 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 | s678968255 | Accepted | N, M = map(int, input().split())
LR = [tuple(map(int, input().split())) for _ in range(M)]
max_l, min_r = 0, N
for l, r in LR:
max_l = max(l, max_l)
min_r = min(r, min_r)
if min_r < max_l:
print(0)
exit()
print(min_r - max_l + 1)
|
p03037 | s413077576 | Accepted | N,M = map(int,input().split())
LR = [[int(x) for x in input().split()] for _ in range(M)]
L = 1
R = N
for l,r in LR:
L = max(L,l)
R = min(R,r)
if L > R:
print(0)
else:
print(R-L+1)
|
p03037 | s630935038 | Accepted | n, m = map(int, input().split())
lmax = 0
rmin = 1000000
for _ in range(m):
l, r = map(int, input().split())
lmax = max(lmax, l)
rmin = min(rmin, r)
if lmax > rmin:
print(0)
else:
print(rmin-lmax+1) |
p03037 | s043802358 | 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:
if left < l:
left = l
if right > r:
right = r
ans = right - left
print(ans + 1 if ans >= 0 else 0)
|
p03037 | s512127955 | Accepted | N,M=map(int,input().split())
LR=[list(map(int,input().split())) for i in range(M)]
l=1
r=N
for lr in LR:
if l<lr[0]:
l=lr[0]
if lr[1]<r:
r=lr[1]
print(max(0,r-l+1))
|
p03037 | s995718674 | Accepted | n, m = map(int, input().split())
max_l = 0
min_r = 10**5
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
res = min_r - max_l + 1
if res<0:
res = 0
print(res)
|
p03037 | s694690714 | Accepted | n,m = map( int,input().split() )
a = [ list(map(int,input().split())) for _ in range(m)]
#n,m = 5,3
#a = [[3,6],[5,7],[6,9]]
L = a[0][0]
R = a[0][1]
for i in range(1,m):
L = max(L,a[i][0])
R = min(R,a[i][1])
R = min(R,n)
if R >= L :
print(R-L+1)
else:
print(0) |
p03037 | s080946352 | Accepted | N_ID, M_gate = map(int, input().split())
mini = float('inf')
MAX = 0
for i in range(M_gate):
L, R = map(int, input().split())
MAX = max(MAX, L)
mini = min(mini, R)
answer = max(0, mini - MAX + 1)
print(answer) |
p03037 | s870852828 | Accepted | N, M = map(int, input().split())
lmax = 0
rmin = 10**5
for i in range(M):
L, R = map(int, input().split())
lmax = max(lmax, L)
rmin = min(rmin, R)
ans = rmin - lmax
if ans >= 0:
print(ans + 1)
else:
print(0) |
p03037 | s308112274 | 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)
ans=min(R)-max(L)+1
if ans>=0:
print(ans)
else:
print(0)
|
p03037 | s639173248 | 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.sort()
R.sort()
if L[-1] > R[0]:
print(0)
else:
print(R[0] - L[-1] + 1)
|
p03037 | s323037717 | Accepted | n, m = [int(i) for i in input().split()]
left, right = 0, n
for i in range(m):
l, r = [int(i) for i in input().split()]
left = max(left, l)
right = min(right, r)
print(max(right - left + 1, 0))
|
p03037 | s888096093 | Accepted | n, m = map(int, input().split())
Lmax = 0
Rmin = n
for _ in range(m):
L, R = map(int, input().split())
Lmax = max(L, Lmax)
Rmin = min(R, Rmin)
print(max(Rmin - Lmax + 1, 0)) |
p03037 | s133322521 | Accepted | N, M = map(int,input().split())
L,R= map(int,input().split())
for i in range(M-1):
x,y= map(int,input().split())
L = max(L,x)
R = min(R,y)
print(R-L+1 if L<=R else 0) |
p03037 | s903077529 | Accepted | n,m = map(int,input().split())
a = []
lmax = 0
rmin = 10**6
for i in range(m):
a.append(list(map(int,input().split())))
if a[i][0] > lmax:
lmax = a[i][0]
if a[i][1] < rmin:
rmin = a[i][1]
if rmin-lmax < 0 :
print(0)
else :
print(1+rmin-lmax)
|
p03037 | s584936211 | Accepted | n,m = map(int,input().split())
lr = [list(map(int,input().split()))for i in range(m)]
low = 1
high = 10**5
for l,r in lr:
if low <= l:
low = l
if r <= high:
high = r
if high < low:
print(0)
exit()
print(high - low + 1) |
p03037 | s828263682 | 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)
print(max(0, right - left + 1))
|
p03037 | s959980168 | Accepted | N, M = map(int, input().split())
LR = [(map(int, input().split())) for i in range(M)]
L = 1
R = N
for i in range(M):
a, b = LR[i]
L = max(L,a)
R = min(R,b)
if R-L+1>=0:
print(R-L+1)
else:
print(0) |
p03037 | s600136390 | Accepted | n,m=map(int,input().split())
l=[]
r=[]
for i in range(m):
tmp=list(map(int,input().split()))
l.append(tmp[0])
r.append(tmp[1])
print(max(min(r)-max(l)+1,0)) |
p03037 | s416621921 | Accepted | n, m = map(int, input().split())
lrs = [ list(map(int, input().split())) for _ in range(m)]
cards = [lrs[0][0], lrs[0][1]] # [min, max]
for lr in lrs[1:]:
if (lr[1] < cards[0]) or (lr[0] > cards[1]):
print(0)
exit()
cards[0] = max(cards[0], lr[0])
cards[1] = min(cards[1], lr[1])
pri... |
p03037 | s517447678 | Accepted | n, m = map(int, input().split())
min_l = 0
max_l = 10**6
for _ in range(m):
L, R = map(int, input().split())
min_l = max(min_l, L)
max_l = min(max_l, R)
print(max_l - min_l + 1 if max_l - min_l + 1 > 0 else 0) |
p03037 | s673783867 | Accepted | n, m = map(int, input().split())
l_lst = [0] * m
r_lst = [0] * m
for i in range(m):
l, r = map(int, input().split())
l_lst[i] = l
r_lst[i] = r
if max(l_lst) <= min(r_lst):
print(min(r_lst) - max(l_lst) + 1)
else:
print(0) |
p03037 | s952811954 | Accepted | N, M = map(int, input().split())
L = list(range(M))
R = list(range(M))
for m in range(M):
L[m], R[m] = map(int, input().split())
L_max = max(L)
R_min = min(R)
print(R_min - L_max + 1 if L_max <= R_min else 0) |
p03037 | s862832880 | 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)
L1 = max(l)
R1 = min(r)
if R1 >= L1:
print(R1 - L1 + 1)
else:
print(0) |
p03037 | s227240824 | Accepted | n,m=map(int,input().split())
low=1
high=n
for i in range(m):
l,r=map(int,input().split())
if l>low:
low=l
if r<high:
high=r
if high>=low:
print(high-low+1)
else:
print(0) |
p03037 | s596665181 | Accepted | N, M = map(int, input().split())
low = 1
high = N
for i in range(M) :
l, r = map(int,input().split())
low = max(low, l)
high = min(high, r)
if high - low + 1 > 0 :
print(high - low + 1)
else :
print(0)
|
p03037 | s867256264 | Accepted | n, m=map(int, input().split())
l1 = [[] for _ in range(n)]
mn=1
ma=n
for i in range(1, m+1):
l, r=map(int, input().split())
mn=max(mn, l)
ma=min(ma, r)
if ma<mn:
print(0)
exit()
print(ma-mn+1)
|
p03037 | s190152883 | 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)
print(max(0, min(R) - max(L) + 1))
|
p03037 | s725613281 | Accepted | N,M= map(int,input().split())
gate=[list(map(int,input().split())) for i in range(M)]
count2=0
min1=1
max1=N
for j in gate:
if j[0]>min1:
min1=j[0]
if j[1]<max1:
max1=j[1]
if max1>=min1:
print(max1-min1+1)
else:
print(0) |
p03037 | s671497075 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for i in range(m)]
max = n
min = 1
for i in range(m):
if min < LR[i][0]:
min = LR[i][0]
if max > LR[i][1]:
max = LR[i][1]
ans = max - min + 1
if ans > 0:
print(ans)
else:
print(0) |
p03037 | s569274856 | Accepted | import sys
input=sys.stdin.readline
n,k=map(int,input().split())
L=[0]*(n+1)
und=0
top=10**5
for i in range(k):
a,b=map(int,input().split())
und=max(und,a)
top=min(b,top)
print(top-und+1 if top>=und else 0)
|
p03037 | s580088610 | 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)
res=min(R)-max(L)+1
if res<0:
print("0")
else:
print(res) |
p03037 | s207702528 | 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 | s092858617 | Accepted | n,m=map(int,input().split())
L=0
R=n+1
for i in range(m):
l,r=map(int,input().split())
L=max(L,l)
R=min(R,r)
print(max(R-L+1,0))
|
p03037 | s752749913 | Accepted | n,m = map(int,input().split())
min_card,max_card = 0,n
for i in range(m):
l,r = map(int,input().split())
min_card = max(min_card,l)
max_card = min(max_card,r)
#print(min_card,max_card)
if min_card<=max_card:
print(max_card-min_card+1)
else:
print(0) |
p03037 | s814096460 | Accepted | N,M=map(int,input().split())
Lmax=1
Rmin=N
for i in range(M):
L,R=map(int,input().split())
Lmax=max(Lmax,L)
Rmin=min(Rmin,R)
print(max(Rmin-Lmax+1,0)) |
p03037 | s739296357 | Accepted | n, m = list(map(int, input().split()))
R, L = [], []
for i in range(m):
l, r = list(map(int, input().split()))
R.append(r)
L.append(l)
print(max(min(R) - max(L) + 1, 0)) |
p03037 | s181170009 | Accepted | 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:
... |
p03037 | s404130333 | Accepted | n, m = list(map(int, input().split()))
list = [list(map(int, input().split())) for x in range(m)]
ans = [1]*n
s = 0
m = n
for i in list:
if i[0] > s:
s = i[0]
if i[1] < m:
m = i[1]
if m>=s:
print(m-s+1)
else:
print(0) |
p03037 | s329211669 | Accepted | n,m=map(int,input().split())
mn=0
mx=10**6
for i in range(m):
a,b=map(int,input().split())
mn=max(mn,a)
mx=min(mx,b)
if mn>mx:
print(0)
else:
print(mx-mn+1) |
p03037 | s769066603 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
max_L = 0
min_R = float("inf")
for i in range(m):
L, R = LR[i]
max_L = max(max_L, L)
min_R = min(min_R, R)
if min_R - max_L < 0:
print(0)
else:
print(min_R - max_L + 1) |
p03037 | s877947563 | Accepted | 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)
ans=rm-lm+1
print(ans if ans>=0 else 0) |
p03037 | s018333198 | Accepted | import numpy as np
n, m = map(int, input().split())
ans = [0]*n
for _ in range(m):
l, r = map(int, input().split())
ans[l-1] += 1
if r < n:
ans[r] -= 1
c = list(np.cumsum(ans))
print(c.count(m)) |
p03037 | s969539651 | Accepted | N, M=map(int, input().split())
a=1
b=N
for i in range(M):
L,R=map(int, input().split())
a=max(a,L)
b=min(b,R)
if b>=a:
print(b-a+1)
else:
print(0) |
p03037 | s406506301 | Accepted | N,M=map(int,input().split())
left=1
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 | s614708466 | Accepted | N, M = map(int,input().split())
l=1
r=N
for i in range(M):
L,R = map(int,input().split())
l = max(l,L)
r = min(r,R)
ans = r-l+1
if ans >= 0:
print(ans)
else:
print(0)
|
p03037 | s712732075 | Accepted | N,M = map(int,input().split())
maL = 0
miR = N
for g in range(M):
L,R = map(int,input().split())
maL = max(maL,L)
miR = min(miR,R)
if maL <= miR:
print(miR-maL+1)
else:
print(0)
|
p03037 | s024391264 | Accepted | def main():
n,m = map(int,input().split())
l = 0
r = float('inf')
for i in range(m):
l_,r_ = map(int,input().split())
if l<l_:
l = l_
if r_<r:
r = r_
if r-l>=0:
print(r-l+1)
else:
print(0)
if __name__ == "__main__":
main() |
p03037 | s671475280 | Accepted | import itertools
import math
import fractions
import functools
import copy
n, m = map(int, input().split())
lr = []
for i in range(m):
l, r = map(int, input().split())
lr.append([l,r])
result = list(range(lr[0][0],lr[0][1]+1))
maximum = lr[0][1]
minimum = lr[0][0]
for i in range(len(lr)):
maximum = min(m... |
p03037 | s576182465 | Accepted | f=lambda:map(int,input().split())
n,m=f()
L,R=0,n
for i in range(m):
l,r=f()
L=max(L,l)
R=min(R,r)
print(max(0,R-L+1)) |
p03037 | s592527783 | Accepted | n, m = map(int, input().split())
x = [0] * (n+2)
for i in range(m):
l, r = map(int, input().split())
x[l] += 1
x[r+1] -= 1
ans = 0
for i in range(1, n+1):
x[i] += x[i-1]
if x[i] == m:
ans += 1
print(ans)
|
p03037 | s128389978 | Accepted | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split()... |
p03037 | s668951246 | Accepted | N, M = map(int,input().split())
l = 1; r = N;
for i in range(M):
a, b = map(int,input().split())
l = max(l, a)
r = min(r, b)
print(max(0, r-l+1)) |
p03037 | s356946742 | Accepted | r=input().split()
N=int(r[0])
M=int(r[1])
data=[[int(s) for s in input().split()] for i in range(M)]
left=[]
right=[]
for i in range(M):
left.append(data[i][0])
right.append(data[i][1])
if min(right)-max(left)+1<=0:
print(0)
else:
print(min(right)-max(left)+1) |
p03037 | s669616613 | Accepted | #C - Prison
N,M = map(int, input().split())
L = [list(map(int, input().split())) for i in range(M)]
a_max = 0
b_min = 10**9
for i in range(M):
if b_min >= L[i][1]:
b_min = L[i][1]
else:
pass
if a_max <= L[i][0]:
a_max = L[i][0]
else:
pass
if a_max > b_min:
print(0)
e... |
p03037 | s123390449 | Accepted | if __name__ == '__main__':
n, m = map(int, input().split())
max = 0
min = n
for i in range(m):
l,r = map(int, input().split())
if l > max:
max = l
if r < min:
min = r
if max <= min:
print(min - max +1)
else:
print(0)
|
p03037 | s089010626 | Accepted | N,M = map(int,input().split(" "))
Min = 1
Max = N
for _ in range(M):
L,R = map(int,input().split(" "))
if L>Min:
Min=L
if R<Max:
Max=R
if Max-Min>=0:
print(Max-Min+1)
else:
print(0) |
p03037 | s992833842 | Accepted | n,m=map(int,input().split())
l=[0 for _ in range(m)]
r=[0 for _ in range(m)]
for i in range(m):
l[i],r[i] = map(int,input().split())
lmax=max(l)
rmin=min(r)
if rmin>=lmax:
print(rmin-lmax+1)
else:
print(0) |
p03037 | s306442806 | Accepted | N, M = map(int, input().split())
left = 1
right = N
for i in range(M):
L, R = map(int, input().split())
left = max(left, L)
right = min(right, R)
print(max(right - left + 1, 0)) |
p03037 | s590585536 | Accepted | N,M = map(int,input().split())
LR = [[i for i in map(int,input().split())] for j in range(M)]
start = 1
end = N
for i in range(M):
if start < LR[i][0]: start = LR[i][0]
if end > LR[i][1]: end = LR[i][1]
ans = end-start+1
if ans < 0: ans = 0
print(ans) |
p03037 | s471865346 | Accepted | n, m = map(int, input().split())
l, r = map(int, input().split())
maxL = l
minR = r
for i in range(m-1):
l, r = map(int, input().split())
if maxL < l:
maxL = l
if minR > r:
minR = r
ans = min(minR, n)
if ans - maxL+1 > 0:
print(ans - maxL+1)
else:
print(0)
|
p03037 | s079867862 | Accepted | import bisect,collections,copy,itertools,math,numpy,string
def I(): return int(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
def LS(): return list(input().split())
##################################################
N,M = LI()
LR = [LI() for _ in range(M)]
a = 0
b = float('INF')
for x ... |
p03037 | s295324962 | Accepted | N,M=map(int,input().split())
_min,_max=map(int,input().split())
for i in range(M-1):
L,R=map(int,input().split())
_min,_max=max(_min,L),min(_max,R)
print(max(_max+1-_min,0)) |
p03037 | s867448311 | Accepted | import sys
import copy
import math
import itertools
import numpy as np
l = [int(c) for c in input().split()]
N=l[0]
M=l[1]
LR=[list(map(int,input().split())) for c in range(M)]
small = 0
large = N
for i in range(M):
if small<LR[i][0]:
small=LR[i][0]
if large>LR[i][1]:
large=LR[i][1]
if sm... |
p03037 | s311770152 | Accepted | n, m = map(int, input().split())
L = []
R = []
for i in range(m):
t1, t2 = map(int, input().split())
L.append(t1)
R.append(t2)
maxl = max(L)
minr = min(R)
ans = minr - maxl + 1
if ans <= 0:
print(0)
else:
print(ans) |
p03037 | s261446200 | Accepted | N, M = [int(x) for x in input().split()]
L, R = zip(*( [[int(x) for x in input().split()] for _ in range(M)]))
l = 0
r = 10 ** 5 + 1
for i in range(M):
l = max(l, L[i])
r = min(r, R[i])
print( max(r - l + 1, 0))
|
p03037 | s025140302 | Accepted | n,m = map(int,input().split())
lr_list = [list(map(int,input().split()))
for nesya in range(m)]
l = 0
r = n
for lr in lr_list:
l = max(l,lr[0])
r = min(r,lr[1])
if l > r:
print(0)
else:
print(r-l+1) |
p03037 | s703464789 | Accepted | n,m=map(int,input().split())
l,r=[],[]
for i in range(m):
ll,rr=map(int,input().split())
l.append(ll)
r.append(rr)
print(min(r) - max(l) + 1 if min(r)-max(l) >= 0 else 0) |
p03037 | s134670122 | Accepted | n, m = map(int, input().split())
l = []
r = []
for i in range(m):
li, ri = map(int, input().split())
l.append(li)
r.append(ri)
maxl = -10**5-1
minr = 10**5+1
for i in range(m):
maxl = max(maxl, l[i])
minr = min(minr, r[i])
print(max(minr - maxl + 1, 0)) |
p03037 | s870349611 | Accepted | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n... |
p03037 | s212503013 | Accepted | N,M = map(int,input().split())
right = N
left = 1
for _ in range(M):
a,b = map(int,input().split())
right = min(right,b)
left = max(left,a)
ans = right-left+1
print(max(0,ans)) |
p03037 | s247524512 | Accepted | n,m=map(int,input().split())
a=[[int(i) for i in input().split()] for l in range(m)]
b=0
s=100000000000
for x in a:
b=max(b,x[0])
s=min(s,x[1])
print(max(0,s-b+1)) |
p03037 | s894250894 | Accepted | if __name__ == "__main__":
n, m = map(int, input().split())
lmax = 0
rmin = n + 1
for i in range(m):
ltmp, rtmp = map(int, input().split())
if ltmp > lmax:
lmax = ltmp
if rtmp < rmin:
rmin = rtmp
if lmax > rmin:
print(0)
else:
prin... |
p03037 | s486383352 | Accepted | n,m = map(int,input().split(" "))
lr = []
ming = 0
maxg = 10 **6
for i in range(m):
a,b = map(int,input().split(" "))
lr.append((a,b))
for i in lr:
if i[0] > ming:
ming = i[0]
if i[1] < maxg:
maxg = i[1]
print(max([0, maxg - ming + 1])) |
p03037 | s357518344 | Accepted | n, m = map(int, input().split())
L, R = 0, 100000
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)) |
p03037 | s229611778 | Accepted | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, M = map(int, input().split())
maxL = 1
minR = N
for _ in range(M):
L, R = map(int, input().split())
maxL = max(maxL, L)
minR = min(minR, R... |
p03037 | s488440415 | Accepted | N,M = map(int,input().split())
mn = 0
mx = N
for i in range(M):
L,R = map(int,input().split())
mn = max(L,mn)
mx = min(R,mx)
print(max(0,mx-mn+1)) |
p03037 | s437218365 | Accepted | n,m=map(int,input().split())
L=[]
M=[]
for i in range(m):
l,m=map(int,input().split())
L.append(l)
M.append(m)
a=max(L)
b=min(M)
if a<=b:
print(b-a+1)
else:
print(0)
|
p03037 | s236958251 | Accepted | N, M = map(int, input().split())
L = 0
R = N+1
for _ in range(M):
l, r = map(int, input().split())
L = max(L, l)
R = min(R, r)
print(R - L + 1 if R - L + 1 >= 0 else 0)
|
p03037 | s574944210 | Accepted | n,m = map(int, input().split())
a = [0,n]
for i in range(m):
s,t = map(int, input().split())
a[0] = max(a[0], s)
a[1] = min(a[1], t)
print(max(a[1] - a[0] + 1, 0)) |
p03037 | s112482001 | Accepted | n , m = map(int , input().split())
l = -10
r = 100000
for i in range(m):
j = list(map(int , input().split()))
l = max(l , j[0])
r = min(r , j[1])
print(max(min(r - l + 1 , n) , 0)) |
p03037 | s992322209 | Accepted | n,k = map(int,input().split())
rc = [list(map(int,input().split())) for i in range(k)]
transpose = [x for x in zip(*rc)]
ans = min(transpose[1]) - max(transpose[0])
if ans<0:
print(0)
else:
print(ans+1) |
p03037 | s799804353 | Accepted | n, m = map(int, input().split())
l = 1
r = 10**5
for _ in range(m):
l_, r_ = map(int, input().split())
l = max(l, l_)
r = min(r, r_)
if r>=l:
print(r-l+1)
else:
print(0) |
p03037 | s133611442 | Accepted | import sys
n, m, *lr = map(int, sys.stdin.read().split())
lr = zip(*[iter(lr)] * 2)
def main():
cnt = [0] * (n + 1)
for l, r in lr:
cnt[l-1] += 1
cnt[r] -= 1
for i in range(n):
cnt[i+1] += cnt[i]
res = 0
for i in range(n):
res += (cnt[i] == m) & 1
... |
p03037 | s784393723 | Accepted | N, M = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(M)]
G = [0, N]
def overlap(a, b):
if max(a[0], b[0]) > min(a[1], b[1]):
return [0, 0]
return [max(a[0], b[0]), min(a[1], b[1])]
for m in range(M):
G = overlap(G, A[m])
if G == [0, 0]:
print(0)
else:
pr... |
p03037 | s735731949 | Accepted | from itertools import accumulate
N, M = map(int, input().split())
card = [0]*N
for _ in range(M):
l, r = map(lambda x: int(x)-1, input().split())
card[l] += 1
if r < N-1:
card[r+1] -= 1
card = accumulate(card)
# c = list(card)
ans = 0
for ci in card:
if ci == M:
ans += 1
print(ans)
|
p03037 | s250053981 | Accepted | n,m = map(int,input().split())
ans = [-1,10**6]
for i in range(m):
tmp = list(map(int,input().split()))
ans[0] = max(ans[0],min(tmp))
ans[1] = min(ans[1],max(tmp))
print(max(ans[1]-ans[0]+1,0)) |
p03037 | s927347842 | Accepted | N,M = map(int, input().split())
li = [list(map(int, input().split())) for i in range(M)]
mi = 0
ma = 10**9
for index, n in enumerate(li):
if mi < n[0]:
mi = n[0]
if ma > n[1]:
ma = n[1]
ans = N - (mi - 1) - (N - ma)
if mi > ma:
print(0)
else:
print(ans) |
p03037 | s979428711 | Accepted | N, M = map(int, input().split())
L, R = [0] * M, [0] * M
for m in range(M):
L[m], R[m] = map(int, input().split())
print(max(min(R) - max(L) + 1, 0)) |
p03037 | s326602498 | Accepted | n, m = map(int, input().split())
left = 0
right = 100000
for _ in range(m):
l, r = map(int, input().split())
left = max(left, l)
right = min(right, r)
result = right - left + 1
print(result if result >= 0 else 0) |
p03037 | s605736515 | Accepted | N,M=map(int,input().split())
import heapq
L=[]
R=[]
for i in range(M):
l,r=map(int,input().split())
heapq.heappush(L, -l)
heapq.heappush(R, r)
l=heapq.heappop(L)
r=heapq.heappop(R)
if -l>r:
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.