problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s406464107 | Accepted | n,m=map(int,input().split())
l,r=[],[]
for i in range(m):
x,y=map(int,input().split())
l.append(x)
r.append(y)
ansl,ansr=max(l),min(r)
print(max(0,ansr-ansl+1)) |
p03037 | s252218868 | Accepted | n,m=map(int,input().split())
mn,mx=-1,10**7
for _ in range(m):
l,r= map(int,input().split())
mn=max(mn,l)
mx=min(mx,r)
ans=max(mx-mn+1,0)
print(ans) |
p03037 | s770855424 | 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 max(l) > min(r):
print(0)
else:
print(min(r) - max(l) + 1)
|
p03037 | s110654112 | Accepted | n,m = map(int,input().split())
#v = list(map(int,input().split()))
#a = [0 for _ in range(n+1)]
ml = -1
mr = 10**6
for i in range(m):
l,r = map(int,input().split())
ml = max(ml,l)
mr = min(mr,r)
if mr < ml :
res = 0
else:
res = mr-ml + 1
print(res) |
p03037 | s320108645 | Accepted | n, m = map(int, input().split())
a, b = 0, n;
for i in range(m):
l, r = map(int, input().split())
a, b = max(a, l), min(b, r)
print(b-a+1 if a <= b else 0) |
p03037 | s308996818 | Accepted | N,M = map(int,input().split())
L= 0
R = 10 ** 5
for i in range(M):
Lm,Rm = map(int,input().split())
L = max(L,Lm)
R = min(R,Rm)
if R - L < 0:
print(0)
else:
print(R - L + 1) |
p03037 | s750134170 | Accepted | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
n,m=MI()
ls=[]
rs=[]
for i in range(m):
line=input().rstrip().split()
ls.append(int(line[0]))
rs.append(int(line[1]))
mx=0
mn=10**6
for l in ls:
... |
p03037 | s834024929 | Accepted | n, m = map(int, input().split())
left = -1
right = n+1
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 | s436486657 | Accepted | n, m = list(map(int, input().split()))
low =[]
high=[]
for i in range(m):
temp = list(map(int, input().split()))
low.append(temp[0])
high.append(temp[1])
maxlow= max(low)
minhigh=min(high)
if minhigh-maxlow >= 0:
print(minhigh-maxlow+1)
else:
print(0) |
p03037 | s857498078 | Accepted | N, M = map(int, input().split())
Lmax = 0
Rmin = 10**5 + 1
for n in range(M):
L, R = map(int, input().split())
if L > Lmax:
Lmax = L
if R < Rmin:
Rmin = R
gate = Rmin - Lmax + 1
if gate < 0:
print("0")
else:
print(gate) |
p03037 | s627098965 | Accepted | N,M = map(int,input().split())
L1 = 0
R1 = N
for m in range(M):
L2,R2 = map(int,input().split())
L1 = max(L1,L2)
R1 = min(R1,R2)
print(max(0,R1-L1+1)) |
p03037 | s029691446 | Accepted | N, M = map(int, input().split())
LR = [tuple(map(int, input().split())) for _ in range(M)]
L = 1
R = 10**5
for i in range (M):
l = LR[i][0]
r = LR[i][1]
if l > L:
L = l
if r < R:
R = r
print(len(range(L, R+1))) |
p03037 | s599090335 | Accepted | n,m=map(int,input().split())
ansl = 1
ansr = n
for i in range(m):
l,r=map(int,input().split())
ansl = max(ansl,l)
ansr = min(ansr,r)
print(max(0,ansr-ansl+1)) |
p03037 | s170692624 | Accepted | N,M = map(int, input().split())
n = 0
m = 999999
for i in range(M):
a,b = map(int, input().split())
n = max(a, n)
m = min(b , m)
print(m-n+1 if (m >= n) else 0)
|
p03037 | s153225158 | Accepted | n, m = map(int, input().split())
lmin = 0
lmax = 1e5+10
for _ in range(m):
l, r = map(int, input().split())
lmin = max(lmin, l)
lmax = min(lmax, r)
print(max(0, lmax-lmin+1)) |
p03037 | s960723888 | 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(max(0, min(r) - max(l) + 1)) |
p03037 | s850116992 | Accepted | n,m = map(int,input().split())
a = [0] *m
b = [0] *m
for i in range(m):
a[i], b[i] = map(int, input().split())
ans = [a[0],b[0]]
for i in range(m-1):
if ans[0] < a[i+1]:
ans[0] = a[i+1]
if ans[1] > b[i+1]:
ans[1] = b[i+1]
if (ans[1]-ans[0] +1)<= 0:
print(0)
exit()
print(ans[1]-an... |
p03037 | s212717610 | Accepted | n,m = map(int,input().split(' '))
i = 0
lmax = 0
rmin = n
while i < m:
l,r = map(int,input().split(' '))
if l > lmax:
lmax = l
if r < rmin:
rmin = r
i += 1
if lmax <= rmin:
print(rmin-lmax+1)
else:
print(0) |
p03037 | s001126415 | Accepted | n, m = map(int, input().split())
cards = [0]*(n+1)
for _ in range(m):
l, r = map(int, input().split())
cards[l] += 1
if r == n:
continue
cards[r+1] -= 1
for i in range(n):
cards[i+1] += cards[i]
print(cards.count(m)) |
p03037 | s155069218 | Accepted | N, M = map(int, input().split())
L, R = 1, N
for _ 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) |
p03037 | s919129628 | Accepted | N, M, *I = map(int, open(0).read().split())
l = 0
r = N
for i in range(M):
x, y = I[i*2], I[i*2+1]
l = max(l, x)
r = min(r, y)
print(max(r-l+1, 0)) |
p03037 | s966693643 | Accepted | # imos法
n, m = map(int, input().split())
l = []
r = []
imos = [0]*(n+1)
for i in range(m):
L, R = map(int, input().split())
l.append(L)
r.append(R)
for i in range(m):
imos[l[i]-1] += 1
imos[r[i]] -= 1
cum_sum = [imos[0]]
for i in range(1, len(imos)):
cum_sum.append(cum_sum[i - 1] + imos[i])
a... |
p03037 | s392074093 | Accepted | N, M = map(int, input().split())
maxL = 0
minR = float('inf')
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 | s866268405 | Accepted | N, M = map(int, input().split())
left, right = 1, N
for _ in range(M):
L, R = map(int, input().split())
left = max(L, left)
right = min(R, right)
ans = right - left + 1 if left <= right else 0
print(ans) |
p03037 | s290773164 | Accepted | n,m = map(int, input().split())
minn, maxn = 1, n
for i in range(m):
l, r = map(int,input().split())
minn, maxn = max(minn, l), min(maxn, r)
print(max(maxn-minn+1, 0)) |
p03037 | s472887206 | Accepted | n,m=[int(x) for x in input().rstrip().split()]
l=-float('inf')
r=float('inf')
for i in range(m):
L,R=[int(x) for x in input().rstrip().split()]
if l<L:
l=L
if R<r:
r=R
if l<=r:
print(r-l+1)
else:
print(0)
|
p03037 | s570590098 | Accepted | N,M = map(int, input().split())
Lm = -1
Rm = float('inf')
for _ in range(M):
L,R = map(int, input().split())
Lm = max(L, Lm)
Rm = min(R, Rm)
print(max(Rm - Lm + 1, 0)) |
p03037 | s201374832 | Accepted | n, m = map(int, input().split())
l_r = [ list(map(int, input().split())) for _ in range(m) ]
l_ans = 0
r_ans = float('inf')
for l, r in l_r:
l_ans = max(l_ans, l)
r_ans = min(r_ans, r)
if r_ans < l_ans:
ans = 0
else:
ans = r_ans-l_ans+1
print(ans) |
p03037 | s602090863 | Accepted | N, M = map(int, input().split())
left = 0
right = 10 ** 5
for i in range(M):
l, r = map(int, input().split())
left = max(left, l)
right = min(right, r)
print(right - left + 1 if right - left >= 0 else 0) |
p03037 | s571527788 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
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)
max_l = 0
min_r = N
for i in range(M):
if max_l < L[i]:
max_l = L[i]
if min_r > R[i]:
min_r = R[i]
if max_l > mi... |
p03037 | s659347322 | Accepted | n, m = map(int, input().split())
ans = [i for i in range(1, n + 1)]
l_max = 0
r_min = n
for _ in range(m):
x, y = map(int, input().split())
l_max = max(l_max, x)
r_min = min(r_min, y)
print(len([i for i in range(l_max, r_min + 1)]))
|
p03037 | s851892362 | Accepted | n,m = map(int,input().split())
l,r = map(int,input().split())
for i in range(m-1):
l_new,r_new = map(int,input().split())
if l_new > l:
l = l_new
if r_new < r:
r = r_new
if r - l < 0:
print(0)
else:
print(r-l+1) |
p03037 | s683097478 | Accepted | N, M = map(int, input().split())
cards = [list(map(int, input().split())) for _ in range(M)]
left = cards[0][0]
right = cards[0][1]
for i in range(1, M):
if left < cards[i][0]:
left = cards[i][0]
if right > cards[i][1]:
right = cards[i][1]
if left > right:
print(0)
else:
ans = right - ... |
p03037 | s690968721 | Accepted | N, M = map(int, input().split())
P = [0]*(N+1)
for i in range (0, M):
A, B = map(int, input().split())
P[A-1]+=1
P[B]-=1
for i in range (1, N+1):
P[i]+=P[i-1]
P = sorted(P, reverse = True)
count = 0
for i in range (0, N+1):
if P[i] == M:
count+=1
else:
print(count)
exit() |
p03037 | s296606069 | Accepted | N,M=map(int,input().split())
L=0
R=N+1
for i in range(0,M,1):
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 | s204277850 | Accepted | def main():
ll = []
rl = []
n,m = map(int,input().split())
for _ in range(m):
l,r = map(int, input().split())
ll.append(l)
rl.append(r)
l = max(ll)
r = min(rl)
print(max(0,r-l+1))
if __name__ == '__main__':
main() |
p03037 | s685677327 | Accepted | def main():
n, m = map(int, input().split())
card_list = [0] * n
l_list = []
r_list = []
for _ in range(m):
l, r = map(int, input().split())
l_list.append(l)
r_list.append(r)
max_l = max(l_list)
min_r = min(r_list)
print(min_r-max_l+1 if min_r >= max_l else 0... |
p03037 | s187605936 | Accepted | n,m=map(int,input().split())
card =[list(map(int,input().split())) for i in range(m)]
r = card[0][0]
R = card[0][1]
for i in range(m):
if r < card[i][0]:
r = card[i][0]
for i in range(m):
if card[i][1] < R:
R = card[i][1]
ans = max(0,R - r + 1)
print(ans) |
p03037 | s434704262 | 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)
ans=(r+1-l)
if ans<=0:
print(0)
else:
print(ans) |
p03037 | s947687069 | Accepted | import sys
input = sys.stdin.readline
f = lambda:map(int,input().split())
n, m = f()
lm = 0
rm = n
for i in range(m):
l, r = f()
lm = max(lm, l)
rm = min(rm, r)
print(max(rm-lm+1, 0)) |
p03037 | s389168702 | Accepted | n,m=map(int,input().split())
##かーどについての初期配列
head =0
tail = n
for i in range(m):
l,r = map(int,input().split())
head = max(head,l)
tail = min(r,tail)
if tail < head:
print(0)
else:
print(tail-head+1) |
p03037 | s227686478 | 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)
tmp = min(R)-max(L)+1
if tmp >= 1:
print(tmp)
else:
print(0) |
p03037 | s232416959 | Accepted | n,m = map(int,input().split())
ansl = 0
ansr = n+1
for i in range(m):
l,r = map(int,input().split())
ansl = max(ansl,l)
ansr = min(ansr,r)
print(0 if ansl > ansr else ansr-ansl+1) |
p03037 | s405161038 | Accepted | n,m=map(int, input().split( ))
l=0
r = n+1
for _ in range(m):
li,ri = map(int, input().split( ))
l=max(l,li)
r = min(r,ri)
print(max(r-l+1,0)) |
p03037 | s944368965 | Accepted | N, M = map(int, input().split())
l = 0
r = 10e5 + 5
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 | s888973110 | Accepted | n,m = map(int,input().split())
max_L = []
min_R = []
cnt = 0
for i in range(m):
L,R = map(int,input().split())
max_L.append(L)
min_R.append(R)
if max(max_L) <= min(min_R):
print(min(min_R)-max(max_L)+1)
else:
print(0) |
p03037 | s847446810 | 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])
lower = max(L)
upper = min(R)
if lower > upper:
print(0)
else:
print(upper-lower+1)
|
p03037 | s469151382 | Accepted | n, m = map(int, input().split())
L = list()
R = list()
for a in range(m):
l, r = map(int, input().split())
L.append(l)
R.append(r)
ans = 0
Lmax = max(L)
Rmin = min(R)
for a in range(n):
if Lmax <= a+1 and a+1 <= Rmin:
ans += 1
print(ans)
|
p03037 | s615698126 | Accepted | n,m=map(int,input().split())
l=[]
r=[]
for j in range(m):
templ,tempr=map(int,input().split())
l.append(templ)
r.append(tempr)
ans=min(r)-max(l)+1
if ans<0:
ans=0
print(ans) |
p03037 | s165054391 | 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
print(ans if ans >= 0 else 0) |
p03037 | s013078595 | 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)
m = max(L)
M = min(R)
if m <= M: print(M-m+1)
else: print(0) |
p03037 | s571129604 | Accepted | n,m = map(int, input().split())
left = set()
right = set()
for i in range(m):
l,r = map(int, input().split())
left.add(l)
right.add(r)
mini = max(left)
maxi = min(right)
print(len(range(mini,maxi+1))) |
p03037 | s221926027 | Accepted | #n=int(input())
#s,t=input().split()
n,m = map(int, input().split())
#l=list(map(int, input().split()))
l=[0]*100005
r=[1000005]*100005
z=1000010
for i in range(m):
l[i],r[i]=map(int,input().split())
mi=max(l)
ma=min(r)
if mi>ma:
print(0)
else:
print(ma-mi+1) |
p03037 | s454356851 | Accepted | N, M = map(int, input().split())
imos = [0]*(N+1)
for _ in range(M):
# ゲートの情報が入ってくる
l, r = map(lambda x: int(x)-1, input().split())
imos[l] += 1
imos[r+1] -= 1 # rまでは有効であり、r+1以降が無向になる仕様であるのでr+1をデクリメントする
cumulative = [imos[0]]
for value in imos[1:]:
cumulative.append(cumulative[-1]+value)
ans = 0
f... |
p03037 | s891112014 | Accepted | n, m = map(int, input().split())
l = 0
r = n
for i in range(m):
lt, rt = map(int, input().split())
if (lt > l):
l = lt
if (rt < r):
r = rt
if (r <l):
print(0)
else:
print(r-l+1)
|
p03037 | s524259199 | Accepted | N, M = map(int, input().split())
L = sorted([list(map(int, input().split())) for _ in range(M)])
ml = 0
mm = 10**7
for v in L:
ml = max(ml, v[0])
mm = min(mm, v[1])
if (mm - ml + 1 <= 0):
print(0)
exit()
print(mm - ml + 1)
|
p03037 | s719906926 | Accepted | n, m = map(int, input().split())
lr = [tuple(map(int, input().split())) for _ in range(m)]
l = 1
r = n
for i, j in lr:
l = max(i, l)
r = min(j, r)
print(max(r-l+1, 0))
|
p03037 | s304310978 | 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 | s506925613 | Accepted | n, m = map(int, input().split())
s = [0] * (n + 1)
for i in range(m):
l, r = map(int, input().split())
s[l - 1] += 1
s[r] -= 1
for i in range(n):
s[i + 1] += s[i]
print(s.count(m))
|
p03037 | s832188357 | Accepted | n,m=map(int,input().split())
a=0
b=n
for i in range(m):
l,r=map(int,input().split())
if a<l:
a=l
if r<b:
b=r
print(max(b-a+1,0)) |
p03037 | s825878002 | Accepted | n, m = map(int, input().split())
lmax = 0
rmin = n
for i 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 | s126983459 | Accepted | n,m = map(int,input().split())
input_lines = [[int(j) for j in input().split()]for i in range(m)]
start=1
end=n
for line in input_lines:
if line[0]>start:
start=line[0]
if line[1]<end:
end=line[1]
print(len([i for i in range(start,end+1)])) |
p03037 | s027891644 | Accepted | N, M = map(int, input().split())
gate_num = [0 for i in range(N)]
for i in range(M):
L, R = map(int, input().split())
gate_num[L - 1] += 1
if R < N:
gate_num[R] -= 1
for i in range(1, N):
gate_num[i] = gate_num[i] + gate_num[i - 1]
ans = 0
for i in range(N):
if(gate_num[i] == M):
... |
p03037 | s114145029 | Accepted | n,m=list(map(int,input().split()))
l=0
r=10**5+1
for _ in range(m):
ll,rr=list(map(int,input().split()))
l=max(l,ll)
r=min(r,rr)
print(r-l+1 if r-l+1>=0 else 0) |
p03037 | s584534176 | Accepted | # input = sys.stdin.readline
def resolve():
N,M=map(int,input().split())
l, r = map(int, input().split())
for i in range(1,M):
ll,rr=map(int,input().split())
l=max(l,ll)
r=min(r,rr)
print(r-l+1 if r-l+1>=0 else 0)
resolve() |
p03037 | s052525128 | Accepted | n, m = map(int, input().split())
lrl = list(list(map(int, input().split())) for _ in range(m))
lmax = 0
rmin = n
for lr in lrl:
if lr[0] > lmax:
lmax = lr[0]
if lr[1] < rmin:
rmin = lr[1]
if lmax <= rmin:
print(rmin-lmax+1)
else:
print(0)
|
p03037 | s327064315 | Accepted | N, M = map(int, input().split())
minimum = []
maximum = []
for i in range(M):
L, R = map(int, input().split())
minimum.append(L)
maximum.append(R)
ans = int(min(maximum) - max(minimum) + 1)
if ans < 0:
print(0)
else:
print(ans) |
p03037 | s560206799 | 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 | s090859088 | Accepted | n,m=map(int,input().split())
ltmp=1
rtmp=n
for i in range(m):
l,r=map(int,input().split())
ltmp=max(l,ltmp)
rtmp=min(r,rtmp)
if ltmp>rtmp:
print(0)
else:
print(rtmp-ltmp+1) |
p03037 | s582921386 | Accepted | # coding: utf-8
import sys
import itertools
def sr(): return sys.stdin.readline().rstrip()
def ir(): return int(sr())
def lr(): return list(map(int, sr().split()))
N, M = lr()
l_list = []
r_list = []
for i in range(M):
l, r = lr()
l_list.append(l)
r_list.append(r)
for i in range(M):
if i == 0:
... |
p03037 | s652370755 | Accepted | n, m = map(int, input().split())
l, r = [0] * m, [0] * m
for i in range(m):
li, ri = map(int, input().split())
l[i] = li
r[i] = ri
maxl = max(l)
minr = min(r)
if minr < maxl:
print(0)
else:
print(minr - maxl + 1)
|
p03037 | s983436880 | Accepted | n,m = list(map(int,input().split()))
la = 0
ra = n
for i in range(m):
l,r=list(map(int,input().split()))
la = max(la,l)
ra = min(ra,r)
print(max(0,ra-la+1))
|
p03037 | s281946850 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
f_inf = float("inf")
max_l = 0
min_r = f_inf
for l, r in LR:
max_l = max(max_l, l)
min_r = min(min_r, r)
if min_r >= max_l:
print(min_r - max_l + 1)
else:
print(0) |
p03037 | s314524561 | Accepted | N, M = map(int,input().split())
L = 1
R = N
for m in range(M):
L_, R_ = map(int,input().split())
if L < L_:
L = L_
if R_ < R:
R = R_
if R < L:
print(0)
else:
print(R-L+1) |
p03037 | s835924259 | 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)
if l > r:
print(0)
else:
print(r-l+1) |
p03037 | s974983277 | Accepted | def abc127c():
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 = max(min(rs)-max(ls)+1, 0)
print(ans)
abc127c() |
p03037 | s030504870 | Accepted | N,M = map(int,input().split())
L_max = 0
R_min = N
for i in range(M):
L, R = map(int, input().split())
R_min = min(R,R_min)
L_max = max(L,L_max)
print(max(R_min-L_max+1,0)) |
p03037 | s537896067 | Accepted | def INT():
return int(input())
def LI():
return list(map(int, input().split()))
def MI():
return map(int, input().split())
N, M = MI()
gate = [0] * (N + 2)
ans = 0
for _ in range(M):
L, R = MI()
gate[L] += 1
gate[R + 1] -= 1
for i in range(1, N + 1):
gate[i] += gate[i - 1]
for i in... |
p03037 | s009124196 | Accepted | N, M = map(int, input().split())
LR = [tuple(map(int, input().split())) for i in range(M)]
l = 1
r = N
for i in range(M):
l = max(l, LR[i][0])
r = min(r, LR[i][1])
ans = max(0, r - l + 1)
print(ans)
|
p03037 | s896577051 | Accepted | # 36
n, m = map(int, input().split())
l_max, r_min = -1, float('inf')
for i in range(m):
li, ri = map(int, input().split())
l_max = max(l_max, li)
r_min = min(r_min, ri)
ans = r_min - l_max + 1 if (r_min - l_max >= 0) else 0
print(ans) |
p03037 | s421878301 | Accepted | n,m= map(int,input().split())
l1,r1 = map(int,input().split())
lis = [l1,r1]
for i in range(m-1):
l,r = map(int,input().split())
if lis[0]<=l<lis[1] and lis[0]<r<=lis[1]:
lis = [l,r]
elif (lis[1]<l and lis[1]<r) or (l<lis[0] and r<lis[0]):
print(0)
exit()
elif lis[0]<l<=lis[1] and lis[1]<r:
lis... |
p03037 | s386367659 | Accepted | n, m = map(int, input().split())
cardid_2_num_map = [0] * (10**5 + 2)
for i in range(m):
l, r = map(int, input().split())
cardid_2_num_map[l] += 1
cardid_2_num_map[r + 1] -= 1
for i in range(1, n + 1):
cardid_2_num_map[i] += cardid_2_num_map[i - 1]
max_sum_num = max(cardid_2_num_map)
count_max_card =... |
p03037 | s506623778 | Accepted | n,m=map(int,input().split())
bottom=0
top=10**5
for i in range(m):
a,b=map(int,input().split())
bottom=max(bottom,a)
top=min(top,b)
if top<bottom:
print(0)
else:
print(top-bottom+1)
|
p03037 | s488684399 | Accepted | n ,m = map(int, input().split())
l = set()
r = set()
for i in range(m):
li ,ri = map(int, input().split())
l.add(li)
r.add(ri)
r.add(n)
lm = max(l)
rm = min(r)
if lm > rm:
ans = 0
else:
ans = rm-lm+1
print(ans) |
p03037 | s817162221 | Accepted | # -*- coding: utf-8 -*-
def main():
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(reverse=True)
R.sort()
lmax = L[0]
rmin = R[0]
print(max(0,rmin-lmax+1))
if __name__ == '__main... |
p03037 | s434236396 | 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())
ll = max(l)
rr = min(r)
if rr-ll >= 0:
print(rr-ll+1)
else:
print(0) |
p03037 | s878695513 | 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)
limit_min = max(l_list)
limit_max = min(r_list)
cnt = 0
for i in range(1, n + 1):
if limit_min <= i <= limit_max:
cnt += 1
print(cnt)
|
p03037 | s156973234 | 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)
big=min(r)
small=max(l)
print(big-small+1 if big-small>=0 else 0) |
p03037 | s821975520 | Accepted | def main():
N, M = map(int, input().split())
left, right = 0, N-1
for _ in range(M):
l, r = map(int, input().split())
left = max(left, l-1)
right = min(right, r-1)
print(max(0, right - left + 1))
if __name__ == "__main__":
main() |
p03037 | s020729386 | 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
if L > R:
print(0)
else:
print(R - L + 1)
|
p03037 | s804425999 | Accepted | def main():
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
L, R = 1, N
for _ in range(M):
left, right = map(int, input().split())
L = max(L, left)
R = min(R, right)
ans = max(0, R - L + 1)
print(ans)
if __name__ == '__main__':
main()
... |
p03037 | s016704288 | Accepted | import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
N, M = map(int, input().split())
l, r = None, None
for _ in range(M):
L, R = map(int, inpu... |
p03037 | s229254026 | Accepted | N,M = map(int,input().split())
left=1
right=pow(10,5)
for i in range(M):
L,R=map(int,input().split())
left=max(left, L)
right=min(right,R)
ans=right-left+1
print(0 if left>right else ans) |
p03037 | s487813191 | Accepted | N, M = map(int, input().split())
sp = 0
ep = 10**5+1
for i in range(M):
L, R = map(int, input().split())
sp = max(sp, L)
ep = min(ep, R)
print(max(0, ep-sp+1))
|
p03037 | s577171599 | Accepted | from sys import stdin
import numpy as np
N, M = [int(x) for x in stdin.readline().rstrip().split()]
C = np.zeros(N)
Rmin = N
Lmax = 1
for i in range(M):
L, R = [int(x) for x in stdin.readline().rstrip().split()]
if R < Rmin:
Rmin = R
if L > Lmax:
Lmax = L
if Lmax > Rmin:
print(0)
else:
... |
p03037 | s807322765 | Accepted | """
i番目のゲートは LiからRiまでのIDカードのうちどれか1枚を持っていれば通過できます
"""
N, M = map(int, input().split())
left = 0
right =float("inf")
for i in range(M):
L, R = map(int, input().split())
if left<L:
left = L
if right > R:
right = R
print(max(right-left+1,0)) |
p03037 | s765390090 | Accepted | n,m = map(int,input().split())
l,r = [],[]
for i in range(m):
x,y = map(int,input().split())
l.append(x)
r.append(y)
print(max(0,min(r)-max(l)+1)) |
p03037 | s413223327 | Accepted | N,M=list(map(int,input().split()))
l=1
r=N
for m in range(M):
l_,r_ = list(map(int,input().split()))
l = max(l,l_)
r = min(r,r_)
ans = r-l+1
if ans<0:
ans=0
print(ans)
|
p03037 | s573794929 | Accepted | n, m = map(int, input().split())
l, r = 0, 100001
for i in range(m):
x, y = map(int, input().split())
if l <= x:
l = x
if r >= y:
r = y
print(len([x for x in range(l, r+1)])) |
p03037 | s105349940 | Accepted |
n,m = map(int,input().split())
ans,ansf = 1,n
for i in range(m):
l,r = map(int,input().split())
ans = max(ans,l)
ansf = min(ansf,r)
if ansf - ans <0:
print(0)
else:
print(ansf-ans+1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.