problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s721054783 | Accepted | def mapt(fn, *args):
return tuple(map(fn, *args))
def Input():
return mapt(int, input().split(" "))
def main():
n, m = Input()
max_l = 0
min_r = 1e6
for i in range(m):
l, r = Input()
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = min_r - max_l + 1
ans = ma... |
p03037 | s352349650 | Accepted | def main():
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(ans)
if __name__=='__main__':
main() |
p03037 | s886160800 | Accepted | N, M = map(int, input().split())
lr = [tuple(map(int, input().split())) for _ in range(M)]
s = [0] * (N + 1)
for i in range(M):
l, r = lr[i]
s[l - 1] += 1
if r != N + 2:
s[r] -= 1
ruiseki = [0] * (N + 2)
for i in range(N + 1):
ruiseki[i + 1] += ruiseki[i] + s[i]
#max_ = max(ruiseki)
print(rui... |
p03037 | s144434631 | Accepted | n,m = map(int,input().split())
l,r = [],[]
for i in range(m):
a,b = map(int,input().split())
l.append(a)
r.append(b)
num = list(range(1,n+1))
lmax = max(l)
rmin = min(r)
if lmax > rmin:
print(0)
else:
gate = set(range(lmax,rmin+1))
ans = list(set(num) & gate)
print(len(ans)) |
p03037 | s088629246 | Accepted | N, M = map(int, input().split())
max_L = 0
min_R = 10**5
for _ in range(M):
L, R = map(int, input().split())
max_L = max(max_L, L)
min_R = min(min_R, R)
print(len(list(range(max_L, min_R+1)))) |
p03037 | s407547769 | Accepted | N, M = map(int, input().split())
c_min = 1
c_max = 10 ** 5
for i in range(M):
LM = list(map(int, input().split()))
c_min = max(c_min, LM[0])
c_max = min(c_max, LM[1])
if c_min > c_max:
print(0)
else:
print(c_max - c_min + 1) |
p03037 | s341134148 | Accepted | n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
l = []
r = []
for i in range(m):
l.append(a[i][0])
r.append(a[i][1])
ans = min(r)-max(l)+1
if ans <= 0:
print(0)
else:
print(ans) |
p03037 | s822118520 | Accepted | n,m = map(int,input().split())
min = 1
max = n
for i in range(m):
l,r = map(int,input().split())
if min<l: min=l
if max>r: max=r
if min>max:
print(0)
else:
print(max-min+1)
|
p03037 | s487711918 | Accepted | def resolve():
N, M = map(int, input().split())
start_index = 1
last_index = N
for _ in range(M):
pp, ss = map(int, input().split())
start_index = max(start_index, pp)
last_index = min(last_index, ss)
print(max(0, last_index - start_index + 1))
resolve() |
p03037 | s626428064 | Accepted | N, Q = map(int,input().split())
m = 1
M = N
for k in range(Q):
L, R = map(int,input().split())
m = max(L,m)
M = min(M,R)
print(max(0,M-m+1))
|
p03037 | s120994164 | Accepted | N, M = map(int, input().split())
left = 1
right = N
for _ in range(M):
l, r = map(int, input().split())
if left < l:
left = l
if right > r:
right = r
ans = right - left
print(ans + 1 if ans >= 0 else 0)
|
p03037 | s110673051 | Accepted | n, m = map(int, input().split())
low = 0
high = 100001
for i in range(m):
l,m = map(int, input().split())
low = max(low, l)
high = min(high, m)
if high-low+1<0:
print(0)
else:
print(min(high-low+1, n)) |
p03037 | s395994953 | Accepted | n, m = map(int, input().split())
l = []
r = []
for i in range(m):
L, R = map(int, input().split())
l += [L]
r += [R]
l_max = max(l)
r_min = min(r)
print(max(r_min - l_max + 1, 0)) |
p03037 | s289953055 | Accepted | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
L_max = 0
R_min = N
for L, R in LR:
L_max = max(L_max, L)
R_min = min(R_min, R)
ans = 0
if L_max <= R_min:
ans = R_min - L_max + 1
print(ans) |
p03037 | s108576456 | Accepted | N,M=map(int,input().split())
L=[]
R=[]
for i in range(M):
l,r=[int(i) for i in input().split()]
L.append(l)
R.append(r)
Lmax=max(L)
Rmin=min(R)
if Rmin-Lmax>=0:
print(Rmin-Lmax+1)
else:
print(0) |
p03037 | s791555230 | Accepted | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
N,M = MI()
A = [0]*(N+2)
for i in range(M):
l,r = MI()
A[l] += 1
A[r+1] -= 1
from itertools import accumulate
A = list(accumulate(A))
print(sum(A[i] == M for i in range(1,N+1)))
|
p03037 | s784364775 | Accepted | N, M = map(int, input().split())
gate = [input().split() for i in range(M)]
MIN = 0
MAX = float('inf')
for i in range(M):
MIN = max(MIN, int(gate[i][0]))
MAX = min(MAX, int(gate[i][1]))
print(max(MAX - MIN + 1, 0)) |
p03037 | s582067253 | Accepted | N,M = map(int, input().split())
l=0
r=N
for _ in range(M):
ll,rr=map(int,input().split())
l = max(l,ll)
r = min(r,rr)
ans = r - l + 1
print(ans if ans > 0 else 0) |
p03037 | s188967145 | Accepted | n,m = map(int, input().split())
ns = set(i+1 for i in range(n))
l_min = 0
r_max = n
for i in range(m):
l, r = map(int, input().split())
l_min = max(l_min, l)
r_max = min(r_max, r)
print(max(r_max - l_min+1, 0))
|
p03037 | s151695696 | Accepted | N,M = map(int, input().split())
lm,rm = 0,N
for i in range(0,M):
l,r = map(int,input().split())
lm = max(lm,l)
rm = min(rm,r)
print(rm - lm + 1 if rm >= lm else 0) |
p03037 | s861446809 | Accepted | N,M = map(int,input().split())
bottom = 0
top = N+1
for i in range(M):
L,R = map(int,input().split())
bottom = max(bottom, L)
top = min(top,R)
ans = top - bottom + 1
print(ans if ans>=0 else 0) |
p03037 | s183224540 | Accepted | n,m = map(int,input().split())
lr = [list(map(int,input().split())) for _ in range(m)]
for i in range(m-1):
if lr[i][0] > lr[i+1][0]:
lr[i+1][0] = lr[i][0]
if lr[i][1] < lr[i+1][1]:
lr[i+1][1] = lr[i][1]
ans = lr[-1][1] - lr[-1][0] + 1
if ans >= 0:
print(ans)
else:
print(0) |
p03037 | s218260151 | Accepted | N, M = input().split(' ')
N = int(N)
M = int(M)
min = 1
max = N
for i in range(M):
l, m = input().split(' ')
l = int(l)
m = int(m)
if min>m or max<l:
print(0)
break
if min < l:
min = l
if max > m:
max = m
else:
print(max-min+1) |
p03037 | s709789160 | Accepted | n,m=map(int,input().split())
s=[0]*n
left=[]
right=[]
for i in range(m):
l,r=map(int,input().split())
left.append(l)
right.append(r)
if min(right)<max(left):
print(0)
else:
print(min(right)-max(left)+1) |
p03037 | s924769319 | Accepted | N, M = map(int, input().split())
s = -1
t = N+1
for i in range(M):
l,r =map(int, input().split())
s = max(s, l)
t = min(t, r)
print(max(0, t-s+1)) |
p03037 | s795838908 | Accepted | N, M = map(int, input().split())
l_max = 1
r_min = N
for _ 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 | s496397700 | 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)
ans = 0
for i in range(l_max, r_min+1):
ans += 1
print(ans) |
p03037 | s424078019 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
import numpy as np
N,M = map(int,readline().split())
LR = np.array(read().split(),np.int32)
L = LR[::2]; R = LR[1::2]
x = R.min() - L.max() + 1
if x < 0: x = 0
print(x)
|
p03037 | s888120209 | Accepted | n,m = map(int,input().split())
lm,rm = map(int,input().split())
for i in range(m-1):
l,r = map(int,input().split())
lm = max(lm,l)
rm = min(rm,r)
print(max(rm-lm+1,0)) |
p03037 | s983704248 | Accepted | n,m=map(int,input().split())
memo=[0]*n
from itertools import accumulate
for i in range(m):
l,r=map(lambda x:int(x)-1,input().split())
memo[l]+=1
if r+1!=n:
memo[r+1]-=1
ac=list(accumulate(memo))
print(ac.count(m)) |
p03037 | s861428774 | Accepted | def two_input():
return map(int, input().split())
N, M = two_input()
L, R = [], []
for i in range(M):
l, r = two_input()
L.append(l)
R.append(r)
maxl = max(L)
minr = min(R)
ans = 0
for i in range(N):
if maxl <= i+1 <= minr:
ans += 1
print(ans) |
p03037 | s359816996 | Accepted | n, m = map(int, input().split())
max_l = 1
min_r = n
for _ in range(m):
l, r = map(int, input().split())
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = max(min_r - max_l + 1, 0)
print(ans) |
p03037 | s816448963 | Accepted | n,m = map(int, input().split())
l,r = 0,n
for i in range(m):
L,R = map(int, input().split())
l = max(l,L)
r = min(r,R)
print(r-l+1 if l<=r else 0)
|
p03037 | s214906192 | Accepted | n,m=map(int,input().split())
limax=0
rimin=n
for i in range(m):
li,ri=map(int,input().split())
if li>limax:
limax=li
if ri<rimin:
rimin=ri
if rimin<limax:
print(0)
else:
print(rimin-limax+1) |
p03037 | s425553136 | Accepted | def solve(lx, rx):
diff = min(rx) - max(lx)
ans = diff+1 if diff >= 0 else 0
return ans
if __name__ == '__main__':
n, m = map(int, input().split())
lx = []
rx = []
for i in range(m):
l, r = map(int, input().split())
lx.append(l)
rx.append(r)
print(solve(lx, rx... |
p03037 | s408450527 | Accepted |
S = input()
N = int(S.split(" ")[0])
M = int(S.split(" ")[1])
lArr = []
rArr = []
for i in range(M):
S = input()
l1 = int(S.split(" ")[0])
r1 = int(S.split(" ")[1])
lArr.append(l1)
rArr.append(r1)
lArr.sort()
rArr.sort()
l1 = max(lArr)
r1 = min(rArr)
if r1 < l1:
print(0)
else:
print(r... |
p03037 | s054848442 | Accepted | n,a = map(int,input().split())
m = [tuple(map(int,input().split())) for _ in range(a)]
l,r=m[0][0],m[0][1]
for i in range(1,a):
l = max(m[i][0],l)
r = min(m[i][1],r)
print(max(r-l+1,0))
|
p03037 | s794896897 | Accepted | n,m=map(int, input().split())
l_ans=1
r_ans=n
for i in range(m):
l,r=map(int, input().split())
l_ans=max(l_ans,l)
r_ans=min(r_ans,r)
if r_ans>=l_ans:
print(r_ans-l_ans+1)
else:
print(0) |
p03037 | s917296998 | Accepted | N, M = map(int, input().split())
mini = 0
maxi = N
for i in range(M):
L, R = map(int, input().split())
mini = max(mini, L)
maxi = min(maxi, R)
print(maxi - mini + 1 if maxi - mini + 1 > 0 else 0) |
p03037 | s043518254 | Accepted | N, M = map(int, input().split())
a = []
for i in range(M):
a.append(list(map(int, input().split())))
b = [0, float("INF")]
for i in range(M):
b[0] = max(a[i][0], b[0])
b[1] = min(a[i][1], b[1])
if b[0] <= b[1]:
print(b[1] - b[0] + 1)
else:
print(0) |
p03037 | s953890575 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = map(int, readline().split())
lr = [list(map(int, readline().split())) for _ in range(m)]
left = 0
right = n
for i in range(m):
left = max(left, lr[i][0])
right = min(right,lr[i][1])
print... |
p03037 | s835596788 | Accepted | n,m=map(int, input().split())
lr = [map(int, input().split()) for _ in range(m)]
l, r = [list(i) for i in zip(*lr)]
answer = (min(r) - max(l) +1)
if answer > 0:
print(answer)
else:
print("0") |
p03037 | s535405975 | Accepted | n, m = map(int, input().split())
maxl = 0
minr = 10**5
for i in range(m):
l, r = map(int, input().split())
maxl = max(maxl, l)
minr = min(minr, r)
print(max(minr-maxl+1, 0)) |
p03037 | s162693694 | Accepted | N, M = map(int, input().split())
keys = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for key in keys:
if left < key[0]:
left = key[0]
if key[1] < right:
right = key[1]
if right < left:
print(0)
else:
print(right - left + 1) |
p03037 | s045022143 | Accepted | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
card_min = 0
card_max = N
ans = N
#print(card_min, card_max)
for l, r in LR:
if l > card_min:
card_min = l
if r < card_max:
card_max = r
#print(card_min, card_max)
ans = card_max - card_min + 1
... |
p03037 | s266868234 | Accepted | n,m=map(int,input().split())
s=0
t=10**10
for i in range(m):
l,r=map(int,input().split())
s=max(s,l)
t=min(t,r)
if s>t:
print(0)
else:
print(t-s+1) |
p03037 | s881159150 | 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 = 0
l = max(L)
r = min(R)
for i in range(N):
if i+1 >= l and i+1 <= r:
ans += 1
print(ans) |
p03037 | s857102676 | Accepted | N, M = map(int, input().split())
res = 0
L_max = 0
R_min = 100000
for _ in range(M):
L, R = map(int, input().split())
if L_max < L: L_max = L
if R < R_min: R_min = R
print(max(0, (R_min - L_max + 1))) |
p03037 | s845784219 | Accepted | n, m = map(int, input().split())
a = [0]*(n+1)
for i in range(m):
l, r = map(int, input().split())
a[l-1] += 1
a[r] -= 1
for i in range(n): a[i+1] += a[i]
print(a.count(m)) |
p03037 | s617706029 | Accepted | n, m = map(int,input().split())
lst = []
for i in range(m):
lst.append(list(map(int,input().split())))
min = lst[0][0]
max = lst[0][1]
for v in lst:
if v[0] > min:
min = v[0]
if v[1] < max:
max = v[1]
if min <= max:
print(max-min + 1)
elif min > max:
print(0)
|
p03037 | s010912092 | Accepted | L = []
R = []
N, M = map(int, input().split())
for _ in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
if max(L) <= min(R):
print(min(R) - max(L) + 1)
else:
print(0)
|
p03037 | s241722331 | Accepted | n, m = map(int, input().split())
l = 0
r = n
for i in range(m):
lt, rt = map(int, input().split())
l = max(l, lt)
r = min(r, rt)
if(l<=r):
print(r - l + 1)
else:
print(0)
|
p03037 | s958413396 | Accepted | data=input().split()
N=int(data[0])
M=int(data[1])
data_gate=[input().split() for i in range(M)]
data_min=[]
data_max=[]
for i in range(M):
data_min.append(int(data_gate[i][0]))
data_max.append(int(data_gate[i][1]))
m=max(data_min)
M=min(data_max)
if M>=m:
ans=M-m+1
else:
ans=0
print(ans) |
p03037 | s478666515 | Accepted | n, m = map(int, input().split())
l_lst = []
r_lst = []
for i in range(m):
l, r = map(int, input().split())
l_lst.append(l)
r_lst.append(r)
print(max(0, min(r_lst) - max(l_lst) + 1)) |
p03037 | s814151361 | Accepted | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
lList = [arr[0] for arr in LR]
rList = [arr[1] for arr in LR]
l = max(lList)
r = min(rList)
print(max(r-l+1, 0)) |
p03037 | s146068094 | 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)
a=max(L)
b=min(R)
li=[i for i in range(a,b+1)]
print(len(li))
|
p03037 | s250664006 | Accepted | n, m, *lr = list(map(int, open(0).read().split()))
print(max(0, min(lr[1::2]) - max(lr[::2]) + 1))
|
p03037 | s955113137 | Accepted | N,M = list(map(int,input().split()))
MAX = float('-inf')
MIN = float('inf')
for i in range(M):
L,R = list(map(int,input().split()))
MAX = max(MAX, L)
MIN = min(MIN, R)
count = MIN - MAX + 1
if count > 0:
print(count)
else:
print(0) |
p03037 | s257900899 | Accepted | #import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, m = list(map(int,ipti().split()))
l = [0] * m
r = [0] * m
for i in range(m):
l[i], r[i] = list... |
p03037 | s655214855 | Accepted | N,M = map(int, input().split())
Key = [0 for i in range(N+1)]
for _ in range(M):
L,R = map(int,input().split())
L -= 1
R -= 1
Key[L] += 1
Key[R+1] -= 1
count = 0
sum = 0
for i in range(len(Key)):
sum += Key[i]
if sum == M:
count += 1
print(count) |
p03037 | s679880095 | Accepted | n, m = map(int, input().split())
lmax, rmin = map(int, input().split())
for i in range(1, m):
l, r = map(int, input().split())
lmax = max(lmax, l)
rmin = min(rmin, r)
print(max(0, rmin-lmax+1)) |
p03037 | s081278232 | 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)
Rm=min(R)
LM=max(L)
if Rm-LM >= 0:
print(Rm-LM+1)
else:
print(0) |
p03037 | s814607497 | Accepted | N,M=map(int,input().split())
lmax,rmin=1,N
for i in range(M):
l,r=map(int,input().split())
if l > lmax:lmax=l
if r < rmin:rmin=r
print(max(rmin-lmax+1,0)) |
p03037 | s494168126 | Accepted | n, m = map(int, input().split())
a = 0; b = n+1
for _ in range(m):
l, r = map(int, input().split())
a = max(a, l)
b = min(b, r)
print(max(0, b-a+1)) |
p03037 | s585591473 | Accepted | #!/usr/bin/env python3
n, m = list(map(int, input().split()))
min_, max_ = 0, 10**5
for i in range(m):
a, b = list(map(int, input().split()))
min_ = max(min_, a)
max_ = min(max_, b)
print(max(max_-min_+1, 0))
|
p03037 | s355584429 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
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
for i in range(len(card)-1):
card[i+1] += card[i]
print(card.count(M)) |
p03037 | s745692212 | Accepted | N, M = map(int, input().split())
lstL = list()
lstR = list()
for i in range(0, M):
L, R = map(int, input().split())
lstL.append(L)
lstR.append(R)
minVal = max(lstL)
maxVal = min(lstR)
res = (maxVal - minVal + 1) if minVal <= maxVal else 0
print(res) |
p03037 | s474102795 | Accepted | L = []
R = []
N, M = map(int, input().split())
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>=1:
print(ans)
else:
print(0) |
p03037 | s785271891 | Accepted | N, M = map(int, input().split())
limL = -454554565454
limR = 7896541265478456
for i in range(M):
L, R = map(int, input().split())
limL = max([limL, L])#lとしては，大きい方が嬉しい
limR = min([limR, R])#rは小さい方がいい
print(limR-limL+1) if limR-limL+1>0 else print(0) |
p03037 | s531967047 | 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)
ls.sort()
rs.sort()
ans = rs[0] - ls[-1] + 1
ans = max(0,ans)
print(ans) |
p03037 | s337854720 | Accepted | N,M = map(int,input().split())
left = []
right = []
for i in range(M):
l,r = map(int,input().split())
left.append(l)
right.append(r)
if max(left)>min(right):
print(0)
else:
print(min(right)-max(left)+1) |
p03037 | s795186741 | Accepted | n,m=map(int,input().split())
s=[]
S=[]
for i in range(m):
l,r=map(int,input().split())
s.append(l)
S.append(r)
if max(s)<=min(S):
print(min(S)-max(s)+1)
else:
print('0')
|
p03037 | s213109975 | Accepted | N,M=map(int,input().split())
List = []
for i in range (M):
List.append(list(map(int, input().split())))
resList = [0]*N
for i in range(M):
resList[List[i][0]-1] +=1
if List[i][1]<N:
resList[List[i][1]] +=-1
for j in range(1,N):
resList[j] = resList[j] + resList[j-1]
print(resList.count(M)) |
p03037 | s600209170 | Accepted | n,m = map(int, input().split())
lr = [0, 10**6]
for _ in range(m):
t = sorted(list(map(int, input().split())))
lr[0] = max(lr[0], t[0])
lr[1] = min(lr[1], t[1])
ans = lr[1] - lr[0] + 1
if ans < 0:
print(0)
else:
print(ans) |
p03037 | s668730078 | Accepted | n,m=map(int,input().split())
l=1
r=n
for i in range(m):
ll,rr = map(int,input().split())
l=max(l,ll)
r=min(r,rr)
if l<=r:
print(r-l+1)
else:
print(0) |
p03037 | s685785378 | Accepted | N,M = map(int,input().split())
a = list()
b = list()
for i in range(M):
tmp_a,tmp_b = map(int, input().split())
a.append(tmp_a)
b.append(tmp_b)
print(min(b)-max(a)+1 if min(b)-max(a) >= 0 else 0) |
p03037 | s152889406 | Accepted | n, m = map(int, input().split())
llist = []
rlist = []
for i in range(m):
l, r = map(int, input().split())
llist.append(l)
rlist.append(r)
c = 0
lm = max(llist)
rm = min(rlist)
for i in range(1, n + 1):
if lm <= i <= rm:
c += 1
print(c)
|
p03037 | s537406908 | Accepted | N, M = map(int, input().split())
Llist = []
Rlist = []
for i in range(M):
l, r = map(int, input().split())
Llist.append(l)
Rlist.append(r)
if min(Rlist)-max(Llist)+1 > 0:
print(min(Rlist)-max(Llist)+1)
else:
print(0)
|
p03037 | s787290176 | Accepted | N, M = map(int, input().split())
c = [0 for i in range(N+1)]
for x in range(M):
L, R = map(int, input().split())
c[L-1] += 1
c[R] -= 1
r = 0
t = 0
for x in c[:-1]:
t += x
if t == M:
r += 1
print(r)
|
p03037 | s412203439 | Accepted | n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
l_max = 0
r_min = 100000000
for i in range(m):
if (l_max < a[i][0]):
l_max = a[i][0]
for i in range(m):
if (r_min > a[i][1]):
r_min = a[i][1]
print(max(r_min-l_max+1, 0)) |
p03037 | s630412394 | Accepted | N, M = map(int, input().split())
MIN = 0
MAX = 110000
for i in range(M):
L, R = map(int, input().split())
MIN = max(MIN, L)
MAX = min(MAX, R)
#print(MIN, MAX)
ans = MAX-MIN+1 if MAX >= MIN else 0
print(ans) |
p03037 | s889011608 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
n, m = map(int, input().split())
L, R = 1, n
for _ in range(m):
l, m = map(int, input().split())
if l > L: L = l
if m < R: R = m
if R-L+1 < 0:
print(0)
else:
print(R-L+1)
if __name__ ==... |
p03037 | s118729742 | Accepted | N, M = map(int, input().split())
left, right = map(int, input().split())
for _ in range(M-1):
c_left, c_right = map(int, input().split())
if c_left > left:
left = c_left
if c_right < right:
right = c_right
if right >= left:
print(right-left+1)
else:
print(0) |
p03037 | s518215085 | Accepted | #ABC127_C
N,M=map(int,input().split())
L=[]
R=[]
for i in range(M):
l,m=map(int,input().split())
L.append(l)
R.append(m)
if min(R)<max(L):
print(0)
else:
print(min(R)-max(L)+1) |
p03037 | s339430903 | Accepted | N, M = map(int, input().split())
L = 1
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(1+R-L, 0)) |
p03037 | s339627035 | Accepted | def main():
_, _, *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)
main() |
p03037 | s574201976 | Accepted | N,M= list(map(int,input().split()))
end = []
start = []
for i in range(M):
A,B = list(map(int,input().split()))
end.append(B)
start.append(A)
end_min = min(end)
start_max = max(start)
if start_max > end_min:
print(0)
else:
print(end_min-start_max+1) |
p03037 | s821621030 | 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)
if l > R:
print(0)
else:
print(R - L + 1)
|
p03037 | s804783420 | Accepted | from itertools import accumulate
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(0,right-left+1))
imos = [0] * (N + 2)
for i in range(M):
l, r = map(int, input().split())
imo... |
p03037 | s358990486 | Accepted | # C - Prison
N,M = map(int,input().split())
L,R = 1,N
for _ in range(M):
l,r = map(int,input().split())
L,R = max(L,l),min(R,r)
print(max(0,R-L+1)) |
p03037 | s369141725 | Accepted | def main():
N, M = map(int, input().split())
cards = [0] * (N + 1)
for _ in range(M):
l, r = [int(v) - 1 for v in input().split()]
cards[l] += 1
cards[r+1] -= 1
count = 0
if cards[0] == M:
count += 1
for i in range(1, N+1):
cards[i] += cards[i - 1]
... |
p03037 | s764995657 | 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())
s = [0 for _ in range(n+1)]
for i in range(m):
s[l[i]-1] += 1
s[r[i]] -= 1
h = [0]
for i in range(n):
h.append(s[i]+h[i])
ans = 0
for i in range(n+1):
if(h[i] ==... |
p03037 | s939962239 | Accepted | import sys
sys.setrecursionlimit(10000000)
input=sys.stdin.readline
n,m = map(int,input().split())
ansl=-1
ansr=10**6
for _ in range(m):
l,r=map(int,input().split())
ansl=max(ansl,l)
ansr=min(ansr,r)
print(max(ansr-ansl+1,0)) |
p03037 | s107979563 | Accepted | N, M = map(int, input().split())
maxL = 0
minR = float('inf')
for _ in range(M):
l, r = map(int, input().split())
maxL = max(maxL, l)
minR = min(minR, r)
ans = minR - maxL + 1
ans = max(ans, 0)
print(ans)
|
p03037 | s075793484 | Accepted | n, m = map(int, input().split())
x = 1
y = n
for i in range(m):
l, r = map(int, input().split())
x = max(l, x)
y = min(r, y)
print(max(0, y-x+1)) |
p03037 | s369535745 | Accepted | N, M = map(int, input().split())
L = [None] * M
R = [None] * M
for i in range(M):
l, r = map(int, input().split())
L[i] = l
R[i] = r
L_max = max(L)
R_min = min(R)
if L_max > R_min:
print(0)
else:
print(R_min - L_max + 1)
|
p03037 | s573662599 | Accepted | n, m = map(int,input().split())
l = [0]*m
r = [0]*m
for i in range(m):
l1,r1 = map(int,input().split())
l[i] = l1
r[i] = r1
print(max(min(r) - max(l) + 1, 0)) |
p03037 | s134244486 | 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(0, min(R) - max(L) + 1)) |
p03037 | s544271588 | Accepted | n,m = map(int,input().split())
A = [list(map(int,input().split())) for i in range(m)]
ma = 0
mi = float("INF")
for i in range(0,m):
ma = max(ma,A[i][0])
mi = min(mi,A[i][1])
ans = mi-ma+1
if ans >0:
print(ans)
else :
print(0) |
p03037 | s068045297 | Accepted | n,m=[int(x) for x in input().rstrip().split()]
ll=[]
rl=[]
for i in range(m):
l,r=[int(x) for x in input().rstrip().split()]
ll.append(l)
rl.append(r)
ans=0
if min(rl)-max(ll)<0:
print(0)
else:
print(min(rl)-max(ll)+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.